E-LIB Suche - Ergebnisse für: Pagourtzis, Aris

1

Approximating subset sum ratio via partition computations:

Alonistiotis, Giannis ; Antonopoulos, Antonis ; Melissinos, Nikolaos...
Acta Informatica. 61 (2024) 2 - p. 101-113 , 2024

Link: https://doi.org/10.1007/..

2

Removable Online Knapsack with Bounded Size Items:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Gourvès, Laurent ; Pagourtzis, Aris - p. 283-296 , 2024

Link: https://doi.org/10.1007/..

3

On the Power of Counting the Total Number of Computation Pa..:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,

Bakali, Eleni ; Chalki, Aggeliki ; Kanellopoulos, Sotiris.. - p. 209-220 , 2024

Link: https://doi.org/10.1007/..

4

Byzantine fault tolerant symmetric-persistent circle evacua..:

Leonardos, Nikos ; Pagourtzis, Aris ; Papaioannou, Ioannis
Theoretical Computer Science. 956 (2023) - p. 113839 , 2023

Link: https://doi.org/10.1016/..

5

Optimal circle search despite the presence of faulty robots:

Georgiou, Konstantinos ; Kranakis, Evangelos ; Leonardos, Nikos..
Information Processing Letters. 182 (2023) - p. 106391 , 2023

Link: https://doi.org/10.1016/..

6

Anonymity and everlasting privacy in electronic voting:

Grontas, Panagiotis ; Pagourtzis, Aris
International Journal of Information Security. 22 (2023) 4 - p. 819-832 , 2023

Link: https://doi.org/10.1007/..

7

Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation fr..:

, In: Algorithmics of Wireless Networks; Lecture Notes in Computer Science,

Behrouz, Pourandokht ; Konstantinidis, Orestis ; Leonardos, Nikos... - p. 87-100 , 2023

Link: https://doi.org/10.1007/..

8

A parallel community detection algorithm based on spanning ..:

, In: 2022 IEEE Eighth International Conference on Big Data Computing Service and Applications (BigDataService),

Potikas, Petros ; Souliou, Dora ; Pagourtzis, Aris. - p. 61-65 , 2022

Link: https://doi.org/10.1109/..

9

Approximation schemes for subset-sums ratio problems:

Melissinos, Nikolaos ; Pagourtzis, Aris ; Triommatis, Theofilos
Theoretical Computer Science. 931 (2022) - p. 17-30 , 2022

Link: https://doi.org/10.1016/..

10

Extension and its price for the connected vertex cover prob..:

Khosravian Ghadikolaei, Mehdi ; Melissinos, Nikolaos ; Monnot, Jérôme.
Theoretical Computer Science. 904 (2022) - p. 66-80 , 2022

Link: https://doi.org/10.1016/..

11

Faster Algorithms for $$k\text {-}\textsc {Subset}\,\textsc..:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,

Antonopoulos, Antonis ; Pagourtzis, Aris ; Petsalakis, Stavros. - p. 37-52 , 2022

Link: https://doi.org/10.1007/..

12

Approximating Subset Sum Ratio via Subset Sum Computations:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Alonistiotis, Giannis ; Antonopoulos, Antonis ; Melissinos, Nikolaos... - p. 73-85 , 2022

Link: https://doi.org/10.1007/..

13

Guest column: A panorama of counting problems the decision ..:

Bakali, Eleni ; Chalki, Aggeliki ; Göbel, Andreas..
ACM SIGACT News. 53 (2022) 3 - p. 46-68 , 2022

Link: https://doi.org/10.1145/..

14

Designated-Verifier Linkable Ring Signatures:

, In: Information Security and Cryptology – ICISC 2021; Lecture Notes in Computer Science,

Behrouz, Pourandokht ; Grontas, Panagiotis ; Konstantakatos, Vangelis.. - p. 51-70 , 2022

Link: https://doi.org/10.1007/..

15

Designated-Verifier Linkable Ring Signatures with Unconditi..:

, In: Algebraic Informatics; Lecture Notes in Computer Science,

Balla, Danai ; Behrouz, Pourandokht ; Grontas, Panagiotis... - p. 55-68 , 2022

Link: https://doi.org/10.1007/..