Random Matroids - John H. Reif; Paul G. Spirakis (STOC, 1980)

Distributed Algorithms for Synchronizing Interprocess Communication within Real Time - John H. Reif; Paul G. Spirakis (STOC, 1981)

Real Time Resource Allocation in Distributed Systems. - John H. Reif; Paul G. Spirakis (PODC, 1982)

Unbounded Speed Variability in Distributed Communication Systems. - John H. Reif; Paul G. Spirakis (POPL, 1982)

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications - Daniel Kornhauser; Gary L. Miller; Paul G. Spirakis (FOCS, 1984)

Probabilistic Bidding Gives Optimal Distributed Resource Allocation. - John H. Reif; Paul G. Spirakis (ICALP, 1984)

Strong NP-Hardness of Moving Many Discs. - Paul G. Spirakis; Chee-Keng Yap (Inf. Process. Lett., 1984)

Real-Time Synchronization of Interprocess Communications. - John H. Reif; Paul G. Spirakis (ACM Trans. Program. Lang. Syst., 1984)

A Semantic Approach to Correctness of Concurrent Transaction Executions. - Alexander Tuzhilin; Paul G. Spirakis (PODS, 1985)

The Volume of the Union of Many Sheres and Point Inclusion Problems. - Paul G. Spirakis (STACS, 1985)

k-connectivity in random undirected graphs. - John H. Reif; Paul G. Spirakis (Discret. Math., 1985)

Unbounded Speed Variability in Distributed Communications Systems. - John H. Reif; Paul G. Spirakis (SIAM J. Comput., 1985)

A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. - Paul G. Spirakis; Athanasios K. Tsakalidis (ICALP, 1986)

The Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only). - Paul G. Spirakis (ICC, 1986)

Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. - Paul G. Spirakis (STACS, 1986)

The Diameter of Connected Components of Random Graphs. - Paul G. Spirakis (WG, 1986)

Fast Parallel Algorithms for Processing of Joins. - Dennis E. Shasha; Paul G. Spirakis (ICS, 1987)

Queueing Delays in Buffered Multistage Interconnection Networks. - Christos Bouras; John D. Garofalakis; Paul G. Spirakis; Vassilis Triantafillou (SIGMETRICS, 1987)

The Parallel Complexity of Deadlock Detection. - Paul G. Spirakis (Theor. Comput. Sci., 1987)

Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). - Paul G. Spirakis (Parcella, 1988)

Approximate Queueing Models for the Load Balancing Problem. - John D. Garofalakis; Paul G. Spirakis (SIGMETRICS, 1988)

Efficient Distributed Algorithms by Using the Archemedean Time Assumption. - Paul G. Spirakis; Basil Tampakas (STACS, 1988)

Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. - Lefteris M. Kirousis; Paul G. Spirakis (SWAT, 1988)

Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification - Paul G. Spirakis (Inf. Comput., 1988)

The Parallel Complexity of the Subgraph Connectivity Problem - Lefteris M. Kirousis; Maria J. Serna; Paul G. Spirakis (FOCS, 1989)

Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization. - Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (FSTTCS, 1989)

The Approximability of Problems Complete for P. - Maria J. Serna; Paul G. Spirakis (Optimal Algorithms, 1989)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (SPAA, 1989)

Symmetry Breaking in Asynchronous Rings with O(n) Messages. - Paul G. Spirakis; Basil Tampakas; Athanasios Tsiolis (WDAG, 1989)

Efficient Distributed Algorithms by Using The Archimedean Time Assumption. - Paul G. Spirakis; Basil Tampakas (RAIRO Theor. Informatics Appl., 1989)

The Performance of Multistage Interconnection Networks with Finite Buffers. - John D. Garofalakis; Paul G. Spirakis (SIGMETRICS, 1990)

Efficient Robust Parallel Computations (Extended Abstract) - Zvi M. Kedem; Krishna V. Palem; Paul G. Spirakis (STOC, 1990)

Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. - Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (SWAT, 1990)

Optimal Parallel Algorithms for Sparse Graphs. - Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (WG, 1990)

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. - Hermann Jung 001; Maria J. Serna; Paul G. Spirakis (ICALP, 1991)

Tight RNC Approximations to Max Flow. - Maria J. Serna; Paul G. Spirakis (STACS, 1991)

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract) - Zvi M. Kedem; Krishna V. Palem; A. Raghunathan; Paul G. Spirakis (STOC, 1991)

Fast Parallel Algorithms for Coloring Random Graphs. - Zvi M. Kedem; Krishna V. Palem; Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (WG, 1991)

The Complexity of the Reliable Connectivity Problem. - Dimitris Kavadias; Lefteris M. Kirousis; Paul G. Spirakis (Inf. Process. Lett., 1991)

Distributed System Simulator (DSS). - Paul G. Spirakis; Basil Tampakas; Marina Papatriantafilou; K. Konstantoulis; K. Vlaxodimitropoulos; V. Antonopoulos; P. Kazazis; T. Metallidou; D. Spartiotis (STACS, 1992)

Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. - John H. Reif; Paul G. Spirakis (Algorithmica, 1992)

Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. - Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (BIT, 1992)

Brain Data Base (BDB). - George Anogianakis; Aikaterini Krotopoulou; Paul G. Spirakis; Dimitra Terpou; Athanasios K. Tsakalidis (DEXA, 1993)

The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases. - Christos Bouras; Paul G. Spirakis (ICCI, 1993)

Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases. - Christos Bouras; Paul G. Spirakis (MASCOTS, 1993)

Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. - Sotiris E. Nikoletseas; Paul G. Spirakis (WG, 1993)

Parallel Complexity of the Connected Subgraph Problem. - Lefteris M. Kirousis; Maria J. Serna; Paul G. Spirakis (SIAM J. Comput., 1993)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (Inf. Comput., 1993)

A Conceptual DataBase Approach for Modelling 3D Objects of Irregular Geometry. - Aikaterini Krotopoulou; Paul G. Spirakis; Dimitra Terpou; Athanasios K. Tsakalidis (DEXA, 1994)

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. - Sotiris E. Nikoletseas; Krishna V. Palem; Paul G. Spirakis; Moti Yung (ICALP, 1994)

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. - Dimitris J. Kavvadias; Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (ISAAC, 1994)

Surveillance and Protection in IBC Management: The Applicability of Two RACE Security Projects - SecureNet II and SESAME. - Dimitris Androutsopoulos; Per Kaijser; Sokratis K. Katsikas; Kåre Presttun; Don Salmon; Paul G. Spirakis (IS&N, 1994)

Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing. - Paul G. Spirakis; Basil Tampakas (PODC, 1994)

Intrusion detection: Approach and performance issues of the SECURENET system. - Michel Denault; Dimitris Karagiannis; Dimitris Gritzalis; Paul G. Spirakis (Comput. Secur., 1994)

Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. - John D. Garofalakis; Paul G. Spirakis; Basil Tampakas; Sergio Rajsbaum (Theor. Comput. Sci., 1994)

Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. - Lefteris M. Kirousis; Paul G. Spirakis; Philippas Tsigas (IEEE Trans. Parallel Distributed Syst., 1994)

Efficient Parallel Algorithms for some Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (COCOON, 1995)

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. - Sotiris E. Nikoletseas; John H. Reif; Paul G. Spirakis; Moti Yung (ICALP, 1995)

Randomized Competitive Algorithms for Admission Control in General Networks (Abstract). - Vaggelis Kapoulas; Paul G. Spirakis (PODC, 1995)

Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model. - Pavlos S. Efraimidis; Christos Glymidakis; Basilis Mamalis; Paul G. Spirakis; Basil Tampakas (SIGIR, 1995)

Wormhole Routing Simulation on a Mesh. - Efstratios Karaivazoglou; Paul G. Spirakis; Vasilis Triantafilou (SIROCCO, 1995)

Expander Properties in Random Regular Graphs with Edge Faults. - Sotiris E. Nikoletseas; Paul G. Spirakis (STACS, 1995)

Distributed Protocols Against Mobile Eavesdroppers. - Paul G. Spirakis; Basil Tampakas; Hera Antonopoulou (WDAG, 1995)

Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. - Anil Kamath; Rajeev Motwani 001; Krishna V. Palem; Paul G. Spirakis (Random Struct. Algorithms, 1995)

