Seguir
Paul Spirakis
Paul Spirakis
Professor of Computer Science U. Liverpool and U. Patras
Dirección de correo verificada de liverpool.ac.uk
Título
Citado por
Citado por
Año
Coordinating pebble motion on graphs, the diameter of permutation groups, and applications
DM Kornhauser, G Miller, P Spirakis
M. I. T., Dept. of Electrical Engineering and Computer Science, 1984
3131984
Weighted random sampling with a reservoir
PS Efraimidis, PG Spirakis
Information processing letters 97 (5), 181-185, 2006
3082006
The structure and complexity of Nash equilibria for a selfish routing game
D Fotakis, S Kontogiannis, E Koutsoupias, M Mavronicolas, P Spirakis
International Colloquium on Automata, Languages, and Programming, 123-134, 2002
2912002
The price of selfish routing
M Mavronicolas, P Spirakis
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2462001
Tail bounds for occupancy and the satisfiability threshold conjecture
A Kamath, R Motwani, K Palem, P Spirakis
Random Structures & Algorithms 7 (1), 59-80, 1995
2211995
Selfish unsplittable flows
D Fotakis, S Kontogiannis, P Spirakis
Theoretical Computer Science 348 (2-3), 226-239, 2005
2052005
Efficient robust parallel computations
ZM Kedem, KV Palem, PG Spirakis
Proceedings of the twenty-second annual ACM symposium on Theory of Computing …, 1990
1641990
Approximate equilibria and ball fusion
E Koutsoupias, M Mavronicolas, P Spirakis
Theory of Computing Systems 36 (6), 683-693, 2003
1552003
Fundamental control algorithms in mobile networks
KP Hatzis, GP Pentaris, PG Spirakis, VT Tampakas, RB Tan
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and …, 1999
1551999
Space efficient hash tables with worst case constant access time
D Fotakis, R Pagh, P Sanders, P Spirakis
Theory of Computing Systems 38 (2), 229-248, 2005
1342005
BSP vs LogP
G Bilardi, KT Herley, A Pietracaprina, G Pucci, P Spirakis
Proceedings of the eighth annual ACM symposium on Parallel algorithms and …, 1996
1191996
Combining tentative and definite executions for very fast dependable parallel computing
ZM Kedem, KV Palem, A Raghunathan, PG Spirakis
Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991
1181991
An optimization approach for approximate Nash equilibria
H Tsaknakis, PG Spirakis
International Workshop on Web and Internet Economics, 42-56, 2007
1152007
Mediated population protocols
O Michail, I Chatzigiannakis, PG Spirakis
Theoretical Computer Science 412 (22), 2434-2450, 2011
108*2011
Strong NP-hardness of moving many discs
P Spirakis, CK Yap
Information Processing Letters 19 (1), 55-59, 1984
1071984
Determining majority in networks with local interactions and very small local memory
GB Mertzios, SE Nikoletseas, CL Raptopoulos, PG Spirakis
International Colloquium on Automata, Languages, and Programming, 871-882, 2014
1032014
Traveling salesman problems in temporal graphs
O Michail, PG Spirakis
Theoretical Computer Science 634, 1-23, 2016
1002016
Space efficient hash tables with worst case constant access time
D Fotakis, R Pagh, P Sanders, P Spirakis
Annual Symposium on Theoretical Aspects of Computer Science, 271-282, 2003
992003
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
H Jung, LM Kirousis, P Spirakis
Information and Computation 105 (1), 94-104, 1993
941993
An efficient communication strategy for ad-hoc mobile networks
I Chatzigiannakis, S Nikoletseas, P Spirakis
International Symposium on Distributed Computing, 285-299, 2001
872001
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20