default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul G. Spirakis
Paul (Pavlos) Spirakis – Pavlos G. Spirakis
Person information
- affiliation: University of Liverpool, UK
- affiliation: University of Patras, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j189]Efthyvoulos Drousiotis
, Paul G. Spirakis:
Single MCMC chain parallelisation on decision trees. Ann. Math. Artif. Intell. 93(1): 219-232 (2025)- [j188]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
Construction of Countably Infinite Programs That Evade Malware/Non-Malware Classification for Any Given Formal System. Cryptogr. 9(1): 16 (2025) - [j187]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-free Robot Scheduling. Inf. Comput. 304: 105294 (2025) - [j186]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The complexity of growing a graph. J. Comput. Syst. Sci. 147: 103587 (2025) - [j185]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The complexity of transitively orienting temporal graphs. J. Comput. Syst. Sci. 150: 103630 (2025) - [i97]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Fast and Safe Scheduling of Robots. CoRR abs/2502.07851 (2025) - [i96]George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis:
Temporal Graph Realization With Bounded Stretch. CoRR abs/2504.14258 (2025) - 2024
- [j184]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica 86(9): 2766-2785 (2024) - [j183]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. 146: 103564 (2024) - [j182]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto:
Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. 38(2): 1701-1732 (2024) - [c320]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-Free Robot Scheduling. ALGOWIN 2024: 1-15 - [c319]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. ALGOWIN 2024: 131-143 - [c318]Vasiliki Liagkou, Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Security Related Properties of Randomly Constructed Combinatorial Structures. CSCML 2024: 356-367 - [c317]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. LATIN (2) 2024: 61-76 - [c316]Efthyvoulos Drousiotis, Alessandro Varsi, Paul G. Spirakis, Simon Maskell:
An SMC Sampler for Decision Trees with Enhanced Initial Proposal for Stochastic Metaheuristic Optimization. LION 2024: 123-137 - [c315]Soodeh Habibi, Efthyvoulos Drousiotis, Alessandro Varsi, Simon Maskell, Robert E. Moore, Paul G. Spirakis:
Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler. LION 2024: 169-184 - [c314]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal Graph Realization from Fastest Paths. SAND 2024: 16:1-16:18 - [c313]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Brief Announcement: Collision-Free Robot Scheduling. SAND 2024: 22:1-22:5 - [c312]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. SAND 2024: 27:1-27:5 - [c311]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Existence of Consensus Converging Organized Groups in Large Social Networks. SIROCCO 2024: 507-512 - [i95]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-Free Robot Scheduling. CoRR abs/2402.12019 (2024) - [i94]George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal transportation trees. CoRR abs/2403.18513 (2024) - [i93]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the existence of δ-temporal cliques in random simple temporal graphs. CoRR abs/2404.07147 (2024) - [i92]Leszek Gasieniec, Lukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul G. Spirakis, Grzegorz Stachowiak:
Anonymous Distributed Localisation via Spatial Population Protocols. CoRR abs/2411.08434 (2024) - [i91]Duncan Adamson, Will Rosenbaum, Paul G. Spirakis:
Distributed weak independent sets in hypergraphs: Upper and lower bounds. CoRR abs/2411.13377 (2024) - 2023
- [j181]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. Algorithmica 85(9): 2817-2842 (2023) - [j180]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault tolerant network constructors. Inf. Comput. 292: 105037 (2023) - [j179]Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky:
Optimality guarantees for crystal structure prediction. Nat. 619(7968): 68-72 (2023) - [j178]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-based network structural dynamics. Theor. Comput. Sci. 944: 113669 (2023) - [c310]Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos:
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. CIAC 2023: 1-4 - [c309]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents. CSCML 2023: 501-510 - [c308]Gabriel Filios, Stylianos Karatzas, Marios Krousarlis, Sotiris E. Nikoletseas, Stefanos H. Panagiotou, Paul G. Spirakis:
Realizing Predictive Maintenance in Production Machinery Through Low-Cost IIoT Framework and Anomaly Detection: A Case Study in a Real-World Manufacturing Environment. DCOSS-IoT 2023: 338-346 - [c307]Pantelis Tzamalis, Sotiris E. Nikoletseas, Paul G. Spirakis:
GestureSet: Public Domain Dataset for Human Gesture Recognition using Wrist-worn Devices: A Preliminary Version. DCOSS-IoT 2023: 404-413 - [c306]Efthyvoulos Drousiotis, Dan W. Joyce, Robert C. Dempsey, Alina Haines, Paul G. Spirakis, Lei Shi, Simon Maskell:
Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation. AIAI (1) 2023: 475-487 - [c305]Efthyvoulos Drousiotis, Alexander M. Phillips, Paul G. Spirakis, Simon Maskell:
Bayesian Decision Trees Inspired from Evolutionary Algorithms. LION 2023: 318-331 - [c304]Nina Klobas, George B. Mertzios, Paul G. Spirakis:
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS 2023: 5:1-5:12 - [c303]Marios Mavronicolas, Paul G. Spirakis:
The Contest Game for Crowdsourcing Reviews. SAGT 2023: 71-89 - [c302]Efthyvoulos Drousiotis, Alessandro Varsi, Paul G. Spirakis, Simon Maskell:
A Shared Memory SMC Sampler for Decision Trees. SBAC-PAD 2023: 209-218 - [c301]Filippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. SOFSEM 2023: 18-32 - [c300]Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
New Clocks, Optimal Line Formation and Self-Replication Population Protocols. STACS 2023: 33:1-33:22 - [e19]David Doty, Paul G. Spirakis:
2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy. LIPIcs 257, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-275-4 [contents] - [i90]Efthyvoulos Drousiotis, Paul G. Spirakis, Simon Maskell:
Parallel Approaches to Accelerate Bayesian Decision Trees. CoRR abs/2301.09090 (2023) - [i89]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023) - [i88]Marios Mavronicolas, Paul G. Spirakis:
The Contest Game for Crowdsourcing Reviews. CoRR abs/2302.14701 (2023) - [i87]Vasiliki Liagkou, Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the existence of highly organized communities in networks of locally interacting agents. CoRR abs/2304.04480 (2023) - [i86]Efthyvoulos Drousiotis, Alexander M. Phillips, Paul G. Spirakis, Simon Maskell:
Bayesian Decision Trees Inspired from Evolutionary Algorithms. CoRR abs/2305.18774 (2023) - [i85]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
On the structural and combinatorial properties in 2-swap word permutation graphs. CoRR abs/2307.01648 (2023) - 2022
- [j177]Vasiliki Liagkou, Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem. Cryptogr. 6(3): 42 (2022) - [j176]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35(2): 185-206 (2022) - [j175]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and fast approximate counting and leader election in populations. Inf. Comput. 285(Part): 104698 (2022) - [j174]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
An extension of the Moran process using type-specific connection graphs. J. Comput. Syst. Sci. 124: 77-96 (2022) - [j173]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125: 106-128 (2022) - [j172]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On convergence and threshold properties of discrete Lotka-Volterra population protocols. J. Comput. Syst. Sci. 130: 1-25 (2022) - [c299]Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI 2022: 10193-10201 - [c298]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - [c297]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the Undecidability of the Panopticon Detection Problem. CSCML 2022: 78-87 - [c296]Gabriel Filios, Andreas Kyriakopoulos, Stavros Livanios, Fotis Manolopoulos, Sotiris E. Nikoletseas, Stefanos Panagiotou, Paul G. Spirakis:
Data-driven soft sensing towards quality monitoring of industrial pasteurization processes. DCOSS 2022: 167-174 - [c295]Efthyvoulos Drousiotis, Lei Shi, Paul G. Spirakis, Simon Maskell:
Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods. EANN 2022: 90-102 - [c294]Efthyvoulos Drousiotis, Paul G. Spirakis:
Single MCMC Chain Parallelisation on Decision Trees. LION 2022: 191-204 - [c293]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS 2022: 62:1-62:15 - [c292]Paul G. Spirakis:
Algorithmic Problems on Temporal Graphs (Invited Talk). SAND 2022: 2:1-2:1 - [c291]Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols. DISC 2022: 44:1-44:3 - [i84]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - [i83]Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR abs/2204.04832 (2022) - [i82]Efthyvoulos Drousiotis, Paul G. Spirakis:
Single MCMC Chain Parallelisation on Decision Trees. CoRR abs/2207.12688 (2022) - [i81]Filippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A spectral algorithm for finding maximum cliques in dense random intersection graphs. CoRR abs/2210.02121 (2022) - 2021
- [j171]Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis:
The Price of Defense. Algorithmica 83(5): 1256-1315 (2021) - [j170]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. Algorithmica 83(11): 3403-3431 (2021) - [j169]Alessandro Varsi, Simon Maskell, Paul G. Spirakis:
An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures. Algorithms 14(12): 342 (2021) - [j168]Paul G. Spirakis:
Maria Serna and her years in Patras. Comput. Sci. Rev. 39: 100350 (2021) - [j167]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Maximum cliques in graphs with small intersection number and random intersection graphs. Comput. Sci. Rev. 39: 100353 (2021) - [j166]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Inf. 12(6): 254 (2021) - [j165]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117: 75-98 (2021) - [j164]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Christoforos L. Raptopoulos:
The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120: 179-193 (2021) - [j163]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. 31(4): 2150020:1-2150020:31 (2021) - [c290]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. AAMAS 2021: 413-419 - [c289]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis. CSCML 2021: 230-243 - [c288]Andreas Bardoutsos, Giorgos Matzarapis, Sotiris E. Nikoletseas, Paul G. Spirakis, Pantelis Tzamalis:
A Complementary Sensing Platform for a holistic approach to Allergic Rhinitis monitoring. DCOSS 2021: 171-180 - [c287]Andreas Bardoutsos, Dimitris Markantonatos, Sotiris E. Nikoletseas, Paul G. Spirakis, Pantelis Tzamalis:
A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices. DCOSS 2021: 380-389 - [c286]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. ISAAC 2021: 28:1-28:16 - [c285]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - [c284]Vasileios Vlachos, Gerasimos Katevas, Ioannis Katsidimas, Emmanouil Kerimakis, Sotiris E. Nikoletseas, Stefanos Panagiotou, Paul G. Spirakis:
ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector. PCI 2021: 362-368 - [c283]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-Based Network Structural Dynamics. SIROCCO 2021: 127-145 - [i80]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i79]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-based Network Structural Dynamics. CoRR abs/2103.04955 (2021) - [i78]Vasiliki Liagkou, Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the undecidability of the Panopticon detection problem. CoRR abs/2107.05220 (2021) - [i77]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - [i76]Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive). CoRR abs/2111.10822 (2021) - 2020
- [j162]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82(10): 2927-2954 (2020) - [j161]Paul G. Spirakis:
Letter from the President. Bull. EATCS 130 (2020) - [j160]Paul G. Spirakis:
Letter from the President. Bull. EATCS 131 (2020) - [j159]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107: 108-123 (2020) - [j158]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. 114: 65-83 (2020) - [j157]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 807: 1-2 (2020) - [c282]Gabriel Filios, Ioannis Katsidimas, Sotiris E. Nikoletseas, Alexandros Souroulagkas, Paul G. Spirakis, Ioannis Tsenempis:
A smart energy management power supply unit for low-power IoT systems. DCOSS 2020: 227-235 - [c281]Gabriel Filios, Ioannis Katsidimas, Emmanouil Kerimakis, Sotiris E. Nikoletseas, Alexandros Souroulagkas, Paul G. Spirakis:
An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects. DCOSS 2020: 396-403 - [c280]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS 2020: 27:1-27:13 - [c279]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC 2020: 448-457 - [c278]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. SEA 2020: 21:1-21:14 - [i75]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR abs/2003.03355 (2020) - [i74]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. CoRR abs/2003.12442 (2020) - [i73]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR abs/2004.06036 (2020) - [i72]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - [i71]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. CoRR abs/2005.11796 (2020) - [i70]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. CoRR abs/2007.00625 (2020) - [i69]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Gathering in 1-Interval Connected Graphs. CoRR abs/2008.07455 (2020) - [i68]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. CoRR abs/2009.01567 (2020)
2010 – 2019
- 2019
- [j156]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81(4): 1416-1449 (2019) - [j155]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. Algorithmica 81(5): 1757-1780 (2019) - [j154]Paul G. Spirakis:
Letter from the President. Bull. EATCS 127 (2019) - [j153]Paul G. Spirakis:
Letter from the President. Bull. EATCS 128 (2019) - [j152]Paul G. Spirakis:
Letter from the President. Bull. EATCS 129 (2019) - [j151]Othon Michail, George Skretas, Paul G. Spirakis:
On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102: 18-39 (2019) - [j150]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal flows in temporal networks. J. Comput. Syst. Sci. 103: 46-60 (2019) - [j149]Eleni C. Akrida, Paul G. Spirakis:
On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Process. Lett. 29(2): 1950009:1-1950009:16 (2019) - [j148]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. SIAM J. Comput. 48(5): 1544-1582 (2019) - [j147]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 777: 1-2 (2019) - [c277]Ioannis Chatzigiannakis, Luca Maiano, Panagiotis Trakadas, Aris Anagnostopoulos, Federico Bacci, Panagiotis Karkazis, Paul G. Spirakis, Theodore B. Zahariadis:
Data-Driven Intrusion Detection for Ambient Intelligence. AmI 2019: 235-251 - [c276]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The Temporal Explorer Who Returns to the Base. CIAC 2019: 13-24 - [c275]Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou:
Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement). CSCML 2019: 324-327 - [c274]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14 - [c273]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2019: 138:1-138:14 - [c272]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - [c271]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. SSS 2019: 243-255 - [i67]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/1903.03101 (2019) - [i66]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? CoRR abs/1903.03636 (2019) - [i65]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. CoRR abs/1903.05992 (2019) - [i64]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. CoRR abs/1906.02774 (2019) - 2018
- [j146]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms 11(10): 149 (2018) - [j145]Othon Michail, Paul G. Spirakis:
Elements of the theory of dynamic networks. Commun. ACM 61(2): 72 (2018) - [j144]Othon Michail, Paul G. Spirakis:
How many cooks spoil the soup? Distributed Comput. 31(6): 455-469 (2018) - [j143]Paul G. Spirakis:
Letter from the President. Bull. EATCS 124 (2018) - [j142]Paul G. Spirakis:
Letter from the President. Bull. EATCS 125 (2018) - [j141]Paul G. Spirakis:
Letter from the President. Bull. EATCS 126 (2018) - [j140]George B. Mertzios, Paul G. Spirakis:
Strong bounds for evolution in networks. J. Comput. Syst. Sci. 97: 60-82 (2018) - [c270]Ioannis Chatzigiannakis, Vasiliki Liagkou, Paul G. Spirakis:
Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. CSCML 2018: 101-104 - [c269]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. GASCom 2018: 106-115 - [c268]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - [c267]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - [c266]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: 790-804 - [c265]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. SAGT 2018: 245-250 - [c264]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO 2018: 38-42 - [c263]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and Fast Approximate Counting and Leader Election in Populations. SSS 2018: 154-169 - [c262]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. WAOA 2018: 165-180 - [c261]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. DISC 2018: 46:1-46:3 - [c260]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. WINE 2018: 126-139 - [p4]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Efficient Approximation Algorithms in Random Intersection Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p3]Sotiris E. Nikoletseas, Paul G. Spirakis:
Randomized Approximation Techniques. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 189-201 - [e18]Igor Potapov, Paul G. Spirakis, James Worrell:
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. LIPIcs 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-086-6 [contents] - [i63]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. CoRR abs/1802.07103 (2018) - [i62]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. CoRR abs/1802.09952 (2018) - [i61]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The temporal explorer who returns to the base. CoRR abs/1805.04713 (2018) - [i60]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Exact size counting in uniform population protocols in nearly logarithmic time. CoRR abs/1805.04832 (2018) - [i59]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fast Approximate Counting and Leader Election in Populations. CoRR abs/1806.02638 (2018) - [i58]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. CoRR abs/1810.01393 (2018) - [i57]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. CoRR abs/1810.04565 (2018) - 2017
- [j139]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica 77(2): 487-514 (2017) - [j138]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - [j137]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining majority in networks with local interactions and very small local memory. Distributed Comput. 30(1): 1-16 (2017) - [j136]Paul G. Spirakis:
Letter from the President. Bull. EATCS 121 (2017) - [j135]Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano:
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS 121 (2017) - [j134]Paul G. Spirakis:
Letter from the President. Bull. EATCS 122 (2017) - [j133]Paul G. Spirakis:
Letter from the President. Bull. EATCS 123 (2017) - [j132]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Chromatic Number of Non-Sparse Random Intersection Graphs. Theory Comput. Syst. 60(1): 112-127 (2017) - [j131]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. 61(3): 907-944 (2017) - [j130]Othon Michail, Paul G. Spirakis:
Connectivity preserving network transformers. Theor. Comput. Sci. 671: 36-55 (2017) - [c259]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
The Computational Complexity of Weighted Greedy Matching. AAAI 2017: 466-474 - [c258]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal Flows in Temporal Networks. CIAC 2017: 43-54 - [c257]Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CIAC 2017: 418-429 - [c256]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP 2017: 136:1-136:15 - [c255]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. MFCS 2017: 20:1-20:14 - [c254]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. SAGT 2017: 240-251 - [c253]Othon Michail, Paul G. Spirakis:
Network Constructors: A Model for Programmable Matter. SOFSEM 2017: 15-34 - [c252]Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics and Stability of Probabilistic Population Processes. SSS 2017: 33-45 - [c251]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. SSS 2017: 441-455 - [e17]Paul G. Spirakis, Philippas Tsigas:
Stabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Boston, MA, USA, November 5-8, 2017, Proceedings. Lecture Notes in Computer Science 10616, Springer 2017, ISBN 978-3-319-69083-4 [contents] - [i56]Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CoRR abs/1701.08108 (2017) - [i55]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Bounding the Cover Time in Edge-Uniform Stochastic Graphs. CoRR abs/1702.05412 (2017) - [i54]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. CoRR abs/1702.08899 (2017) - [i53]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR abs/1703.04381 (2017) - [i52]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
A 3-player protocol preventing persistence in strategic contention with limited feedback. CoRR abs/1707.01439 (2017) - [i51]Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis:
Learning Powers of Poisson Binomial Distributions. CoRR abs/1707.05662 (2017) - [i50]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. CoRR abs/1710.07365 (2017) - 2016
- [j129]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica 74(1): 385-414 (2016) - [j128]Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. Distributed Comput. 29(3): 207-237 (2016) - [j127]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [j126]Paul G. Spirakis:
Letter from the President. Bull. EATCS 120 (2016) - [j125]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. 87: 109-120 (2016) - [j124]Othon Michail, Paul G. Spirakis:
Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634: 1-23 (2016) - [c250]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. ESA 2016: 30:1-30:16 - [c249]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Stably Computing Order Statistics with Arithmetic Population Protocols. MFCS 2016: 68:1-68:14 - [c248]Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, Grzegorz Stachowiak:
Deterministic Population Protocols for Exact Majority and Plurality. OPODIS 2016: 14:1-14:14 - [c247]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. SAGT 2016: 15-26 - [c246]Othon Michail, Paul G. Spirakis:
How Many Cooks Spoil the Soup? SIROCCO 2016: 3-18 - [r21]Paul (Pavlos) Spirakis:
Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2016: 137-141 - [r20]Paul (Pavlos) Spirakis:
Best Response Algorithms for Selfish Routing. Encyclopedia of Algorithms 2016: 181-183 - [r19]Charilaos Efthymiou, Paul (Pavlos) Spirakis:
Hamilton Cycles in Random Intersection Graphs. Encyclopedia of Algorithms 2016: 891-894 - [r18]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
Independent Sets in Random Intersection Graphs. Encyclopedia of Algorithms 2016: 961-964 - [r17]Dimitris Fotakis, Paul (Pavlos) Spirakis:
Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2016: 1298-1302 - [r16]Paul (Pavlos) Spirakis:
Selfish Unsplittable Flows: Algorithms for Pure Equilibria. Encyclopedia of Algorithms 2016: 1930-1932 - [r15]Alexis C. Kaporis, Paul (Pavlos) Spirakis:
Stackelberg Games: The Price of Optimum. Encyclopedia of Algorithms 2016: 2078-2083 - [r14]Paul (Pavlos) Spirakis:
Tail Bounds for Occupancy Problems. Encyclopedia of Algorithms 2016: 2198-2199 - [r13]Pavlos S. Efraimidis, Paul (Pavlos) Spirakis:
Weighted Random Sampling. Encyclopedia of Algorithms 2016: 2365-2367 - [i49]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
On the Complexity of Weighted Greedy Matchings. CoRR abs/1602.05909 (2016) - [i48]Othon Michail, Paul G. Spirakis:
How Many Cooks Spoil the Soup? CoRR abs/1604.07187 (2016) - [i47]Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Flows in Temporal networks. CoRR abs/1606.01091 (2016) - [i46]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. CoRR abs/1606.06580 (2016) - 2015
- [j123]Othon Michail, Paul G. Spirakis:
Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distributed Comput. 81-82: 1-10 (2015) - [j122]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the structure of equilibria in basic network formation. Theor. Comput. Sci. 590: 96-105 (2015) - [c245]Eleni C. Akrida, Paul G. Spirakis:
On Verifying and Maintaining Connectivity of Interval Temporal Networks. ALGOSENSORS 2015: 142-154 - [c244]Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis:
Rationality Authority for Provable Rational Behavior. Algorithms, Probability, Networks, and Games 2015: 33-48 - [c243]Maria I. Andreou, Dimitris Fotakis, Vicky Papadopoulou Lesta, Sotiris E. Nikoletseas, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations. Algorithms, Probability, Networks, and Games 2015: 97-132 - [c242]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. ICALP (1) 2015: 393-405 - [c241]Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis:
The Match-Maker: Constant-Space Distributed Majority via Random Walks. SSS 2015: 67-80 - [c240]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
On Temporally Connected Graphs of Small Cost. WAOA 2015: 84-96 - [e16]Chryssis Georgiou, Paul G. Spirakis:
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015. ACM 2015, ISBN 978-1-4503-3617-8 [contents] - [i45]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. CoRR abs/1502.04382 (2015) - [i44]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Designing and Testing Temporally Connected Graphs. CoRR abs/1502.04579 (2015) - [i43]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. CoRR abs/1503.09168 (2015) - [i42]Dimitrios Amaxilatis, Marios Logaras, Othon Michail, Paul G. Spirakis:
NETCS: A New Simulator of Population Protocols and Network Constructors. CoRR abs/1508.06731 (2015) - [i41]Argyrios Deligkas, Paul G. Spirakis:
On Equilibrium Computation in Biased Games with Quadratic Penalties. CoRR abs/1509.02023 (2015) - [i40]Othon Michail, Paul G. Spirakis:
Connectivity Preserving Network Transformers. CoRR abs/1512.02832 (2015) - 2014
- [j121]Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis:
Information security for sensors by overwhelming random sequences and permutations. Ad Hoc Networks 12: 193-200 (2014) - [j120]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - [j119]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distributed Comput. 74(1): 2016-2026 (2014) - [j118]Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Theory Comput. Syst. 54(3): 479-490 (2014) - [j117]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521: 107-122 (2014) - [c239]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining Majority in Networks with Local Interactions and Very Small Local Memory. ICALP (1) 2014: 871-882 - [c238]Othon Michail, Paul G. Spirakis:
Traveling Salesman Problems in Temporal Graphs. MFCS (2) 2014: 553-564 - [c237]Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. PODC 2014: 76-85 - [c236]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: diameter and connectivity. SPAA 2014: 267-276 - [c235]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. WINE 2014: 58-71 - [i39]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining Majority in Networks with Local Interactions and very Small Local Memory. CoRR abs/1404.7671 (2014) - [i38]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. CoRR abs/1409.3741 (2014) - 2013
- [j116]Christos Manolopoulos, Dimitris Sofotassios, Paul G. Spirakis, Yannis C. Stamatiou:
A Framework for Protecting Voters' Privacy In Electronic Voting Procedures. J. Cases Inf. Technol. 15(2): 1-33 (2013) - [j115]Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis:
Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013) - [j114]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural models for evolution on networks. Theor. Comput. Sci. 477: 76-95 (2013) - [j113]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The computational power of simple protocols for self-awareness on graphs. Theor. Comput. Sci. 512: 98-118 (2013) - [c234]Paul G. Spirakis, Panagiota N. Panagopoulou:
Potential Functions in Strategic Games. CSR 2013: 283-297 - [c233]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Structure of Equilibria in Basic Network Formation. FCT 2013: 259-270 - [c232]Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos:
A Guided Tour in Random Intersection Graphs. ICALP (2) 2013: 29-35 - [c231]George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) 2013: 657-668 - [c230]George B. Mertzios, Paul G. Spirakis:
Strong Bounds for Evolution in Networks. ICALP (2) 2013: 669-680 - [c229]Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou, Christina Vichou:
Agent agreement protocols based on golay error-correcting code. IISA 2013: 1-6 - [c228]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. SOFSEM 2013: 332-343 - [c227]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Naming and Counting in Anonymous Unknown Dynamic Networks. SSS 2013: 281-295 - [c226]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. WINE 2013: 188-201 - [e15]Paul G. Spirakis, Maria J. Serna:
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Lecture Notes in Computer Science 7878, Springer 2013, ISBN 978-3-642-38232-1 [contents] - [i37]Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Structure of Equilibria in Basic Network Formation. CoRR abs/1306.1677 (2013) - [i36]Rajgopal Kannan, Costas Busch, Paul G. Spirakis:
The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs. CoRR abs/1308.4101 (2013) - [i35]Othon Michail, Paul G. Spirakis:
Simple and Efficient Local Codes for Distributed Stable Network Construction. CoRR abs/1309.6978 (2013) - [i34]Paul G. Spirakis, Eleni Ch. Akrida:
Moving in temporal graphs with very sparse random availability of edges. CoRR abs/1310.7898 (2013) - 2012
- [j112]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012) - [j111]Panagiota N. Panagopoulou, Paul G. Spirakis:
Playing a Game to Bound the Chromatic Number. Am. Math. Mon. 119(9): 771-778 (2012) - [j110]Spyros C. Kontogiannis, Paul G. Spirakis:
On mutual concavity and strategically-zero-sum bimatrix games. Theor. Comput. Sci. 432: 64-76 (2012) - [j109]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient methods for selfish network design. Theor. Comput. Sci. 448: 9-20 (2012) - [c225]Vasiliki Liagkou, George Metakides, Apostolos Pyrgelis, Christoforos L. Raptopoulos, Paul G. Spirakis, Yannis C. Stamatiou:
Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials. APF 2012: 140-156 - [c224]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. MFCS 2012: 728-739 - [c223]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. OPODIS 2012: 269-283 - [c222]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167 - [c221]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960 - [c220]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. SSS 2012: 77-89 - [c219]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. DISC 2012: 437-438 - [e14]Christos Kaklamanis, Theodore S. Papatheodorou, Paul G. Spirakis:
Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science 7484, Springer 2012, ISBN 978-3-642-32819-0 [contents] - [i33]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436 (2012) - [i32]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. CoRR abs/1202.4665 (2012) - [i31]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. CoRR abs/1204.4054 (2012) - [i30]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks. CoRR abs/1206.1290 (2012) - [i29]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012) - [i28]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Naming and Counting in Anonymous Unknown Dynamic Networks. CoRR abs/1208.0180 (2012) - [i27]George B. Mertzios, Paul G. Spirakis:
Strong Bounds for Evolution in Undirected Graphs. CoRR abs/1211.2384 (2012) - 2011
- [b2]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2011, ISBN 978-3-031-00876-4 - [j108]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. Algorithmica 61(1): 116-140 (2011) - [j107]Ioannis Chatzigiannakis, Paul G. Spirakis:
Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts. Comput. Sci. Rev. 5(1): 4-6 (2011) - [j106]Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis:
Computational models for networks of tiny artifacts: A survey. Comput. Sci. Rev. 5(1): 7-25 (2011) - [j105]Carlo Blundo, Angelo De Caro, Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis:
Innovative approaches for security of small artefacts. Comput. Sci. Rev. 5(1): 47-55 (2011) - [j104]Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Robust and scalable middleware for selfish-computer systems. Comput. Sci. Rev. 5(1): 69-84 (2011) - [j103]Alexis C. Kaporis, Paul G. Spirakis:
Selfish splittable flows and NP-completeness. Comput. Sci. Rev. 5(3): 209-228 (2011) - [j102]Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata. Int. J. Auton. Adapt. Commun. Syst. 4(1): 4-38 (2011) - [j101]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Mediated population protocols. Theor. Comput. Sci. 412(22): 2434-2450 (2011) - [j100]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46): 6469-6483 (2011) - [j99]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the independence number and Hamiltonicity of uniform random intersection graphs. Theor. Comput. Sci. 412(48): 6750-6760 (2011) - [c218]Dimitrios Amaxilatis, Ioannis Chatzigiannakis, Shlomi Dolev, Christos Koninis, Apostolos Pyrgelis, Paul G. Spirakis:
Adaptive Hierarchical Network Structures for Wireless Sensor Networks. ADHOCNETS 2011: 65-80 - [c217]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Selected Combinatorial Properties of Random Intersection Graphs. Algebraic Foundations in Computer Science 2011: 347-362 - [c216]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. FOMC 2011: 6-15 - [c215]Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou:
A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution. ICGS3/e-Democracy 2011: 72-79 - [c214]Ioannis Chatzigiannakis, Apostolos Pyrgelis, Paul G. Spirakis, Yannis C. Stamatiou:
Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices. MASS 2011: 715-720 - [c213]Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis:
Rationality authority for provable rational behavior. PODC 2011: 289-290 - [c212]Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). SAGT 2011: 190-199 - [c211]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The Computational Power of Simple Protocols for Self-awareness on Graphs. SSS 2011: 135-147 - [c210]Spyros C. Kontogiannis, Paul G. Spirakis:
Approximability of Symmetric Bimatrix Games and Related Experiments. SEA 2011: 1-20 - [c209]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural Models for Evolution on Networks. WINE 2011: 290-301 - [c208]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Communication and security in random intersection graphs models. WOWMOM 2011: 1-6 - [p2]Paul G. Spirakis:
Population Protocols and Related Models. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 109-159 - [p1]Sotiris E. Nikoletseas, Paul G. Spirakis:
Probabilistic Data Propagation in Wireless Sensor Networks. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 353-380 - [i26]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural Models for Evolution on Networks. CoRR abs/1102.3426 (2011) - [i25]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. CoRR abs/1104.4353 (2011) - [i24]Ioannis Chatzigiannakis, Apostolos Pyrgelis, Paul G. Spirakis, Yannis C. Stamatiou:
Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices. CoRR abs/1107.1626 (2011) - [i23]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. CoRR abs/1111.3321 (2011) - 2010
- [j98]Spyros C. Kontogiannis, Paul G. Spirakis:
Well Supported Approximate Equilibria in Bimatrix Games. Algorithmica 57(4): 653-667 (2010) - [j97]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. Theory Comput. Syst. 47(1): 38-59 (2010) - [j96]Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Game authority for robust and scalable distributed selfish-computer systems. Theor. Comput. Sci. 411(26-28): 2459-2466 (2010) - [j95]Charilaos Efthymiou, Paul G. Spirakis:
Sharp thresholds for Hamiltonicity in random intersection graphs. Theor. Comput. Sci. 411(40-42): 3714-3730 (2010) - [c207]Spyros C. Kontogiannis, Paul G. Spirakis:
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. APPROX-RANDOM 2010: 312-325 - [c206]Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis:
Information security for sensors by overwhelming random sequences and permutations. CCS 2010: 669-671 - [c205]Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis:
Information security for sensors by overwhelming random sequences and permutations. DIALM-PODC 2010: 43-48 - [c204]Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou:
Fun with Games. FUN 2010: 4-15 - [c203]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. MFCS 2010: 270-281 - [c202]Ioannis Chatzigiannakis, Christos Koninis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Distributed Game-Theoretic Vertex Coloring. OPODIS 2010: 103-118 - [c201]Paul G. Spirakis, Vasileios Vlachos, Vassilios Karakoidas, Dimitrios Liappis, Dimitris Kalaitzis, Eftychios Valeontis, Spyros K. Kollias, George Argyros:
Blueprints for a Large-Scale Early Warning System. Panhellenic Conference on Informatics 2010: 7-11 - [c200]Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis:
Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. SPAA 2010: 76-78 - [c199]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Algorithmic Verification of Population Protocols. SSS 2010: 221-235 - [c198]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Stably Decidable Graph Languages by Mediated Population Protocols. SSS 2010: 252-266 - [c197]Haralampos Tsaknakis, Paul G. Spirakis:
Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra. WINE 2010: 378-390 - [e13]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6198, Springer 2010, ISBN 978-3-642-14164-5 [contents] - [e12]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, ISBN 978-3-642-14161-4 [contents] - [e11]Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis:
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Lecture Notes in Computer Science 6386, Springer 2010, ISBN 978-3-642-16169-8 [contents] - [i22]Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis:
The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game. CoRR abs/1002.1099 (2010) - [i21]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Logarithmic Space Machines. CoRR abs/1004.3395 (2010) - [i20]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Machines that Use Restricted Space. CoRR abs/1012.2440 (2010)
2000 – 2009
- 2009
- [b1]Josep Díaz, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
Paradigms for fast parallel approximability (Reprint from 1997). Cambridge international series on parallel computation 8, Cambridge University Press 2009, ISBN 978-0-521-43170-5, pp. I-VIII, 1-158 - [j94]Sotiris E. Nikoletseas, Paul G. Spirakis:
Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. Algorithms 2(1): 121-157 (2009) - [j93]David Hales, Bruce Edmonds, Özalp Babaoglu, Paul G. Spirakis:
Preface to special issue on cooperation in selfish systems. Comput. Math. Organ. Theory 15(2): 61-63 (2009) - [j92]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The survival of the weakest in networks. Comput. Math. Organ. Theory 15(2): 127-146 (2009) - [j91]Paul G. Spirakis:
Book review. Comput. Sci. Rev. 3(1): 41-46 (2009) - [j90]Marios Mavronicolas, Paul G. Spirakis:
A glimpse at Christos H. Papadimitriou. Comput. Sci. Rev. 3(2): 55-63 (2009) - [j89]Paul G. Spirakis:
A note on proofs of existence of Nash equilibria in finite strategic games, of two players. Comput. Sci. Rev. 3(2): 101-103 (2009) - [j88]Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis:
Recent Advances in Approximability of Bimatrix Nash. Bull. EATCS 98: 60-77 (2009) - [j87]Marios Mavronicolas, Loizos Michael, Paul G. Spirakis:
Computing on a partially eponymous ring. Theor. Comput. Sci. 410(6-7): 595-613 (2009) - [j86]Alexis C. Kaporis, Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8-10): 745-755 (2009) - [j85]Spyros C. Kontogiannis, Paul G. Spirakis:
On the support size of stable strategies in random games. Theor. Comput. Sci. 410(8-10): 933-942 (2009) - [j84]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Preface. Theor. Comput. Sci. 410(17): 1551 (2009) - [j83]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. 410(17): 1599-1606 (2009) - [j82]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009) - [j81]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Expander properties and the cover time of random intersection graphs. Theor. Comput. Sci. 410(50): 5261-5272 (2009) - [c196]Orestis Akribopoulos, Marios Logaras, Nikos Vasilakis, Panagiotis C. Kokkinos, Georgios Mylonas, Ioannis Chatzigiannakis, Paul G. Spirakis:
Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets. Advances in Computer Entertainment Technology 2009: 174-181 - [c195]Orestis Akribopoulos, Marios Logaras, Nikos Vasilakis, Panagiotis C. Kokkinos, Georgios Mylonas, Ioannis Chatzigiannakis, Paul G. Spirakis:
Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks. Advances in Computer Entertainment Technology 2009: 453 - [c194]Christos Manolopoulos, Rozina Efstathiadou, Paul G. Spirakis:
The Impact of the Web and Political Balance to e-Democracy. e-Democracy 2009: 13-28 - [c193]Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou:
Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society? e-Democracy 2009: 199-208 - [c192]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262 - [c191]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Mediated Population Protocols. ICALP (2) 2009: 363-374 - [c190]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient Methods for Selfish Network Design. ICALP (2) 2009: 459-471 - [c189]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Combinatorial properties for efficient communication in distributed networks with local interactions. IPDPS 2009: 1-11 - [c188]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Recent Advances in Population Protocols. MFCS 2009: 56-76 - [c187]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Colouring Non-sparse Random Intersection Graphs. MFCS 2009: 600-611 - [c186]Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
Not All Fair Probabilistic Schedulers Are Equivalent. OPODIS 2009: 33-47 - [c185]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. DISC 2009: 239-240 - [c184]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. WINE 2009: 316-327 - [i19]Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
On the Fairness of Probabilistic Schedulers for Population Protocols. Algorithmic Methods for Distributed Cooperative Systems 2009 - [i18]Haralampos Tsaknakis, Paul G. Spirakis:
A Graph Spectral Approach for Computing Approximate Nash Equilibria. CoRR abs/0909.4686 (2009) - [i17]Haralampos Tsaknakis, Paul G. Spirakis:
A Graph Spectral Approach for Computing Approximate Nash Equilibria. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j80]Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Network Game with Attackers and a Defender. Algorithmica 51(3): 315-341 (2008) - [j79]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52(1): 19-43 (2008) - [j78]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
A graph-theoretic network security game. Int. J. Auton. Adapt. Commun. Syst. 1(4): 390-410 (2008) - [j77]Dimitris Fotakis, Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games. Internet Math. 5(4): 343-363 (2008) - [j76]Haralampos Tsaknakis, Paul G. Spirakis:
An Optimization Approach for Approximate Nash Equilibria. Internet Math. 5(4): 365-382 (2008) - [j75]Paul G. Spirakis:
Preface. Theory Comput. Syst. 42(1): 1 (2008) - [j74]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4): 52:1-52:27 (2008) - [j73]Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient sensor network design for continuous monitoring of moving objects. Theor. Comput. Sci. 402(1): 56-66 (2008) - [j72]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Large independent sets in general random intersection graphs. Theor. Comput. Sci. 406(3): 215-224 (2008) - [j71]Charilaos Efthymiou, Paul G. Spirakis:
Random sampling of colourings of sparse random graphs with a constant number of colours. Theor. Comput. Sci. 407(1-3): 134-154 (2008) - [c183]Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract). Autonomics 2008: 37 - [c182]Ioannis Chatzigiannakis, Vasiliki Liagkou, D. Salouros, Paul G. Spirakis:
A Security Model for Internet-Based Digital Asset Management Systems. ECSA 2008: 326-329 - [c181]Christos Manolopoulos, Dimitris Sofotassios, Polyxeni Nakou, Yannis C. Stamatiou, Anastasia Panagiotaki, Paul G. Spirakis:
A step-wise refinement approach for enhancing e-voting acceptance. ICEGOV 2008: 275-280 - [c180]Panagiota N. Panagopoulou, Paul G. Spirakis:
A Game Theoretic Approach for Efficient Graph Coloring. ISAAC 2008: 183-195 - [c179]Ioannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis:
Scheduling tasks with dependencies on asymmetric multiprocessors. PODC 2008: 454 - [c178]Paul G. Spirakis:
Approximate Equilibria for Strategic Two Person Games. SAGT 2008: 5-21 - [c177]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. SAGT 2008: 121-132 - [c176]Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics of Adaptive Networked Societies of Tiny Artefacts. SASO Workshops 2008: 67-72 - [c175]Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability. WALCOM 2008: 188-199 - [c174]Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols. DISC 2008: 498-499 - [c173]Dimitris Kalles, Alexis C. Kaporis, Paul G. Spirakis:
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. WEA 2008: 181-193 - [c172]Spyros C. Kontogiannis, Paul G. Spirakis:
Equilibrium Points in Fear of Correlated Threats. WINE 2008: 210-221 - [c171]Haralampos Tsaknakis, Paul G. Spirakis, Dimitrios Kanoulas:
Performance Evaluation of a Descent Algorithm for Bi-matrix Games. WINE 2008: 222-230 - [r12]Pavlos S. Efraimidis, Paul G. Spirakis:
Weighted Random Sampling. Encyclopedia of Algorithms 2008 - [r11]Charilaos Efthymiou, Paul G. Spirakis:
Hamilton Cycles in Random Intersection Graphs. Encyclopedia of Algorithms 2008 - [r10]Dimitris Fotakis, Paul G. Spirakis:
Minimum Congestion Redundant Assignments. Encyclopedia of Algorithms 2008 - [r9]Alexis C. Kaporis, Paul G. Spirakis:
Stackelberg Games: The Price of Optimum. Encyclopedia of Algorithms 2008 - [r8]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008 - [r7]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Independent Sets in Random Intersection Graphs. Encyclopedia of Algorithms 2008 - [r6]Paul G. Spirakis:
Best Response Algorithms for Selfish Routing. Encyclopedia of Algorithms 2008 - [r5]Paul G. Spirakis:
Selfish Unsplittable Flows: Algorithms for Pure Equilibria. Encyclopedia of Algorithms 2008 - [r4]Paul G. Spirakis:
Tail Bounds for Occupancy Problems. Encyclopedia of Algorithms 2008 - [i16]Charilaos Efthymiou, Paul G. Spirakis:
Random sampling of colourings of sparse random graphs with a constant number of colours. CoRR abs/0804.2343 (2008) - [i15]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the performance of approximate equilibria in congestion games. CoRR abs/0804.3160 (2008) - [i14]Ioannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis:
Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model. CoRR abs/0804.4039 (2008) - [i13]Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou:
A probabilistic key agreement scheme for sensor networks without key predistribution. CoRR abs/0806.1812 (2008) - [i12]Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols. CoRR abs/0807.0140 (2008) - 2007
- [j70]Marios Mavronicolas, Paul G. Spirakis:
The Price of Selfish Routing. Algorithmica 48(1): 91-126 (2007) - [j69]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Performance and stability bounds for dynamic networks. J. Parallel Distributed Comput. 67(4): 386-399 (2007) - [j68]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
The increase of the instability of networks due to Quasi-Static link capacities. Theor. Comput. Sci. 381(1-3): 44-56 (2007) - [c170]Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou:
Trust in global computing systems as a limit property emerging from short range random interactions. ARES 2007: 741-748 - [c169]Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects. ALGOSENSORS 2007: 18-31 - [c168]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. CAI 2007: 236-246 - [c167]Athanasios Antoniou, C. Korakas, Christos Manolopoulos, Anastasia Panagiotaki, Dimitris Sofotassios, Paul G. Spirakis, Yannis C. Stamatiou:
A Trust-Centered Approach for Building E-Voting Systems. EGOV 2007: 366-377 - [c166]Spyros C. Kontogiannis, Paul G. Spirakis:
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. ICALP 2007: 595-606 - [c165]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Expander Properties and the Cover Time of Random Intersection Graphs. MFCS 2007: 44-55 - [c164]Spyros C. Kontogiannis, Paul G. Spirakis:
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. MFCS 2007: 596-608 - [c163]Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis:
Selfish Load Balancing Under Partial Knowledge. MFCS 2007: 609-620 - [c162]Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Game authority for robust andscalable distributed selfish-computer systems. PODC 2007: 356-357 - [c161]Spyros C. Kontogiannis, Paul G. Spirakis:
Probabilistic Techniques in Algorithmic Game Theory. SAGA 2007: 30-53 - [c160]Spyros C. Kontogiannis, Paul G. Spirakis:
On the Support Size of Stable Strategies in Random Games. SAGA 2007: 154-165 - [c159]Panagiota N. Panagopoulou, Paul G. Spirakis:
Full and Local Information in Distributed Decision Making. WAOA 2007: 156-169 - [c158]Haralampos Tsaknakis, Paul G. Spirakis:
An Optimization Approach for Approximate Nash Equilibria. WINE 2007: 42-56 - [c157]Dimitris Fotakis, Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games. WINE 2007: 179-190 - [c156]Ioannis Chatzigiannakis, Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis:
Agent-based Distributed Group Key Establishment in Wireless Sensor Networks. WOWMOM 2007: 1-6 - [r3]Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Selfish Routing in Networks. Handbook of Parallel Computing 2007 - [r2]Paul G. Spirakis, Sotiris E. Nikoletseas:
Randomized Approximation Techniques. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i11]Paul G. Spirakis, Haralampos Tsaknakis:
Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time.. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j67]Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis:
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. Ad Hoc Networks 4(5): 621-635 (2006) - [j66]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006) - [j65]Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis:
The infection time of graphs. Discret. Appl. Math. 154(18): 2577-2589 (2006) - [j64]James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer:
Eight Open Problems in Distributed Computing. Bull. EATCS 90: 109-126 (2006) - [j63]Pavlos S. Efraimidis, Paul G. Spirakis:
Weighted random sampling with a reservoir. Inf. Process. Lett. 97(5): 181-185 (2006) - [j62]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. J. Discrete Algorithms 4(3): 433-454 (2006) - [j61]Panagiota N. Panagopoulou, Paul G. Spirakis:
Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11 (2006) - [j60]Burkhard Monien, Guang Gao, Horst D. Simon, Paul G. Spirakis, Per Stenström:
Introduction. J. Parallel Distributed Comput. 66(5): 615-616 (2006) - [j59]Pavlos S. Efraimidis, Paul G. Spirakis:
Approximation schemes for scheduling and covering on unrelated machines. Theor. Comput. Sci. 359(1-3): 400-417 (2006) - [c155]Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou:
The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks. ALGOSENSORS 2006: 130-139 - [c154]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583 - [c153]Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis:
The Price of Defense and Fractional Matchings. ICDCN 2006: 115-126 - [c152]Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
The Power of the Defender. ICDCS Workshops 2006: 37 - [c151]Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
The Price of Defense. MFCS 2006: 717-728 - [c150]Marios Mavronicolas, Loizos Michael, Paul G. Spirakis:
Computing on a Partially Eponymous Ring. OPODIS 2006: 380-394 - [c149]Alexis C. Kaporis, Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. SPAA 2006: 19-28 - [c148]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The Survival of the Weakest in Networks. WAOA 2006: 316-329 - [c147]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006: 286-296 - [c146]Ioannis Chatzigiannakis, Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis:
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks. WCAN@ICALP 2006: 17-31 - [e10]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture Notes in Computer Science 4286, Springer 2006, ISBN 3-540-68138-8 [contents] - [i10]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j58]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
An Application of the Monotone Linearizability Lemma. Bull. EATCS 85: 70-80 (2005) - [j57]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Max-min Fair Flow Control Sensitive to Priorities. J. Interconnect. Networks 6(2): 85-114 (2005) - [j56]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks. Mob. Networks Appl. 10(1-2): 133-149 (2005) - [j55]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. 38(2): 229-248 (2005) - [j54]Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols. Theory Comput. Syst. 38(4): 425-460 (2005) - [j53]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34(5): 1216-1252 (2005) - [j52]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005) - [j51]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocoloring in planar graphs: Complexity and approximations. Theor. Comput. Sci. 340(3): 514-538 (2005) - [j50]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343(1-2): 133-157 (2005) - [j49]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005) - [j48]Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis:
The chromatic and clique numbers of random scaled sector graphs. Theor. Comput. Sci. 349(1): 40-51 (2005) - [c145]Spyros C. Kontogiannis, Paul G. Spirakis:
Evolutionary Games: An Algorithmic View. Self-star Properties in Complex Information Systems 2005: 97-111 - [c144]Charilaos Efthymiou, Paul G. Spirakis:
On the Existence of Hamiltonian Cycles in Random Intersection Graphs. ICALP 2005: 690-701 - [c143]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
Network Game with Attacker and Protector Entities. ISAAC 2005: 288-297 - [c142]Christoforos L. Raptopoulos, Paul G. Spirakis:
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. ISAAC 2005: 493-504 - [c141]Spyros C. Kontogiannis, Paul G. Spirakis:
Counting Stable Strategies in Random Evolutionary Games. ISAAC 2005: 839-848 - [c140]Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung:
"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience. ISC 2005: 44-58 - [c139]Spyros C. Kontogiannis, Paul G. Spirakis:
The Contribution of Game Theory to Complex Systems. Panhellenic Conference on Informatics 2005: 101-111 - [c138]Paul G. Spirakis:
Keynote Talk Summary: Algorithmic Aspects of Sensor Networks. WAC 2005: 277-277 - [c137]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175 - [c136]Alexis C. Kaporis, Lefteris M. Kirousis, Efpraxia I. Politopoulou, Paul G. Spirakis:
Experimental Results for Stackelberg Scheduling Strategies. WEA 2005: 77-88 - [c135]Panagiota N. Panagopoulou, Paul G. Spirakis:
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. WEA 2005: 203-215 - [c134]Maria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, Andreas Xeros:
Generating and Radiocoloring Families of Perfect Graphs. WEA 2005: 302-314 - [c133]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. WINE 2005: 210-224 - [c132]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Graph-Theoretic Network Security Game. WINE 2005: 969-978 - [c131]Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic Selfish Routing in Networks: A Survey. WINE 2005: 989-1002 - [e9]Viktor K. Prasanna, S. Sitharama Iyengar, Paul G. Spirakis, Matt Welsh:
Distributed Computing in Sensor Systems, First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 - July 1, 2005, Proceedings. Lecture Notes in Computer Science 3560, Springer 2005, ISBN 3-540-26422-1 [contents] - [e8]Phillip B. Gibbons, Paul G. Spirakis:
SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA. ACM 2005, ISBN 1-58113-986-1 [contents] - [r1]Sotiris E. Nikoletseas, Paul G. Spirakis:
Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments. Handbook of Algorithms for Wireless Networking and Mobile Computing 2005 - [i9]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. Algorithmic Aspects of Large and Complex Networks 2005 - [i8]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Algorithmic Aspects of Large and Complex Networks 2005 - [i7]Alexis C. Kaporis, Efpraxia I. Politopoulou, Paul G. Spirakis:
The Price of Optimum in Stackelberg Games. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j47]Sotiris E. Nikoletseas, Paul G. Spirakis:
The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing). Bull. EATCS 82: 126-169 (2004) - [j46]Konstantinos Antonis, John D. Garofalakis, Ioannis Mourtos, Paul G. Spirakis:
A hierarchical adaptive distributed algorithm for load balancing. J. Parallel Distributed Comput. 64(1): 151-162 (2004) - [c130]Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis of the Information Propagation Time Among Mobile Hosts. ADHOC-NOW 2004: 122-134 - [c129]Paul G. Spirakis:
Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk). ALGOSENSORS 2004: 3-8 - [c128]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. ESA 2004: 134-145 - [c127]Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung:
Electronic National Lotteries. Financial Cryptography 2004: 147-163 - [c126]Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks. Global Computing 2004: 127-145 - [c125]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Selfish Unsplittable Flows. ICALP 2004: 593-605 - [c124]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. ICALP 2004: 1029-1040 - [c123]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Performance and Stability Bounds for Dynamic Networks. ISPAN 2004: 239-246 - [c122]Tassos Dimitriou, Ioannis Krontiris, Fotios Nikakis, Paul G. Spirakis:
SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks. NETWORKING 2004: 1300-1305 - [c121]Tassos Dimitriou, Paul G. Spirakis:
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. WEA 2004: 199-212 - 2003
- [j45]Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis:
Competitive Video on Demand Schedulers for Popular Movies. Discret. Appl. Math. 129(1): 49-61 (2003) - [j44]Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. Int. J. Comput. Their Appl. 10(1): 51-66 (2003) - [j43]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distributed Comput. 63(1): 58-74 (2003) - [j42]Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis:
Attack Propagation in Networks. Theory Comput. Syst. 36(5): 553-574 (2003) - [j41]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003) - [j40]Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. Parallel Process. Lett. 13(4): 615-627 (2003) - [j39]Shay Kutten, Paul G. Spirakis:
Preface. Theor. Comput. Sci. 291(1): 1 (2003) - [j38]Hermann Jung, Maria J. Serna, Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theor. Comput. Sci. 292(3): 639-652 (2003) - [c120]Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols. CIAC 2003: 251-263 - [c119]Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. Euro-Par 2003: 1003-1016 - [c118]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. ICTCS 2003: 1-20 - [c117]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561 - [c116]Peter Triantafillou, Nikos Ntarmos, Sotiris E. Nikoletseas, Paul G. Spirakis:
NanoPeer Networks and P2P Worlds. Peer-to-Peer Computing 2003: 40-46 - [c115]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72 - [c114]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Instability of Networks with Quasi-Static Link Capacities. SIROCCO 2003: 179-194 - [c113]Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time. STACS 2003: 271-282 - [c112]Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis:
Algorithms and Experiments on Colouring Squares of Planar Graphs. WEA 2003: 15-32 - [i6]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
FIFO is Unstable at Arbitrarily Low Rates. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j37]Dimitris Fotakis, Paul G. Spirakis:
Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3): 396-422 (2002) - [j36]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Distributed Communication Algorithms. Bull. EATCS 78: 133-162 (2002) - [j35]Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis:
Competitive Call Control in Mobile Networks. Theory Comput. Syst. 35(6): 625-639 (2002) - [j34]Christos Bouras, Petros Lampsas, Paul G. Spirakis:
STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model. Multim. Tools Appl. 16(3): 251-276 (2002) - [j33]Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis:
On the robustness of interconnections in random graphs: a symbolic approach. Theor. Comput. Sci. 287(2): 515-534 (2002) - [c111]Friedhelm Meyer auf der Heide, Mohan Kumar, Sotiris E. Nikoletseas, Paul G. Spirakis:
Mobile Computing, Mobile Networks. Euro-Par 2002: 933-934 - [c110]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134 - [c109]Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. MFCS 2002: 81-92 - [c108]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Smart dust protocols for local detection and propagation. POMC 2002: 9-16 - [c107]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235 - [c106]Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. DISC 2002: 88-102 - [c105]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. WG 2002: 223-234 - 2001
- [j32]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. Comput. Artif. Intell. 20(2): 121-180 (2001) - [j31]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. Bull. EATCS 75: 152-181 (2001) - [c104]Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis:
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. HiPC 2001: 3-16 - [c103]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks. IPDPS 2001: 185 - [c102]Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis:
Stability Behavior of FIFO Protocol in the Adversarial Queuing Model. Panhellenic Conference on Informatics 2001: 464-479 - [c101]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
An efficient communication strategy for ad-hoc mobile networks. PODC 2001: 320-322 - [c100]Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol. SPAA 2001: 48-52 - [c99]Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis:
Attack propagation in networks. SPAA 2001: 67-76 - [c98]Marios Mavronicolas, Paul G. Spirakis:
The price of selfish routing. STOC 2001: 510-519 - [c97]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis:
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. WAE 2001: 159-171 - [c96]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
An Efficient Communication Strategy for Ad-hoc Mobile Networks. DISC 2001: 285-299 - [e7]Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen:
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Lecture Notes in Computer Science 2076, Springer 2001, ISBN 3-540-42287-0 [contents] - [e6]Jeffrey Scott Vitter, Paul G. Spirakis, Mihalis Yannakakis:
Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece. ACM 2001, ISBN 1-58113-349-9 [contents] - [i5]Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis:
The Range of Stability for Heterogeneous and FIFO Queueing Networks. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j30]Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung:
Connectivity Properties in Random Regular Graphs with Edge Faults. Int. J. Found. Comput. Sci. 11(2): 247-262 (2000) - [j29]Panagiota Fatourou, Paul G. Spirakis:
Efficient Scheduling of Strict Multithreaded Computations. Theory Comput. Syst. 33(3): 173-232 (2000) - [j28]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000) - [c95]Paul G. Spirakis, Christos D. Zaroliagis:
Distributed Algorithm Engineering. Experimental Algorithmics 2000: 197-228 - [c94]Pavlos S. Efraimidis, Paul G. Spirakis:
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note). Euro-Par 2000: 456-460 - [c93]Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient Communication Establishment in Adverse Communication Environments. ICALP Satellite Workshops 2000: 215-226 - [c92]Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Trade-Offs between Density and Robustness in Random Interconnection Graphs. IFIP TCS 2000: 152-168 - [c91]Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. MFCS 2000: 363-372 - [c90]Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. WAE 2000: 99-110 - [e5]Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis:
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000. Carleton Scientific 2000 [contents] - [i4]Pavlos S. Efraimidis, Paul G. Spirakis:
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines. Electron. Colloquium Comput. Complex. TR00 (2000) - [i3]Sotiris E. Nikoletseas, Paul G. Spirakis:
Efficient Communication Establishment in Extremely Unreliable Large Networks. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j27]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) - [j26]Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Optimal High-Performance Parallel Text Retrieval via Fat-Trees. Theory Comput. Syst. 32(6): 591-623 (1999) - [c89]Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. Euro-Par 1999: 482-486 - [c88]Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of No Communication. FCT 1999: 293-303 - [c87]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
Fundamental Distributed Protocols in Mobile Networks. PODC 1999: 274 - [c86]Marios Mavronicolas, Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of no Communication. PODC 1999: 279 - [c85]Dimitris Fotakis, Paul G. Spirakis:
Efficient Redundant Assignments under Fault-Tolerance Constraints. RANDOM-APPROX 1999: 156-167 - [c84]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
Fundamental Control Algorithms in Mobile Networks. SPAA 1999: 251-260 - [c83]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas:
Counting in Mobile Networks: Theory and Experimentation. WAE 1999: 95-109 - [c82]Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura:
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. WAE 1999: 124-138 - [c81]Panagiota Fatourou, Paul G. Spirakis:
A New Scheduling Algorithm for General Strict Multithreaded Computations. DISC 1999: 297-311 - 1998
- [j25]Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou:
An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers. Perform. Evaluation 34(3): 169-182 (1998) - [j24]Josep Díaz, Maria J. Serna, Paul G. Spirakis:
On the Random Generation and Counting of Matchings in Dense Graphs. Theor. Comput. Sci. 201(1-2): 281-290 (1998) - [c80]Konstantinos Antonis, John D. Garofalakis, Paul G. Spirakis:
A Competitive Symmetrical Transfer Policy for Load Sharing. Euro-Par 1998: 352-355 - [c79]Dimitris Fotakis, Paul G. Spirakis:
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. FSTTCS 1998: 18-29 - [c78]Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis:
MaxMin Fair Flow Control Sensitive to Priorities. OPODIS 1998: 45-60 - [c77]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. PODC 1998: 311 - [c76]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. SIROCCO 1998: 244-258 - [c75]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46 - [c74]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas:
Implementation and Testing Eavesdropper Protocols Using the DSP Tool. WAE 1998: 74-85 - [i2]Dimitris Fotakis, Paul G. Spirakis:
Graph Properties that Facilitate Travelling. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Dimitris Fotakis, Paul G. Spirakis:
Random Walks, Conditional Hitting Sets and Partial Derandomization. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j23]Paul G. Spirakis:
Editor's Foreword. Theory Comput. Syst. 30(1): 1 (1997) - [j22]Paul G. Spirakis, Vassilis Triantafillou:
Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations. Parallel Process. Lett. 7(3): 249-258 (1997) - [j21]Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. Theor. Comput. Sci. 181(2): 267-287 (1997) - [c73]Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis:
An Object-Oriented Data Model for the Intelligent Support of Three-Dimensional Objects. DEXA Workshop 1997: 358-363 - [c72]Josep Díaz, Maria J. Serna, Paul G. Spirakis:
Linear and nonlinear systems: A survey. Contemporary Trends in Discrete Mathematics 1997: 29-47 - [c71]Dimitris Fotakis, Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis:
Frequency assignment in mobile and radio networks. Networks in Distributed Computing 1997: 73-90 - [c70]Sotiris E. Nikoletseas, Grammati E. Pantziou, Panagiotis Psycharis, Paul G. Spirakis:
On the Fault Tolerance of Fat-Trees. Euro-Par 1997: 208-217 - [c69]Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou:
A General Performance Model for Multistage Interconnection Networks. Euro-Par 1997: 993-1000 - [c68]Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis:
Competitive Call Control in Mobile Networks. ISAAC 1997: 404-413 - [c67]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). PODC 1997: 139-148 - [c66]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Advances in Rate-Based Flow Control. SIROCCO 1997: 266-281 - [c65]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis:
Efficient Computations on Fault-Prone BSP Machines. SPAA 1997: 84-93 - [c64]I. Antoniou, Christos Bouras, Petros Lampsas, Paul G. Spirakis:
Enabling Distance Education over the World Wide Web. WebNet 1997 - 1996
- [j20]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. Inf. Process. Lett. 58(1): 47-53 (1996) - [j19]Christos Bouras, Paul G. Spirakis:
Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks. Perform. Evaluation 25(2): 105-130 (1996) - [j18]Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. Theor. Comput. Sci. 168(1): 121-154 (1996) - [c63]Sokratis K. Katsikas, Dimitris Gritzalis, Paul G. Spirakis:
Attack Modelling in Open Network Environments. Communications and Multimedia Security 1996: 268-277 - [c62]Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou:
Wormhole Versus Deflection Routing: A Case Study on the Mesh. COCOON 1996: 31-40 - [c61]Christos Bouras, Vaggelis Kapoulas, Dimitris Miras, Vaggelis Ouzounis, Paul G. Spirakis, Antonis Tatakis:
On-Demand Hypermedia/Multimedia Service over Broadband Networks. HPDC 1996: 224-231 - [c60]Panagiota Fatourou, Paul G. Spirakis:
Scheduling Algorithms for Strict Multithreaded Computations. ISAAC 1996: 407-416 - [c59]Dimitris Fotakis, Paul G. Spirakis:
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. MFCS 1996: 360-371 - [c58]Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis:
Randomized Adaptive Video on Demand (Abstract). PODC 1996: 179 - [c57]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
BSP vs LogP. SPAA 1996: 25-32 - [c56]Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Parallel Techniques For Efficient Searching Over Very Large Text Collections. TREC 1996 - [e4]Nicola Santoro, Paul G. Spirakis:
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996. Carleton Scientific 1996 [contents] - 1995
- [j17]Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Random Struct. Algorithms 7(1): 59-80 (1995) - [j16]Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
The Fourth Moment in Luby's Distribution. Theor. Comput. Sci. 148(1): 133-140 (1995) - [c55]Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
Efficient Parallel Algorithms for some Tree Layout Problems. COCOON 1995: 313-323 - [c54]Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170 - [c53]Vaggelis Kapoulas, Paul G. Spirakis:
Randomized Competitive Algorithms for Admission Control in General Networks (Abstract). PODC 1995: 253 - [c52]Pavlos S. Efraimidis, Christos Glymidakis, Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model. SIGIR 1995: 58-66 - [c51]Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou:
Wormhole Routing Simulation on a Mesh. SIROCCO 1995: 147-158 - [c50]Sotiris E. Nikoletseas, Paul G. Spirakis:
Expander Properties in Random Regular Graphs with Edge Faults. STACS 1995: 421-432 - [c49]Paul G. Spirakis, Basil Tampakas, Hera Antonopoulou:
Distributed Protocols Against Mobile Eavesdroppers. WDAG 1995: 160-167 - [e3]Paul G. Spirakis:
Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings. Lecture Notes in Computer Science 979, Springer 1995, ISBN 3-540-60313-1 [contents] - 1994
- [j15]Michel Denault, Dimitris Karagiannis, Dimitris Gritzalis, Paul G. Spirakis:
Intrusion detection: Approach and performance issues of the SECURENET system. Comput. Secur. 13(6): 495-508 (1994) - [j14]John D. Garofalakis, Paul G. Spirakis, Basil Tampakas, Sergio Rajsbaum:
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. Theor. Comput. Sci. 128(1&2): 63-74 (1994) - [j13]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. IEEE Trans. Parallel Distributed Syst. 5(7): 688-696 (1994) - [c48]Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis:
A Conceptual DataBase Approach for Modelling 3D Objects of Irregular Geometry. DEXA 1994: 290-299 - [c47]Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. FOCS 1994: 592-603 - [c46]Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung:
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. ICALP 1994: 508-519 - [c45]Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. ISAAC 1994: 270-278 - [c44]Dimitris Androutsopoulos, Per Kaijser, Sokratis K. Katsikas, Kåre Presttun, Don Salmon, Paul G. Spirakis:
Surveillance and Protection in IBC Management: The Applicability of Two RACE Security Projects - SecureNet II and SESAME. IS&N 1994: 61-72 - [c43]Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. MFCS 1994: 462-472 - [c42]Paul G. Spirakis, Basil Tampakas:
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing. PODC 1994: 403 - 1993
- [j12]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. Inf. Comput. 105(1): 94-104 (1993) - [j11]Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis:
Parallel Complexity of the Connected Subgraph Problem. SIAM J. Comput. 22(3): 573-586 (1993) - [c41]George Anogianakis, Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis:
Brain Data Base (BDB). DEXA 1993: 361-364 - [c40]Christos Bouras, Paul G. Spirakis:
The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases. ICCI 1993: 403-407 - [c39]Christos Bouras, Paul G. Spirakis:
Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases. MASCOTS 1993: 243-246 - [c38]Sotiris E. Nikoletseas, Paul G. Spirakis:
Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. WG 1993: 1-10 - 1992
- [j10]John H. Reif, Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. Algorithmica 7(5&6): 597-630 (1992) - [j9]Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. BIT 32(2): 215-236 (1992) - [c37]Paul G. Spirakis, Basil Tampakas, Marina Papatriantafilou, K. Konstantoulis, K. Vlaxodimitropoulos, V. Antonopoulos, P. Kazazis, T. Metallidou, D. Spartiotis:
Distributed System Simulator (DSS). STACS 1992: 615-616 - [c36]John D. Garofalakis, Sergio Rajsbaum, Paul G. Spirakis, Basil Tampakas:
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. WDAG 1992: 110-119 - [e2]Sam Toueg, Paul G. Spirakis, Lefteris M. Kirousis:
Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings. Lecture Notes in Computer Science 579, Springer 1992, ISBN 3-540-55236-7 [contents] - 1991
- [j8]Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
The Complexity of the Reliable Connectivity Problem. Inf. Process. Lett. 39(5): 245-252 (1991) - [c35]Hermann Jung, Maria J. Serna, Paul G. Spirakis:
A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. ICALP 1991: 417-428 - [c34]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. ICCI 1991: 582-587 - [c33]Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
The Complexity of The Reliable Connectivity Problem. MFCS 1991: 259-266 - [c32]Maria J. Serna, Paul G. Spirakis:
Tight RNC Approximations to Max Flow. STACS 1991: 118-126 - [c31]Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis:
Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract). STOC 1991: 381-390 - [c30]Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. WDAG 1991: 229-241 - [c29]Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Fast Parallel Algorithms for Coloring Random Graphs. WG 1991: 135-147 - 1990
- [c28]John D. Garofalakis, Paul G. Spirakis:
The Performance of Multistage Interconnection Networks with Finite Buffers. SIGMETRICS 1990: 263-264 - [c27]Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis:
Efficient Robust Parallel Computations (Extended Abstract). STOC 1990: 138-148 - [c26]Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. SWAT 1990: 288-300 - [c25]Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Optimal Parallel Algorithms for Sparse Graphs. WG 1990: 1-17
1980 – 1989
- 1989
- [j7]Paul G. Spirakis, Basil Tampakas:
Efficient Distributed Algorithms by Using The Archimedean Time Assumption. RAIRO Theor. Informatics Appl. 23(1): 113-128 (1989) - [c24]Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis:
The Parallel Complexity of the Subgraph Connectivity Problem. FOCS 1989: 294-299 - [c23]Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization. FSTTCS 1989: 20-29 - [c22]Maria J. Serna, Paul G. Spirakis:
The Approximability of Problems Complete for P. Optimal Algorithms 1989: 193-204 - [c21]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. SPAA 1989: 254-264 - [c20]Paul G. Spirakis, Basil Tampakas, Athanasios Tsiolis:
Symmetry Breaking in Asynchronous Rings with O(n) Messages. WDAG 1989: 233-241 - 1988
- [j6]Paul G. Spirakis:
Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification. Inf. Comput. 76(1): 1-12 (1988) - [c19]Paul G. Spirakis:
Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). Parcella 1988: 177-189 - [c18]John D. Garofalakis, Paul G. Spirakis:
Approximate Queueing Models for the Load Balancing Problem. SIGMETRICS 1988: 277 - [c17]Paul G. Spirakis, Basil Tampakas:
Efficient Distributed Algorithms by Using the Archemedean Time Assumption. STACS 1988: 248-263 - [c16]Lefteris M. Kirousis, Paul G. Spirakis:
Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. SWAT 1988: 163-175 - 1987
- [j5]Paul G. Spirakis:
The Parallel Complexity of Deadlock Detection. Theor. Comput. Sci. 52: 155-163 (1987) - [c15]Dennis E. Shasha, Paul G. Spirakis:
Fast Parallel Algorithms for Processing of Joins. ICS 1987: 939-953 - [c14]Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou:
Queueing Delays in Buffered Multistage Interconnection Networks. SIGMETRICS 1987: 111-121 - 1986
- [c13]Paul G. Spirakis, Athanasios K. Tsakalidis:
A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. ICALP 1986: 397-406 - [c12]Paul G. Spirakis:
The Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only). ICC 1986: 1763 - [c11]Paul G. Spirakis:
The Parallel Complexity of Deadlock Detection. MFCS 1986: 582-593 - [c10]Paul G. Spirakis:
Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. STACS 1986: 73-86 - [c9]Paul G. Spirakis:
The Diameter of Connected Components of Random Graphs. WG 1986: 264-276 - [e1]Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis:
VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings. Lecture Notes in Computer Science 227, Springer 1986, ISBN 3-540-16766-8 [contents] - 1985
- [j4]John H. Reif, Paul G. Spirakis:
k-connectivity in random undirected graphs. Discret. Math. 54(2): 181-191 (1985) - [j3]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communications Systems. SIAM J. Comput. 14(1): 75-92 (1985) - [c8]Alexander Tuzhilin, Paul G. Spirakis:
A Semantic Approach to Correctness of Concurrent Transaction Executions. PODS 1985: 85-95 - [c7]Paul G. Spirakis:
The Volume of the Union of Many Sheres and Point Inclusion Problems. STACS 1985: 328-338 - 1984
- [j2]Paul G. Spirakis, Chee-Keng Yap:
Strong NP-Hardness of Moving Many Discs. Inf. Process. Lett. 19(1): 55-59 (1984) - [j1]John H. Reif, Paul G. Spirakis:
Real-Time Synchronization of Interprocess Communications. ACM Trans. Program. Lang. Syst. 6(2): 215-238 (1984) - [c6]Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis:
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications. FOCS 1984: 241-250 - [c5]John H. Reif, Paul G. Spirakis:
Probabilistic Bidding Gives Optimal Distributed Resource Allocation. ICALP 1984: 391-402 - 1982
- [c4]John H. Reif, Paul G. Spirakis:
Real Time Resource Allocation in Distributed Systems. PODC 1982: 84-94 - [c3]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communication Systems. POPL 1982: 46-56 - 1981
- [c2]John H. Reif, Paul G. Spirakis:
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time. STOC 1981: 133-145 - 1980
- [c1]John H. Reif, Paul G. Spirakis:
Random Matroids. STOC 1980: 385-397
Coauthor Index
Eleni C. Akrida
aka: Eleni Ch. Akrida
aka: Eleni Ch. Akrida
[c277] [c270] [c252] [j119] [j113] [c231] [c227] [c223] [c220] [c219] [i30] [i28] [b2] [j107] [j106] [j101] [j100] [c218] [c216] [c214] [c211] [i24] [c204] [c203] [c202] [c200] [c199] [c198] [i22] [i21] [i20] [c196] [c195] [c191] [c188] [c186] [c185] [i19] [c182] [c179] [c176] [c174] [i14] [i12] [c156] [j67] [c146] [j56] [j43] [j40] [c119] [j36] [c108] [c103] [c101] [c97] [c96] [c90]
[j182] [c303] [i88] [j171] [j90] [j87] [j84] [j82] [j80] [j79] [j78] [j70] [j69] [j68] [j66] [c153] [c152] [c151] [c150] [e10] [j58] [j57] [j54] [j53] [j52] [j50] [c143] [c133] [c132] [i9] [i8] [c128] [c123] [j41] [j40] [c120] [c119] [c118] [c117] [c115] [c114] [i6] [c110] [c107] [c106] [c98] [c88] [c86] [c78] [c77] [c76] [c67] [c66]
[j186] [j185] [i96] [j184] [j183] [c319] [c314] [c312] [i94] [i93] [c304] [i89] [c299] [c298] [c293] [i84] [i83] [j164] [c285] [i80] [i77] [j159] [j158] [c280] [i73] [i72] [j156] [j155] [c276] [c274] [i66] [j140] [c268] [i63] [i61] [j137] [j131] [c259] [c255] [i54] [j129] [j125] [c249] [i49] [c240] [i45] [i44] [j120] [c239] [c236] [i39] [j114] [c231] [c230] [c228] [c221] [i33] [i32] [i27] [c209] [i26] [i23]
[j186] [j180] [j176] [j175] [c298] [j166] [j163] [i77] [c279] [i75] [i70] [i69] [j156] [j151] [c271] [i65] [j145] [j144] [c264] [c263] [c261] [i60] [i59] [j130] [c256] [c253] [i53] [j128] [j124] [c246] [i48] [j123] [i45] [i42] [i40] [j119] [c238] [c237] [j113] [c231] [c227] [i35] [c223] [c220] [c219] [i30] [i28] [b2] [j106] [j101] [j100] [c216] [c211] [c203] [c199] [c198] [i21] [i20] [c191] [c188] [c186] [c185] [i19]
Panayotis E. Nastou
aka: Panagiotis E. Nastou
aka: Panagiotis E. Nastou
[c319] [c312] [i93] [j181] [c310] [c308] [c307] [c301] [j174] [c296] [i81] [j167] [c288] [c287] [c286] [c284] [j158] [c282] [c281] [i68] [c274] [i66] [c266] [p4] [p3] [j137] [j132] [c254] [i52] [i50] [c250] [c249] [r18] [i46] [j122] [c243] [c239] [i39] [j114] [c233] [c232] [i37] [c224] [i31] [j99] [c217] [c209] [c208] [p1] [i26] [j94] [j92] [j81] [c189] [c187] [j73] [j72] [r7] [c169] [c168] [c165] [r2] [j67] [j65] [j62] [c148] [j56] [j54] [j51] [r1] [j47] [c130] [c126] [c124] [j43] [j42] [j40] [c120] [c119] [c116] [c112] [j36] [j33] [c111] [c109] [c108] [c106] [c105] [j32] [j31] [c104] [c103] [c102] [c101] [c100] [c99] [c97] [c96] [i5] [j30] [c93] [c92] [c91] [c90] [i3] [c70] [c54] [c50] [c46] [c38]
[c319] [c312] [i93] [j181] [c310] [c301] [j174] [i81] [j167] [j164] [c286] [j158] [i68] [c274] [i66] [c266] [p4] [j137] [j132] [c254] [i52] [i50] [c250] [c249] [r18] [i46] [j122] [c239] [i39] [j114] [c233] [c232] [i37] [c225] [c224] [i31] [j99] [c217] [c209] [c208] [i26] [j92] [j81] [c189] [c187] [j72] [r7] [c168] [c165] [c148] [c142] [c124]
Victor Zamaraev
aka: Viktor Zamaraev
aka: Viktor Zamaraev
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-23 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