The Fourth Moment in Luby's Distribution. - Devdatt P. Dubhashi; Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (Theor. Comput. Sci., 1995)

Attack Modelling in Open Network Environments. - Sokratis K. Katsikas; Dimitris Gritzalis; Paul G. Spirakis (Communications and Multimedia Security, 1996)

Wormhole Versus Deflection Routing: A Case Study on the Mesh. - Efstratios Karaivazoglou; Paul G. Spirakis; Vasilis Triantafilou (COCOON, 1996)

On-Demand Hypermedia/Multimedia Service over Broadband Networks. - Christos Bouras; Vaggelis Kapoulas; Dimitris Miras; Vaggelis Ouzounis; Paul G. Spirakis; Antonis Tatakis (HPDC, 1996)

Scheduling Algorithms for Strict Multithreaded Computations. - Panagiota Fatourou; Paul G. Spirakis (ISAAC, 1996)

(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. - Dimitris Fotakis 001; Paul G. Spirakis (MFCS, 1996)

Randomized Adaptive Video on Demand (Abstract). - Christos Bouras; Vaggelis Kapoulas; Grammati E. Pantziou; Paul G. Spirakis (PODC, 1996)

BSP vs LogP. - Gianfranco Bilardi; Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci; Paul G. Spirakis (SPAA, 1996)

Parallel Techniques For Efficient Searching Over Very Large Text Collections. - Basilis Mamalis; Paul G. Spirakis; Basil Tampakas (TREC, 1996)

Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. - Lefteris M. Kirousis; Paul G. Spirakis; Philippas Tsigas (Inf. Process. Lett., 1996)

Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks. - Christos Bouras; Paul G. Spirakis (Perform. Evaluation, 1996)

Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. - Dimitris J. Kavvadias; Grammati E. Pantziou; Paul G. Spirakis; Christos D. Zaroliagis (Theor. Comput. Sci., 1996)

An Object-Oriented Data Model for the Intelligent Support of Three-Dimensional Objects. - Aikaterini Krotopoulou; Paul G. Spirakis; Dimitra Terpou; Athanasios K. Tsakalidis (DEXA Workshop, 1997)

Linear and nonlinear systems: A survey. - Josep Díaz; Maria J. Serna; Paul G. Spirakis (Contemporary Trends in Discrete Mathematics, 1997)

Frequency assignment in mobile and radio networks. - Dimitris Fotakis 001; Grammati E. Pantziou; George P. Pentaris; Paul G. Spirakis (Networks in Distributed Computing, 1997)

A General Performance Model for Multistage Interconnection Networks. - Christos Bouras; John D. Garofalakis; Paul G. Spirakis; Vassilis Triantafillou (Euro-Par, 1997)

On the Fault Tolerance of Fat-Trees. - Sotiris E. Nikoletseas; Grammati E. Pantziou; Panagiotis Psycharis; Paul G. Spirakis (Euro-Par, 1997)

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (PODC, 1997)

Advances in Rate-Based Flow Control. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 1997)

Efficient Computations on Fault-Prone BSP Machines. - Spyros C. Kontogiannis; Grammati E. Pantziou; Paul G. Spirakis (SPAA, 1997)

Enabling Distance Education over the World Wide Web. - I. Antoniou; Christos Bouras; Petros Lampsas; Paul G. Spirakis (WebNet, 1997)

Editor's Foreword. - Paul G. Spirakis (Theory Comput. Syst., 1997)

Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations. - Paul G. Spirakis; Vassilis Triantafillou (Parallel Process. Lett., 1997)

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Theor. Comput. Sci., 1997)

A Competitive Symmetrical Transfer Policy for Load Sharing. - Konstantinos Antonis; John D. Garofalakis; Paul G. Spirakis (Euro-Par, 1998)

A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. - Dimitris Fotakis 001; Paul G. Spirakis (FSTTCS, 1998)

MaxMin Fair Flow Control Sensitive to Priorities. - Pimitris Fatourou; Marios Mavronicolas; Paul G. Spirakis (OPODIS, 1998)

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 1998)

"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments. - Spyros C. Kontogiannis; Grammati E. Pantziou; Paul G. Spirakis; Moti Yung (SPAA, 1998)

Implementation and Testing Eavesdropper Protocols Using the DSP Tool. - Kostas P. Hatzis; George P. Pentaris; Paul G. Spirakis; Vasilis T. Tampakas (WAE, 1998)

Graph Properties that Facilitate Travelling - Dimitris Fotakis 001; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 1998)

Random Walks, Conditional Hitting Sets and Partial Derandomization - Dimitris Fotakis 001; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 1998)

An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers. - Christos Bouras; John D. Garofalakis; Paul G. Spirakis; Vassilis Triantafillou (Perform. Evaluation, 1998)

On the Random Generation and Counting of Matchings in Dense Graphs. - Josep Díaz; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 1998)

Optimal, Distributed Decision-Making: The Case of No Communication. - Stavros Georgiades; Marios Mavronicolas; Paul G. Spirakis (FCT, 1999)

Fundamental Distributed Protocols in Mobile Networks. - Kostas P. Hatzis; George P. Pentaris; Paul G. Spirakis; Vasilis T. Tampakas; Richard B. Tan (PODC, 1999)

Optimal, Distributed Decision-Making: The Case of no Communication. - Marios Mavronicolas; Paul G. Spirakis (PODC, 1999)

Efficient Redundant Assignments under Fault-Tolerance Constraints. - Dimitris Fotakis 001; Paul G. Spirakis (RANDOM-APPROX, 1999)

Fundamental Control Algorithms in Mobile Networks. - Kostas P. Hatzis; George P. Pentaris; Paul G. Spirakis; Vasilis T. Tampakas; Richard B. Tan (SPAA, 1999)

Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. - Panagiota Fatourou; Paul G. Spirakis; Panagiotis Zarafidis; Anna Zoura (WAE, 1999)

Counting in Mobile Networks: Theory and Experimentation. - Kostas P. Hatzis; George P. Pentaris; Paul G. Spirakis; Basil Tampakas (WAE, 1999)

A New Scheduling Algorithm for General Strict Multithreaded Computations. - Panagiota Fatourou; Paul G. Spirakis (DISC, 1999)

BSP versus LogP. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Kieran T. Herley; Paul G. Spirakis (Algorithmica, 1999)

Optimal High-Performance Parallel Text Retrieval via Fat-Trees. - Basilis Mamalis; Paul G. Spirakis; Basil Tampakas (Theory Comput. Syst., 1999)

Distributed Algorithm Engineering. - Paul G. Spirakis; Christos D. Zaroliagis (Experimental Algorithmics, 2000)

Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note). - Pavlos S. Efraimidis; Paul G. Spirakis (Euro-Par, 2000)

Efficient Communication Establishment in Adverse Communication Environments. - Sotiris E. Nikoletseas; Paul G. Spirakis (ICALP Satellite Workshops, 2000)

Trade-Offs between Density and Robustness in Random Interconnection Graphs. - Philippe Flajolet; Kostas P. Hatzis; Sotiris E. Nikoletseas; Paul G. Spirakis (IFIP TCS, 2000)

NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. - Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (MFCS, 2000)

Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (WAE, 2000)

Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines - Pavlos S. Efraimidis; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2000)

Efficient Communication Establishment in Extremely Unreliable Large Networks - Sotiris E. Nikoletseas; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2000)

Connectivity Properties in Random Regular Graphs with Edge Faults. - Sotiris E. Nikoletseas; Krishna V. Palem; Paul G. Spirakis; Moti Yung (Int. J. Found. Comput. Sci., 2000)

Efficient Scheduling of Strict Multithreaded Computations. - Panagiota Fatourou; Paul G. Spirakis (Theory Comput. Syst., 2000)

Robust Parallel Computations through Randomization. - Spyros C. Kontogiannis; Grammati E. Pantziou; Paul G. Spirakis; Moti Yung (Theory Comput. Syst., 2000)

Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. - Dimitrios Koukopoulos; Sotiris E. Nikoletseas; Paul G. Spirakis (HiPC, 2001)

An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (IPDPS, 2001)

Stability Behavior of FIFO Protocol in the Adversarial Queuing Model. - Dimitrios Koukopoulos; Sotiris E. Nikoletseas; Paul G. Spirakis (Panhellenic Conference on Informatics, 2001)

