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
Weighted random sampling with a reservoir
PS Efraimidis, PG Spirakis
Information processing letters 97 (5), 181-185, 2006
4112006
Coordinating pebble motion on graphs, the diameter of permutation groups, and applications
DM Kornhauser
3721984
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
3012002
The price of selfish routing
M Mavronicolas, P Spirakis
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2522001
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
2401995
Selfish unsplittable flows
D Fotakis, S Kontogiannis, P Spirakis
Theoretical Computer Science 348 (2-3), 226-239, 2005
2232005
Efficient robust parallel computations
ZM Kedem, KV Palem, PG Spirakis
Proceedings of the twenty-second annual ACM symposium on Theory of Computing …, 1990
1731990
Approximate equilibria and ball fusion
E Koutsoupias, M Mavronicolas, P Spirakis
Theory of Computing Systems 36 (6), 683-693, 2003
1652003
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
1651999
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
1492005
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
1291991
Traveling salesman problems in temporal graphs
O Michail, PG Spirakis
Theoretical Computer Science 634, 1-23, 2016
1262016
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
1241996
An optimization approach for approximate Nash equilibria
H Tsaknakis, PG Spirakis
International Workshop on Web and Internet Economics, 42-56, 2007
1202007
Space efficient hash tables with worst case constant access time
D Fotakis, R Pagh, P Sanders, P Spirakis
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science …, 2003
1202003
Mediated population protocols
O Michail, I Chatzigiannakis, PG Spirakis
Theoretical Computer Science 412 (22), 2434-2450, 2011
118*2011
Strong NP-hardness of moving many discs
P Spirakis, CK Yap
Information Processing Letters 19 (1), 55-59, 1984
1111984
Determining majority in networks with local interactions and very small local memory
GB Mertzios, SE Nikoletseas, CL Raptopoulos, PG Spirakis
Distributed Computing 30, 1-16, 2017
1092017
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays
H Jung, L Kirousis, P Spirakis
Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989
941989
Elements of the theory of dynamic networks
O Michail, PG Spirakis
Communications of the ACM 61 (2), 72-72, 2018
932018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20