Æȷοì
Paul Spirakis
Paul Spirakis
Professor of Computer Science U. Liverpool and U. Patras
liverpool.ac.ukÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
Weighted random sampling with a reservoir
PS Efraimidis, PG Spirakis
Information processing letters 97 (5), 181-185, 2006
4002006
Coordinating pebble motion on graphs, the diameter of permutation groups, and applications
DM Kornhauser
3611984
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
2992002
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
2391995
Selfish unsplittable flows
D Fotakis, S Kontogiannis, P Spirakis
Theoretical Computer Science 348 (2-3), 226-239, 2005
2202005
Efficient robust parallel computations
ZM Kedem, KV Palem, PG Spirakis
Proceedings of the twenty-second annual ACM symposium on Theory of Computing ¡¦, 1990
1681990
Approximate equilibria and ball fusion
E Koutsoupias, M Mavronicolas, P Spirakis
Theory of Computing Systems 36 (6), 683-693, 2003
1622003
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
1621999
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
1472005
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
1261991
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
Mediated population protocols
O Michail, I Chatzigiannakis, PG Spirakis
Theoretical Computer Science 412 (22), 2434-2450, 2011
120*2011
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
1192003
Traveling salesman problems in temporal graphs
O Michail, PG Spirakis
Theoretical Computer Science 634, 1-23, 2016
1172016
Strong NP-hardness of moving many discs
P Spirakis, CK Yap
Information Processing Letters 19 (1), 55-59, 1984
1091984
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
1072017
Elements of the theory of dynamic networks
O Michail, PG Spirakis
Communications of the ACM 61 (2), 72-72, 2018
922018
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
921989
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20