An efficient communication strategy for ad-hoc mobile networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (PODC, 2001)

Stability and non-stability of the FIFO protocol. - Josep Díaz; Dimitrios Koukopoulos; Sotiris E. Nikoletseas; Maria J. Serna; Paul G. Spirakis; Dimitrios M. Thilikos (SPAA, 2001)

An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Nearchos Paspallis; Paul G. Spirakis; Christos D. Zaroliagis (WAE, 2001)

Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. - Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (Comput. Artif. Intell., 2001)

Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. - Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (Bull. EATCS, 2001)

The Range of Stability for Heterogeneous and FIFO Queueing Networks. - Dimitrios Koukopoulos; Sotiris E. Nikoletseas; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2001)

Mobile Computing, Mobile Networks. - Friedhelm Meyer auf der Heide; Mohan Kumar; Sotiris E. Nikoletseas; Paul G. Spirakis (Euro-Par, 2002)

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. - Maria I. Andreou; Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (MFCS, 2002)

Smart dust protocols for local detection and propagation. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (POMC, 2002)

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. - Dimitrios Koukopoulos; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (DISC, 2002)

Minimum Congestion Redundant Assignments to Tolerate Random Faults. - Dimitris Fotakis 001; Paul G. Spirakis (Algorithmica, 2002)

Distributed Communication Algorithms. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (Bull. EATCS, 2002)

Competitive Call Control in Mobile Networks. - Grammati E. Pantziou; George P. Pentaris; Paul G. Spirakis (Theory Comput. Syst., 2002)

STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model. - Christos Bouras; Petros Lampsas; Paul G. Spirakis (Multim. Tools Appl., 2002)

On the robustness of interconnections in random graphs: a symbolic approach. - Philippe Flajolet; Kostas P. Hatzis; Sotiris E. Nikoletseas; Paul G. Spirakis (Theor. Comput. Sci., 2002)

Extreme Nash Equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (ICTCS, 2003)

Which Is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode; Paul G. Spirakis; Imrich Vrto (MFCS, 2003)

NanoPeer Networks and P2P Worlds. - Peter Triantafillou; Nikos Ntarmos; Sotiris E. Nikoletseas; Paul G. Spirakis (Peer-to-Peer Computing, 2003)

Instability of Networks with Quasi-Static Link Capacities. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 2003)

Algorithms and Experiments on Colouring Squares of Planar Graphs. - Maria I. Andreou; Sotiris E. Nikoletseas; Paul G. Spirakis (WEA, 2003)

Competitive Video on Demand Schedulers for Popular Movies. - Christos Bouras; Vaggelis Kapoulas; Grammati E. Pantziou; Paul G. Spirakis (Discret. Appl. Math., 2003)

FIFO is Unstable at Arbitrarily Low Rates - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2003)

Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. - Basilis Mamalis; Paul G. Spirakis; Basil Tampakas (Int. J. Comput. Their Appl., 2003)

Distributed communication algorithms for ad hoc mobile networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (J. Parallel Distributed Comput., 2003)

Approximate Equilibria and Ball Fusion. - Elias Koutsoupias; Marios Mavronicolas; Paul G. Spirakis (Theory Comput. Syst., 2003)

Attack Propagation in Networks. - Sotiris E. Nikoletseas; Grigorios Prasinos; Paul G. Spirakis; Christos D. Zaroliagis (Theory Comput. Syst., 2003)

A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. - Ioannis Chatzigiannakis; Tassos Dimitriou; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (Parallel Process. Lett., 2003)

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. - Hermann Jung 001; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 2003)

Preface. - Shay Kutten; Paul G. Spirakis (Theor. Comput. Sci., 2003)

Analysis of the Information Propagation Time Among Mobile Hosts. - Tassos Dimitriou; Sotiris E. Nikoletseas; Paul G. Spirakis (ADHOC-NOW, 2004)

Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk). - Paul G. Spirakis (ALGOSENSORS, 2004)

Electronic National Lotteries. - Elisavet Konstantinou; Vasiliki Liagkou; Paul G. Spirakis; Yannis C. Stamatiou; Moti Yung (Financial Cryptography, 2004)

Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks. - Sotiris E. Nikoletseas; Paul G. Spirakis (Global Computing, 2004)

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (ICALP, 2004)

SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks. - Tassos Dimitriou; Ioannis Krontiris; Fotios Nikakis; Paul G. Spirakis (NETWORKING, 2004)

How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. - Tassos Dimitriou; Paul G. Spirakis (WEA, 2004)

The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing). - Sotiris E. Nikoletseas; Paul G. Spirakis (Bull. EATCS, 2004)

A hierarchical adaptive distributed algorithm for load balancing. - Konstantinos Antonis; John D. Garofalakis; Ioannis Mourtos; Paul G. Spirakis (J. Parallel Distributed Comput., 2004)

Evolutionary Games: An Algorithmic View. - Spyros C. Kontogiannis; Paul G. Spirakis (Self-star Properties in Complex Information Systems, 2005)

A Cost Mechanism for Fair Pricing of Resource Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmic Aspects of Large and Complex Networks, 2005)

Cost Sharing Mechanisms for Fair Pricing of Resources Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmic Aspects of Large and Complex Networks, 2005)

On the Existence of Hamiltonian Cycles in Random Intersection Graphs. - Charilaos Efthymiou 002; Paul G. Spirakis (ICALP, 2005)

Counting Stable Strategies in Random Evolutionary Games. - Spyros C. Kontogiannis; Paul G. Spirakis (ISAAC, 2005)

Network Game with Attacker and Protector Entities. - Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (ISAAC, 2005)

Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. - Christoforos L. Raptopoulos; Paul G. Spirakis (ISAAC, 2005)

"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience. - Elisavet Konstantinou; Vasiliki Liagkou; Paul G. Spirakis; Yannis C. Stamatiou; Moti Yung (ISC, 2005)

The Contribution of Game Theory to Complex Systems. - Spyros C. Kontogiannis; Paul G. Spirakis (Panhellenic Conference on Informatics, 2005)

Keynote Talk Summary: Algorithmic Aspects of Sensor Networks. - Paul G. Spirakis (WAC, 2005)

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. - Dimitris Fotakis 001; Spyros C. Kontogiannis; Paul G. Spirakis (WAOA, 2005)

Generating and Radiocoloring Families of Perfect Graphs. - Maria I. Andreou; Vicky G. Papadopoulou; Paul G. Spirakis; B. Theodorides; Andreas Xeros (WEA, 2005)

Experimental Results for Stackelberg Scheduling Strategies. - Alexis C. Kaporis; Lefteris M. Kirousis; Efpraxia I. Politopoulou; Paul G. Spirakis (WEA, 2005)

Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. - Panagiota N. Panagopoulou; Paul G. Spirakis (WEA, 2005)

Atomic Selfish Routing in Networks: A Survey. - Spyros C. Kontogiannis; Paul G. Spirakis (WINE, 2005)

An Application of the Monotone Linearizability Lemma. - Costas Busch; Marios Mavronicolas; Paul G. Spirakis (Bull. EATCS, 2005)

The Price of Optimum in Stackelberg Games - Alexis C. Kaporis; Efpraxia I. Politopoulou; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2005)

Max-min Fair Flow Control Sensitive to Priorities. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (J. Interconnect. Networks, 2005)

Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks. - Ioannis Chatzigiannakis; Sotiris E. Nikoletseas; Paul G. Spirakis (Mob. Networks Appl., 2005)

Space Efficient Hash Tables with Worst Case Constant Access Time. - Dimitris Fotakis 001; Rasmus Pagh; Peter Sanders 001; Paul G. Spirakis (Theory Comput. Syst., 2005)

The Impact of Network Structure on the Stability of Greedy Protocols. - Dimitrios Koukopoulos; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (Theory Comput. Syst., 2005)

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIAM J. Comput., 2005)

The cost of concurrent, low-contention Read&Modify&Write. - Costas Busch; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2005)

The chromatic and clique numbers of random scaled sector graphs. - Josep Díaz; Vishal Sanwalani; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Selfish unsplittable flows. - Dimitris Fotakis 001; Spyros C. Kontogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Radiocoloring in planar graphs: Complexity and approximations. - Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Structure and complexity of extreme Nash equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments. - Sotiris E. Nikoletseas; Paul G. Spirakis (Handbook of Algorithms for Wireless Networking and Mobile Computing, 2005)

The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks. - Vasiliki Liagkou; Effie Makri; Paul G. Spirakis; Yannis C. Stamatiou (ALGOSENSORS, 2006)

The Price of Defense and Fractional Matchings. - Marios Mavronicolas; Vicky G. Papadopoulou; Giuseppe Persiano; Anna Philippou; Paul G. Spirakis (ICDCN, 2006)

The Power of the Defender. - Marina Gelastou; Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (ICDCS Workshops, 2006)

The Price of Defense. - Marios Mavronicolas; Loizos Michael; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (MFCS, 2006)

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. - Ioannis Chatzigiannakis; Tassos Dimitriou; Sotiris E. Nikoletseas; Paul G. Spirakis (Ad Hoc Networks, 2006)

Direct Routing: Algorithms and Complexity. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas; Paul G. Spirakis (Algorithmica, 2006)

The infection time of graphs. - Tassos Dimitriou; Sotiris E. Nikoletseas; Paul G. Spirakis (Discret. Appl. Math., 2006)

Eight Open Problems in Distributed Computing. - James Aspnes; Costas Busch; Shlomi Dolev; Panagiota Fatourou; Chryssis Georgiou; Alexander A. Shvartsman; Paul G. Spirakis; Roger Wattenhofer (Bull. EATCS, 2006)

Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks. - Ioannis Chatzigiannakis; Elisavet Konstantinou; Vasiliki Liagkou; Paul G. Spirakis (WCAN@ICALP, 2006)

Weighted random sampling with a reservoir. - Pavlos S. Efraimidis; Paul G. Spirakis (Inf. Process. Lett., 2006)

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. - Dimitris Fotakis 001; Sotiris E. Nikoletseas; Vicky G. Papadopoulou; Paul G. Spirakis (J. Discrete Algorithms, 2006)

Algorithms for pure Nash equilibria in weighted congestion games. - Panagiota N. Panagopoulou; Paul G. Spirakis (ACM J. Exp. Algorithmics, 2006)

Introduction. - Burkhard Monien; Guang Gao; Horst D. Simon; Paul G. Spirakis; Per Stenström (J. Parallel Distributed Comput., 2006)

Approximation schemes for scheduling and covering on unrelated machines. - Pavlos S. Efraimidis; Paul G. Spirakis (Theor. Comput. Sci., 2006)

Trust in global computing systems as a limit property emerging from short range random interactions. - Vasiliki Liagkou; Effie Makri; Paul G. Spirakis; Yannis C. Stamatiou (ARES, 2007)

The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (CAI, 2007)

A Trust-Centered Approach for Building E-Voting Systems. - Athanasios Antoniou; C. Korakas; Christos Manolopoulos; Anastasia Panagiotaki; Dimitris Sofotassios; Paul G. Spirakis; Yannis C. Stamatiou (EGOV, 2007)

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. - Spyros C. Kontogiannis; Paul G. Spirakis (ICALP, 2007)

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. - Spyros C. Kontogiannis; Paul G. Spirakis (MFCS, 2007)

Selfish Load Balancing Under Partial Knowledge. - Elias Koutsoupias; Panagiota N. Panagopoulou; Paul G. Spirakis (MFCS, 2007)

Game authority for robust andscalable distributed selfish-computer systems. - Shlomi Dolev; Elad Michael Schiller; Paul G. Spirakis; Philippas Tsigas (PODC, 2007)

Probabilistic Techniques in Algorithmic Game Theory. - Spyros C. Kontogiannis; Paul G. Spirakis (SAGA, 2007)

Full and Local Information in Distributed Decision Making. - Panagiota N. Panagopoulou; Paul G. Spirakis (WAOA, 2007)

Agent-based Distributed Group Key Establishment in Wireless Sensor Networks. - Ioannis Chatzigiannakis; Elisavet Konstantinou; Vasiliki Liagkou; Paul G. Spirakis (WOWMOM, 2007)

The Price of Selfish Routing. - Marios Mavronicolas; Paul G. Spirakis (Algorithmica, 2007)

Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time.. - Paul G. Spirakis; Haralampos Tsaknakis (Electron. Colloquium Comput. Complex., 2007)

Performance and stability bounds for dynamic networks. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (J. Parallel Distributed Comput., 2007)

The increase of the instability of networks due to Quasi-Static link capacities. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2007)

Atomic Selfish Routing in Networks. - Spyros C. Kontogiannis; Paul G. Spirakis (Handbook of Parallel Computing, 2007)

Randomized Approximation Techniques. - Paul G. Spirakis; Sotiris E. Nikoletseas (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract). - Shlomi Dolev; Elad Michael Schiller; Paul G. Spirakis; Philippas Tsigas (Autonomics, 2008)

A Security Model for Internet-Based Digital Asset Management Systems. - Ioannis Chatzigiannakis; Vasiliki Liagkou; D. Salouros; Paul G. Spirakis (ECSA, 2008)

A step-wise refinement approach for enhancing e-voting acceptance. - Christos Manolopoulos; Dimitris Sofotassios; Polyxeni Nakou; Yannis C. Stamatiou; Anastasia Panagiotaki; Paul G. Spirakis (ICEGOV, 2008)

A Game Theoretic Approach for Efficient Graph Coloring. - Panagiota N. Panagopoulou; Paul G. Spirakis (ISAAC, 2008)

Scheduling tasks with dependencies on asymmetric multiprocessors. - Ioannis Chatzigiannakis; Georgios Giannoulis; Paul G. Spirakis (PODC, 2008)

Approximate Equilibria for Strategic Two Person Games. - Paul G. Spirakis (SAGT, 2008)

The Dynamics of Adaptive Networked Societies of Tiny Artefacts. - Ioannis Chatzigiannakis; Paul G. Spirakis (SASO Workshops, 2008)

Optimal Algorithms for Detecting Network Stability. - Dimitrios Koukopoulos; Stavros D. Nikolopoulos; Leonidas Palios; Paul G. Spirakis (WALCOM, 2008)

The Dynamics of Probabilistic Population Protocols. - Ioannis Chatzigiannakis; Paul G. Spirakis (DISC, 2008)

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. - Dimitris Kalles; Alexis C. Kaporis; Paul G. Spirakis (WEA, 2008)

Equilibrium Points in Fear of Correlated Threats. - Spyros C. Kontogiannis; Paul G. Spirakis (WINE, 2008)

Performance Evaluation of a Descent Algorithm for Bi-matrix Games. - Haralampos Tsaknakis; Paul G. Spirakis; Dimitrios Kanoulas (WINE, 2008)

A Network Game with Attackers and a Defender. - Marios Mavronicolas; Vicky Papadopoulou; Anna Philippou; Paul G. Spirakis (Algorithmica, 2008)

Cost Sharing Mechanisms for Fair Pricing of Resource Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmica, 2008)

Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model - Ioannis Chatzigiannakis; Georgios Giannoulis; Paul G. Spirakis (CoRR, 2008)

A graph-theoretic network security game. - Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (Int. J. Auton. Adapt. Commun. Syst., 2008)

Cost-Balancing Tolls for Atomic Network Congestion Games. - Dimitris Fotakis 001; Paul G. Spirakis (Internet Math., 2008)

An Optimization Approach for Approximate Nash Equilibria. - Haralampos Tsaknakis; Paul G. Spirakis (Internet Math., 2008)

Preface. - Paul G. Spirakis (Theory Comput. Syst., 2008)

Atomic congestion games among coalitions. - Dimitris Fotakis 001; Spyros C. Kontogiannis; Paul G. Spirakis (ACM Trans. Algorithms, 2008)

Random sampling of colourings of sparse random graphs with a constant number of colours. - Charilaos Efthymiou 002; Paul G. Spirakis (Theor. Comput. Sci., 2008)

Large independent sets in general random intersection graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Theor. Comput. Sci., 2008)

Efficient sensor network design for continuous monitoring of moving objects. - Sotiris E. Nikoletseas; Paul G. Spirakis (Theor. Comput. Sci., 2008)

Weighted Random Sampling. - Pavlos S. Efraimidis; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Hamilton Cycles in Random Intersection Graphs. - Charilaos Efthymiou 002; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Minimum Congestion Redundant Assignments. - Dimitris Fotakis 001; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Stackelberg Games: The Price of Optimum. - Alexis C. Kaporis; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Approximations of Bimatrix Nash Equilibria. - Spyros C. Kontogiannis; Panagiota N. Panagopoulou; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Independent Sets in Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Best Response Algorithms for Selfish Routing. - Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Selfish Unsplittable Flows: Algorithms for Pure Equilibria. - Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Tail Bounds for Occupancy Problems. - Paul G. Spirakis (Encyclopedia of Algorithms, 2008)

Paradigms for fast parallel approximability (Reprint from 1997). - Josep Díaz; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Cambridge University Press, 2009)

Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets. - Orestis Akribopoulos; Marios Logaras; Nikos Vasilakis; Panagiotis C. Kokkinos; Georgios Mylonas; Ioannis Chatzigiannakis; Paul G. Spirakis (Advances in Computer Entertainment Technology, 2009)

Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks. - Orestis Akribopoulos; Marios Logaras; Nikos Vasilakis; Panagiotis C. Kokkinos; Georgios Mylonas; Ioannis Chatzigiannakis; Paul G. Spirakis (Advances in Computer Entertainment Technology, 2009)

On the Fairness of Probabilistic Schedulers for Population Protocols. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (Algorithmic Methods for Distributed Cooperative Systems, 2009)

Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society? - Vasiliki Liagkou; Paul G. Spirakis; Yannis C. Stamatiou (e-Democracy, 2009)

The Impact of the Web and Political Balance to e-Democracy. - Christos Manolopoulos; Rozina Efstathiadou; Paul G. Spirakis (e-Democracy, 2009)

Combinatorial properties for efficient communication in distributed networks with local interactions. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (IPDPS, 2009)

Recent Advances in Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (MFCS, 2009)

Colouring Non-sparse Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (MFCS, 2009)

Not All Fair Probabilistic Schedulers Are Equivalent. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (OPODIS, 2009)

Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (DISC, 2009)

Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. - Sotiris E. Nikoletseas; Paul G. Spirakis (Algorithms, 2009)

Preface to special issue on cooperation in selfish systems. - David Hales; Bruce Edmonds; Özalp Babaoglu; Paul G. Spirakis (Comput. Math. Organ. Theory, 2009)

The survival of the weakest in networks. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Comput. Math. Organ. Theory, 2009)

A glimpse at Christos H. Papadimitriou. - Marios Mavronicolas; Paul G. Spirakis (Comput. Sci. Rev., 2009)

Book review. - Paul G. Spirakis (Comput. Sci. Rev., 2009)

A note on proofs of existence of Nash equilibria in finite strategic games, of two players. - Paul G. Spirakis (Comput. Sci. Rev., 2009)

Recent Advances in Approximability of Bimatrix Nash. - Spyros C. Kontogiannis; Paul G. Spirakis; Haralampos Tsaknakis (Bull. EATCS, 2009)

A Graph Spectral Approach for Computing Approximate Nash Equilibria. - Haralampos Tsaknakis; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2009)

The structure and complexity of Nash equilibria for a selfish routing game. - Dimitris Fotakis 001; Spyros C. Kontogiannis; Elias Koutsoupias; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2009)

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. - Alexis C. Kaporis; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Polynomial algorithms for approximating Nash equilibria of bimatrix games. - Spyros C. Kontogiannis; Panagiota N. Panagopoulou; Paul G. Spirakis (Theor. Comput. Sci., 2009)

On the support size of stable strategies in random games. - Spyros C. Kontogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Computing on a partially eponymous ring. - Marios Mavronicolas; Loizos Michael; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Expander properties and the cover time of random intersection graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Preface. - Paul G. Spirakis; Marios Mavronicolas; Spyros C. Kontogiannis (Theor. Comput. Sci., 2009)

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. - Spyros C. Kontogiannis; Paul G. Spirakis (APPROX-RANDOM, 2010)

Fun with Games. - Paul G. Spirakis; Ioannis Chatzigiannakis; Georgios Mylonas; Panagiota N. Panagopoulou (FUN, 2010)

All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (MFCS, 2010)

Distributed Game-Theoretic Vertex Coloring. - Ioannis Chatzigiannakis; Christos Koninis; Panagiota N. Panagopoulou; Paul G. Spirakis (OPODIS, 2010)

Blueprints for a Large-Scale Early Warning System. - Paul G. Spirakis; Vasileios Vlachos; Vassilios Karakoidas; Dimitrios Liappis; Dimitris Kalaitzis; Eftychios Valeontis; Spyros K. Kollias; George Argyros (Panhellenic Conference on Informatics, 2010)

Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. - Ioannis Chatzigiannakis; Georgios Mylonas; Orestis Akribopoulos; Marios Logaras; Panagiotis C. Kokkinos; Paul G. Spirakis (SPAA, 2010)

Algorithmic Verification of Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (SSS, 2010)

Stably Decidable Graph Languages by Mediated Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (SSS, 2010)

Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra. - Haralampos Tsaknakis; Paul G. Spirakis (WINE, 2010)

Well Supported Approximate Equilibria in Bimatrix Games. - Spyros C. Kontogiannis; Paul G. Spirakis (Algorithmica, 2010)

The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game - Ioannis Chatzigiannakis; Georgios Mylonas; Orestis Akribopoulos; Marios Logaras; Panagiotis C. Kokkinos; Paul G. Spirakis (CoRR, 2010)

Passively Mobile Communicating Logarithmic Space Machines - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (CoRR, 2010)

Atomic Congestion Games: Fast, Myopic and Concurrent. - Dimitris Fotakis 001; Alexis C. Kaporis; Paul G. Spirakis (Theory Comput. Syst., 2010)

Game authority for robust and scalable distributed selfish-computer systems. - Shlomi Dolev; Elad Michael Schiller; Paul G. Spirakis; Philippas Tsigas (Theor. Comput. Sci., 2010)

Sharp thresholds for Hamiltonicity in random intersection graphs. - Charilaos Efthymiou 002; Paul G. Spirakis (Theor. Comput. Sci., 2010)

Adaptive Hierarchical Network Structures for Wireless Sensor Networks. - Dimitrios Amaxilatis; Ioannis Chatzigiannakis; Shlomi Dolev; Christos Koninis; Apostolos Pyrgelis; Paul G. Spirakis (ADHOCNETS, 2011)

Selected Combinatorial Properties of Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Algebraic Foundations in Computer Science, 2011)

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution. - Vasiliki Liagkou; Effie Makri; Paul G. Spirakis; Yannis C. Stamatiou (ICGS3/e-Democracy, 2011)

Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices. - Ioannis Chatzigiannakis; Apostolos Pyrgelis; Paul G. Spirakis; Yannis C. Stamatiou (MASS, 2011)

Rationality authority for provable rational behavior. - Shlomi Dolev; Panagiota N. Panagopoulou; Mikaël Rabie; Elad Michael Schiller; Paul G. Spirakis (PODC, 2011)

Approximability of Symmetric Bimatrix Games and Related Experiments. - Spyros C. Kontogiannis; Paul G. Spirakis (SEA, 2011)

Communication and security in random intersection graphs models. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (WOWMOM, 2011)

On the Performance of Approximate Equilibria in Congestion Games. - George Christodoulou 001; Elias Koutsoupias; Paul G. Spirakis (Algorithmica, 2011)

Computational models for networks of tiny artifacts: A survey. - Carme Àlvarez; Ioannis Chatzigiannakis; Amalia Duch; Joaquim Gabarró; Othon Michail; Maria J. Serna; Paul G. Spirakis (Comput. Sci. Rev., 2011)

Innovative approaches for security of small artefacts. - Carlo Blundo; Angelo De Caro; Shlomi Dolev; Niv Gilboa; Marina Kopeetsky; Giuseppe Persiano; Paul G. Spirakis (Comput. Sci. Rev., 2011)

Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts. - Ioannis Chatzigiannakis; Paul G. Spirakis (Comput. Sci. Rev., 2011)

Robust and scalable middleware for selfish-computer systems. - Shlomi Dolev; Elad Michael Schiller; Paul G. Spirakis; Philippas Tsigas (Comput. Sci. Rev., 2011)

Selfish splittable flows and NP-completeness. - Alexis C. Kaporis; Paul G. Spirakis (Comput. Sci. Rev., 2011)

Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata. - Shlomi Dolev; Elad Michael Schiller; Paul G. Spirakis; Philippas Tsigas (Int. J. Auton. Adapt. Commun. Syst., 2011)

Passively mobile communicating machines that use restricted space. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2011)

Mediated population protocols. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (Theor. Comput. Sci., 2011)

On the independence number and Hamiltonicity of uniform random intersection graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Theor. Comput. Sci., 2011)

Probabilistic Data Propagation in Wireless Sensor Networks. - Sotiris E. Nikoletseas; Paul G. Spirakis (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

Population Protocols and Related Models. - Paul G. Spirakis (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

New Models for Population Protocols - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (Morgan & Claypool Publishers, 2011)

Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials. - Vasiliki Liagkou; George Metakides; Apostolos Pyrgelis; Christoforos L. Raptopoulos; Paul G. Spirakis; Yannis C. Stamatiou (APF, 2012)

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (SSS, 2012)

Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (DISC, 2012)

Can Fixation be Guaranteed in the Generalized Moran Process? - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (CoRR, 2012)

Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (CoRR, 2012)

Strong Bounds for Evolution in Undirected Graphs - George B. Mertzios; Paul G. Spirakis (CoRR, 2012)

The Impact of Social Ignorance on Weighted Congestion Games. - Dimitris Fotakis 001; Vasilis Gkatzelis; Alexis C. Kaporis; Paul G. Spirakis (Theory Comput. Syst., 2012)

Playing a Game to Bound the Chromatic Number. - Panagiota N. Panagopoulou; Paul G. Spirakis (Am. Math. Mon., 2012)

Efficient methods for selfish network design. - Dimitris Fotakis 001; Alexis C. Kaporis; Paul G. Spirakis (Theor. Comput. Sci., 2012)

On mutual concavity and strategically-zero-sum bimatrix games. - Spyros C. Kontogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2012)

Potential Functions in Strategic Games. - Paul G. Spirakis; Panagiota N. Panagopoulou (CSR, 2013)

Temporal Network Optimization Subject to Connectivity Constraints. - George B. Mertzios; Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (ICALP (2), 2013)

A Guided Tour in Random Intersection Graphs. - Paul G. Spirakis; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos (ICALP (2), 2013)

Agent agreement protocols based on golay error-correcting code. - Panayotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou; Christina Vichou (IISA, 2013)

Naming and Counting in Anonymous Unknown Dynamic Networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (SSS, 2013)

The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs. - Rajgopal Kannan; Costas Busch; Paul G. Spirakis (CoRR, 2013)

Moving in temporal graphs with very sparse random availability of edges. - Paul G. Spirakis; Eleni Ch. Akrida (CoRR, 2013)

A Framework for Protecting Voters' Privacy In Electronic Voting Procedures. - Christos Manolopoulos; Dimitris Sofotassios; Paul G. Spirakis; Yannis C. Stamatiou (J. Cases Inf. Technol., 2013)

Preface to Special Issue on Algorithmic Game Theory. - Spyros C. Kontogiannis; Elias Koutsoupias; Pavlos G. Spirakis (Theory Comput. Syst., 2013)

The computational power of simple protocols for self-awareness on graphs. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Paul G. Spirakis (Theor. Comput. Sci., 2013)

Natural models for evolution on networks. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Theor. Comput. Sci., 2013)

Ephemeral networks with random availability of links: diameter and connectivity. - Eleni C. Akrida; Leszek Gasieniec; George B. Mertzios; Paul G. Spirakis (SPAA, 2014)

Information security for sensors by overwhelming random sequences and permutations. - Shlomi Dolev; Niv Gilboa; Marina Kopeetsky; Giuseppe Persiano; Paul G. Spirakis (Ad Hoc Networks, 2014)

Approximating Fixation Probabilities in the Generalized Moran Process. - Josep Díaz; Leslie Ann Goldberg; George B. Mertzios; David Richerby; Maria J. Serna; Paul G. Spirakis (Algorithmica, 2014)

Causality, influence, and computation in possibly disconnected synchronous dynamic networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (J. Parallel Distributed Comput., 2014)

Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). - Panagiota N. Panagopoulou; Paul G. Spirakis (Theory Comput. Syst., 2014)

On the hardness of network design for bottleneck routing games. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Theor. Comput. Sci., 2014)

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations. - Maria I. Andreou; Dimitris Fotakis 001; Vicky Papadopoulou Lesta; Sotiris E. Nikoletseas; Paul G. Spirakis (Algorithms, Probability, Networks, and Games, 2015)

The Match-Maker: Constant-Space Distributed Majority via Random Walks. - Leszek Gasieniec; David D. Hamilton; Russell Martin; Paul G. Spirakis (SSS, 2015)

On Temporally Connected Graphs of Small Cost. - Eleni C. Akrida; Leszek Gasieniec; George B. Mertzios; Paul G. Spirakis (WAOA, 2015)

Designing and Testing Temporally Connected Graphs. - Eleni C. Akrida; Leszek Gasieniec; George B. Mertzios; Paul G. Spirakis (CoRR, 2015)

NETCS: A New Simulator of Population Protocols and Network Constructors. - Dimitrios Amaxilatis; Marios Logaras; Othon Michail; Paul G. Spirakis (CoRR, 2015)

On Equilibrium Computation in Biased Games with Quadratic Penalties. - Argyrios Deligkas; Paul G. Spirakis (CoRR, 2015)

Terminating population protocols via some minimal global knowledge assumptions. - Othon Michail; Paul G. Spirakis (J. Parallel Distributed Comput., 2015)

On the structure of equilibria in basic network formation. - Sotiris E. Nikoletseas; Panagiota N. Panagopoulou; Christoforos L. Raptopoulos; Paul G. Spirakis (Theor. Comput. Sci., 2015)

Strategic Contention Resolution with Limited Feedback. - George Christodoulou 001; Martin Gairing; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (ESA, 2016)

Stably Computing Order Statistics with Arithmetic Population Protocols. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (MFCS, 2016)

Deterministic Population Protocols for Exact Majority and Plurality. - Leszek Gasieniec; David D. Hamilton; Russell Martin; Paul G. Spirakis; Grzegorz Stachowiak (OPODIS, 2016)

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. - George B. Mertzios; Paul G. Spirakis (Algorithmica, 2016)

Flows in Temporal networks. - Eleni C. Akrida; Jurek Czyzowicz; Leszek Gasieniec; Lukasz Kuszner; Paul G. Spirakis (CoRR, 2016)

On the Complexity of Weighted Greedy Matchings. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (CoRR, 2016)

Simple and efficient local codes for distributed stable network construction. - Othon Michail; Paul G. Spirakis (Distributed Comput., 2016)

EATCS Fellows' Advice to the Young Theoretical Computer Scientist. - Luca Aceto; Mariangiola Dezani-Ciancaglini; Yuri Gurevich; David Harel; Monika Henzinger; Giuseppe F. Italiano; Scott A. Smolka; Paul G. Spirakis; Wolfgang Thomas (Bull. EATCS, 2016)

Ephemeral networks with random availability of links: The case of fast networks. - Eleni C. Akrida; Leszek Gasieniec; George B. Mertzios; Paul G. Spirakis (J. Parallel Distributed Comput., 2016)

Traveling salesman problems in temporal graphs. - Othon Michail; Paul G. Spirakis (Theor. Comput. Sci., 2016)

Weighted Random Sampling. - Pavlos S. Efraimidis; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Hamilton Cycles in Random Intersection Graphs. - Charilaos Efthymiou 002; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Minimum Congestion Redundant Assignments. - Dimitris Fotakis 001; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Stackelberg Games: The Price of Optimum. - Alexis C. Kaporis; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Independent Sets in Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Approximations of Bimatrix Nash Equilibria. - Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Best Response Algorithms for Selfish Routing. - Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Selfish Unsplittable Flows: Algorithms for Pure Equilibria. - Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

Tail Bounds for Occupancy Problems. - Paul (Pavlos) Spirakis (Encyclopedia of Algorithms, 2016)

The Computational Complexity of Weighted Greedy Matching. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (AAAI, 2017)

Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. - Themistoklis Melissourgos; Paul G. Spirakis (CIAC, 2017)

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. - George Christodoulou 001; Martin Gairing; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (SAGT, 2017)

Network Constructors: A Model for Programmable Matter. - Othon Michail; Paul G. Spirakis (SOFSEM, 2017)

The Dynamics and Stability of Probabilistic Population Processes. - Ioannis Chatzigiannakis; Paul G. Spirakis (SSS, 2017)

Computing Approximate Nash Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Rahul Savani; Paul G. Spirakis (Algorithmica, 2017)

Resolving Braess's Paradox in Random Networks. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Algorithmica, 2017)

Learning Powers of Poisson Binomial Distributions. - Dimitris Fotakis 001; Vasilis Kontonis; Piotr Krysta; Paul G. Spirakis (CoRR, 2017)

Bounding the Cover Time in Edge-Uniform Stochastic Graphs. - Ioannis Lamprou 001; Russell Martin; Paul G. Spirakis (CoRR, 2017)

Determining majority in networks with local interactions and very small local memory. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Distributed Comput., 2017)

Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. - Paul G. Spirakis; Leslie Ann Goldberg; Antonín Kucera 001; Giuseppe Persiano (Bull. EATCS, 2017)

The Complexity of Optimal Design of Temporally Connected Graphs. - Eleni C. Akrida; Leszek Gasieniec; George B. Mertzios; Paul G. Spirakis (Theory Comput. Syst., 2017)

On the Chromatic Number of Non-Sparse Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Theory Comput. Syst., 2017)

Connectivity preserving network transformers. - Othon Michail; Paul G. Spirakis (Theor. Comput. Sci., 2017)

Efficient Approximation Algorithms in Random Intersection Graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Randomized Approximation Techniques. - Sotiris E. Nikoletseas; Paul G. Spirakis (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. - Ioannis Chatzigiannakis; Vasiliki Liagkou; Paul G. Spirakis (CSCML, 2018)

Random input helps searching predecessors. - Djamal Belazzougui; Alexis C. Kaporis; Paul G. Spirakis (GASCom, 2018)

Mutants and Residents with Different Connection Graphs in the Moran Process. - Themistoklis Melissourgos; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (LATIN, 2018)

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (SAGT, 2018)

Brief Announcement: Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (SIROCCO, 2018)

Strategic Contention Resolution in Multiple Channels. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (WAOA, 2018)

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (DISC, 2018)

Cover Time in Edge-Uniform Stochastically-Evolving Graphs. - Ioannis Lamprou 001; Russell Martin; Paul G. Spirakis (Algorithms, 2018)

Elements of the theory of dynamic networks. - Othon Michail; Paul G. Spirakis (Commun. ACM, 2018)

Exact size counting in uniform population protocols in nearly logarithmic time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

How many cooks spoil the soup? - Othon Michail; Paul G. Spirakis (Distributed Comput., 2018)

Strong bounds for evolution in networks. - George B. Mertzios; Paul G. Spirakis (J. Comput. Syst. Sci., 2018)

Data-Driven Intrusion Detection for Ambient Intelligence. - Ioannis Chatzigiannakis; Luca Maiano; Panagiotis Trakadas; Aris Anagnostopoulos; Federico Bacci; Panagiotis Karkazis; Paul G. Spirakis; Theodore B. Zahariadis (AmI, 2019)

The Temporal Explorer Who Returns to the Base. - Eleni C. Akrida; George B. Mertzios; Paul G. Spirakis (CIAC, 2019)

Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement). - Vasiliki Liagkou; Paul G. Spirakis; Yannis C. Stamatiou (CSCML, 2019)

Binary Search in Graphs Revisited. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis (Algorithmica, 2019)

Temporal Network Optimization Subject to Connectivity Constraints. - George B. Mertzios; Othon Michail; Paul G. Spirakis (Algorithmica, 2019)

Temporal flows in temporal networks. - Eleni C. Akrida; Jurek Czyzowicz; Leszek Gasieniec; Lukasz Kuszner; Paul G. Spirakis (J. Comput. Syst. Sci., 2019)

On the transformation capability of feasible mechanisms for programmable matter. - Othon Michail; George Skretas; Paul G. Spirakis (J. Comput. Syst. Sci., 2019)

On Verifying and Maintaining Connectivity of Interval Temporal Networks. - Eleni C. Akrida; Paul G. Spirakis (Parallel Process. Lett., 2019)

The Price of Stability of Weighted Congestion Games. - George Christodoulou 001; Martin Gairing; Yiannis Giannakopoulos; Paul G. Spirakis (SIAM J. Comput., 2019)

An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects. - Gabriel Filios; Ioannis Katsidimas; Emmanouil Kerimakis; Sotiris E. Nikoletseas; Alexandros Souroulagkas; Paul G. Spirakis (DCOSS, 2020)

A smart energy management power supply unit for low-power IoT systems. - Gabriel Filios; Ioannis Katsidimas; Sotiris E. Nikoletseas; Alexandros Souroulagkas; Paul G. Spirakis; Ioannis Tsenempis (DCOSS, 2020)

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (MFCS, 2020)

Crystal Structure Prediction via Oblivious Local Search. - Dmytro Antypov; Argyrios Deligkas; Vladimir V. Gusev; Matthew J. Rosseinsky; Paul G. Spirakis; Michail Theofilatos (SEA, 2020)

Lipschitz Continuity and Approximate Equilibria. - Argyrios Deligkas; John Fearnley; Paul G. Spirakis (Algorithmica, 2020)

Matching in Stochastically Evolving Graphs. - Eleni C. Akrida; Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (CoRR, 2020)

Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2020)

Letter from the President. - Paul G. Spirakis (Bull. EATCS, 2020)

How fast can we reach a target vertex in stochastic temporal graphs? - Eleni C. Akrida; George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis; Viktor Zamaraev (J. Comput. Syst. Sci., 2020)

Temporal vertex cover with a sliding time window. - Eleni C. Akrida; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (J. Comput. Syst. Sci., 2020)

Preface. - Giorgio Ausiello; Lila Kari; Grzegorz Rozenberg; Donald Sannella; Paul G. Spirakis; Pierre-Louis Curien (Theor. Comput. Sci., 2020)

Walrasian Equilibria in Markets with Small Demands. - Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (AAMAS, 2021)

Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis. - Vasiliki Liagkou; Panagiotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (CSCML, 2021)

A Complementary Sensing Platform for a holistic approach to Allergic Rhinitis monitoring. - Andreas Bardoutsos; Giorgos Matzarapis; Sotiris E. Nikoletseas; Paul G. Spirakis; Pantelis Tzamalis (DCOSS, 2021)

A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices. - Andreas Bardoutsos; Dimitris Markantonatos; Sotiris E. Nikoletseas; Paul G. Spirakis; Pantelis Tzamalis (DCOSS, 2021)

ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector. - Vasileios Vlachos; Gerasimos Katevas; Ioannis Katsidimas; Emmanouil Kerimakis; Sotiris E. Nikoletseas; Stefanos Panagiotou; Paul G. Spirakis (PCI, 2021)

Connected Subgraph Defense Games. - Eleni C. Akrida; Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (Algorithmica, 2021)

The Price of Defense. - Marios Mavronicolas; Loizos Michael; Vicky Papadopoulou Lesta; Giuseppe Persiano; Anna Philippou; Paul G. Spirakis (Algorithmica, 2021)

An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures. - Alessandro Varsi; Simon Maskell; Paul G. Spirakis (Algorithms, 2021)

New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive). - Leszek Gasieniec; Paul G. Spirakis; Grzegorz Stachowiak (CoRR, 2021)

Maximum cliques in graphs with small intersection number and random intersection graphs. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Comput. Sci. Rev., 2021)

Maria Serna and her years in Patras. - Paul G. Spirakis (Comput. Sci. Rev., 2021)

On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. - Matthew Connor; Othon Michail; Paul G. Spirakis (Inf., 2021)

The temporal explorer who returns to the base. - Eleni C. Akrida; George B. Mertzios; Paul G. Spirakis; Christoforos L. Raptopoulos (J. Comput. Syst. Sci., 2021)

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2021)

Beyond Rings: Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Parallel Process. Lett., 2021)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs. - Thekla Hamm; Nina Klobas; George B. Mertzios; Paul G. Spirakis (AAAI, 2022)

On the Undecidability of the Panopticon Detection Problem. - Vasiliki Liagkou; Panagiotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (CSCML, 2022)

Data-driven soft sensing towards quality monitoring of industrial pasteurization processes. - Gabriel Filios; Andreas Kyriakopoulos; Stavros Livanios; Fotis Manolopoulos; Sotiris E. Nikoletseas; Stefanos Panagiotou; Paul G. Spirakis (DCOSS, 2022)

Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods. - Efthyvoulos Drousiotis; Lei Shi 003; Paul G. Spirakis; Simon Maskell (EANN, 2022)

Algorithmic Problems on Temporal Graphs (Invited Talk). - Paul G. Spirakis (SAND, 2022)

Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols. - Leszek Gasieniec; Paul G. Spirakis; Grzegorz Stachowiak (DISC, 2022)

How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem. - Vasiliki Liagkou; Panayotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (Cryptogr., 2022)

Distributed computation and reconfiguration in actively dynamic networks. - Othon Michail; George Skretas; Paul G. Spirakis (Distributed Comput., 2022)

Simple and fast approximate counting and leader election in populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2022)

On convergence and threshold properties of discrete Lotka-Volterra population protocols. - Jurek Czyzowicz; Leszek Gasieniec; Adrian Kosowski; Evangelos Kranakis; Paul G. Spirakis; Przemyslaw Uznanski (J. Comput. Syst. Sci., 2022)

Approximating the existential theory of the reals. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

An extension of the Moran process using type-specific connection graphs. - Themistoklis Melissourgos; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. - Paul G. Spirakis; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos (CIAC, 2023)

On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents. - Vasiliki Liagkou; Panagiotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (CSCML, 2023)

Realizing Predictive Maintenance in Production Machinery Through Low-Cost IIoT Framework and Anomaly Detection: A Case Study in a Real-World Manufacturing Environment. - Gabriel Filios; Stylianos Karatzas; Marios Krousarlis; Sotiris E. Nikoletseas; Stefanos H. Panagiotou; Paul G. Spirakis (DCOSS-IoT, 2023)

GestureSet: Public Domain Dataset for Human Gesture Recognition using Wrist-worn Devices: A Preliminary Version. - Pantelis Tzamalis; Sotiris E. Nikoletseas; Paul G. Spirakis (DCOSS-IoT, 2023)

Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation. - Efthyvoulos Drousiotis; Dan W. Joyce; Robert C. Dempsey; Alina Haines; Paul G. Spirakis; Lei Shi 003; Simon Maskell (AIAI (1), 2023)

Bayesian Decision Trees Inspired from Evolutionary Algorithms. - Efthyvoulos Drousiotis; Alexander M. Phillips; Paul G. Spirakis; Simon Maskell (LION, 2023)

Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). - Nina Klobas; George B. Mertzios; Paul G. Spirakis (MFCS, 2023)

The Contest Game for Crowdsourcing Reviews. - Marios Mavronicolas; Paul G. Spirakis (SAGT, 2023)

A Shared Memory SMC Sampler for Decision Trees. - Efthyvoulos Drousiotis; Alessandro Varsi; Paul G. Spirakis; Simon Maskell (SBAC-PAD, 2023)

A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. - Filippos Christodoulou; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (SOFSEM, 2023)

New Clocks, Optimal Line Formation and Self-Replication Population Protocols. - Leszek Gasieniec; Paul G. Spirakis; Grzegorz Stachowiak (STACS, 2023)

Parallel Approaches to Accelerate Bayesian Decision Trees. - Efthyvoulos Drousiotis; Paul G. Spirakis; Simon Maskell (CoRR, 2023)

Realizing temporal graphs from fastest travel times. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (CoRR, 2023)

Optimality guarantees for crystal structure prediction. - Vladimir V. Gusev; Duncan Adamson; Argyrios Deligkas; Dmytro Antypov; Christopher M. Collins 003; Piotr Krysta; Igor Potapov; George R. Darling; Matthew S. Dyer; Paul G. Spirakis; Matthew J. Rosseinsky (Nat., 2023)

Threshold-based network structural dynamics. - Evangelos Kipouridis; Paul G. Spirakis; Kostas Tsichlas (Theor. Comput. Sci., 2023)

Fault tolerant network constructors. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2023)

MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. - Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (Algorithmica, 2023)

The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (ALGOWIN, 2024)

On the Security Related Properties of Randomly Constructed Combinatorial Structures. - Vasiliki Liagkou; Panayotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (CSCML, 2024)

Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (LATIN (2), 2024)

An SMC Sampler for Decision Trees with Enhanced Initial Proposal for Stochastic Metaheuristic Optimization. - Efthyvoulos Drousiotis; Alessandro Varsi; Paul G. Spirakis; Simon Maskell (LION, 2024)

Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler. - Soodeh Habibi; Efthyvoulos Drousiotis; Alessandro Varsi; Simon Maskell; Robert E. Moore; Paul G. Spirakis (LION, 2024)

Brief Announcement: Collision-Free Robot Scheduling. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (SAND, 2024)

Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (SAND, 2024)

On the Existence of Consensus Converging Organized Groups in Large Social Networks. - Vasiliki Liagkou; Panagiotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (SIROCCO, 2024)

Realizing temporal transportation trees. - George B. Mertzios; Hendrik Molter; Paul G. Spirakis (CoRR, 2024)

On the existence of δ-temporal cliques in random simple temporal graphs. - George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (CoRR, 2024)

Anonymous Distributed Localisation via Spatial Population Protocols. - Leszek Gasieniec; Lukasz Kuszner; Ehsan Latif; Ramviyas Parasuraman; Paul G. Spirakis; Grzegorz Stachowiak (CoRR, 2024)

Distributed weak independent sets in hypergraphs: Upper and lower bounds. - Duncan Adamson; Will Rosenbaum; Paul G. Spirakis (CoRR, 2024)

The complexity of computing optimum labelings for temporal connectivity. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (J. Comput. Syst. Sci., 2024)

Which is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis; Imrich Vrto (SIAM J. Discret. Math., 2024)

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (Algorithmica, 2024)

Adversarial Attacks on Trees: Size Matters. - Efthyvoulos Drousiotis; Soodeh Habibi; Alessandro Varsi; Simon Maskell; Paul G. Spirakis; Tom Lovett (AIAI (1), 2025)

Temporal Graph Realization with Bounded Stretch. - George B. Mertzios; Hendrik Molter; Nils Morawietz; Paul G. Spirakis (MFCS, 2025)

Mixed Nash Equilibria in Discrete Tullock Contests. - Vittorio Bilò; Marios Mavronicolas; Paul G. Spirakis; Daniel Windisch (SAGT, 2025)

Brief Announcement: Anonymous Distributed Localisation via Spatial Population Protocols. - Leszek Gasieniec; Lukasz Kuszner; Ehsan Latif; Ramviyas Parasuraman; Paul G. Spirakis; Grzegorz Stachowiak (SAND, 2025)

Construction of Countably Infinite Programs That Evade Malware/Non-Malware Classification for Any Given Formal System. - Vasiliki Liagkou; Panagiotis E. Nastou; Paul G. Spirakis; Yannis C. Stamatiou (Cryptogr., 2025)

Collision-free Robot Scheduling. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (Inf. Comput., 2025)

The complexity of transitively orienting temporal graphs. - George B. Mertzios; Hendrik Molter; Malte Renken; Paul G. Spirakis; Philipp Zschoche (J. Comput. Syst. Sci., 2025)

The complexity of growing a graph. - George B. Mertzios; Othon Michail; George Skretas; Paul G. Spirakis; Michail Theofilatos (J. Comput. Syst. Sci., 2025)

Temporal graph realization from fastest paths. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (Theor. Comput. Sci., 2025)

Single MCMC chain parallelisation on decision trees. - Efthyvoulos Drousiotis; Paul G. Spirakis (Ann. Math. Artif. Intell., 2025)

Fast and Safe Scheduling of Robots. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (CoRR, 2025)

MACS: Multi-Agent Reinforcement Learning for Optimization of Crystal Structures. - Elena Zamaraeva; Christopher M. Collins 003; George R. Darling; Matthew S. Dyer; Bei Peng; Rahul Savani; Dmytro Antypov; Vladimir V. Gusev; Judith Clymo; Paul G. Spirakis; Matthew J. Rosseinsky (CoRR, 2025)