Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Spirakis, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the structure of equilibria in basic network formation
S. Nikoletseas
,
P. Panagopoulou
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
590
, 2015, pp. 96-105
On the independence number and Hamiltonicity of uniform random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
412
(48), 2011, pp. 6750-6760
Atomic congestion games: Fast, myopic and concurrent
D. Fotakis
,
A.C. Kaporis
,
P.G. Spirakis
Theory of Computing Systems
47
(1), 2010, pp. 38-59
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
A.C. Kaporis
,
P.G. Spirakis
Theoretical Computer Science
410
(8-10), 2009, pp. 745-755
Expander properties and the cover time of random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
410
(50), 2009, pp. 5261-5272
Large independent sets in general random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P. Spirakis
Theoretical Computer Science
406
(3), 2008, pp. 215-224
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
A.C. Kaporis
,
P.G. Spirakis
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 19-28
Radiocoloring in planar graphs: Complexity and approximations
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Theoretical Computer Science
340
(3), 2005, pp. 514-538
Structure and complexity of extreme nash equilibria
M. Gairing
,
T. Lücking
,
M. Mavronicolas
,
B. Monien
,
P. Spirakis
Theoretical Computer Science
343
(1-2), 2005, pp. 133-157
Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs
C. Raptopoulos
,
P. Spirakis
Lecture Notes in Computer Science
3827
, 2005, pp. 493-504
A hierarchical adaptive distributed algorithm for load balancing
K. Antonis
,
J. Garofalakis
,
I. Mourtos
,
P. Spirakis
Journal Parallel Distributed Computing
64
(1), 2004, pp. 151-162
The existence and efficient construction of large independent sets in general random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P. Spirakis
Lecture Notes in Computer Science
3142
, 2004, pp. 1029-1040
On the robustness of interconnections in random graphs: A symbolic approach
P. Flajolet
,
K. Hatzis
,
S. Nikoletseas
,
P. Spirakis
Theoretical Computer Science
287
(2), 2002, pp. 515-534
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
2573
, 2002, pp. 223-234
Minimum congestion redundant assignments to tolerate random faults
D.A. Fotakis
,
P.G. Spirakis
Algorithmica
32
(3), 2002, pp. 396-422
Efficient scheduling of strict multithreaded computations
P. Fatourou
,
P. Spirakis
Theory of Computing Systems
33
(3), 2000, pp. 173-232
NP
-completeness results and efficient approximations for radiocoloring in planar graphs
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
1893
, 2000, pp. 363-372
Robust parallel computations through randomization
S.C. Kontogiannis
,
G.E. Pantziou
,
P.G. Spirakis
,
M. Yung
Theory of Computing Systems
33
(5-6), 2000, pp. 427-464
Connectivity properties in random regular graphs with edge faults
S. Nikoletseas
,
K. Palem
,
P. Spirakis
,
M. Yung
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 247-262
Efficient communication establishment in adverse communication environments
S. Nikoletseas
,
P. Spirakis
Proceedings in Informatics
8
, 2000, pp. 215-226
BSP versus LogP
G. Bilardi
,
K.T. Herley
,
A. Pietracaprina
,
G. Pucci
,
P. Spirakis
Algorithmica
24
(3-4), 1999, pp. 405-421
Counting in mobile networks: Theory and experimentation
K. Hatzis
,
G. Pentaris
,
P. Spirakis
,
B. Tampakas
Lecture Notes in Computer Science
1668
, 1999, pp. 95-109
Optimal high-performance parallel text retrieval via fat-trees
B. Mamalis
,
P. Spirakis
,
B. Tampakas
Theory of Computing Systems
32
(6), 1999, pp. 591-623
On the random generation and counting of matchings in dense graphs
J. Diaz
,
M. Serna
,
P. Spirakis
Theoretical Computer Science
201
(1-2), 1998, pp. 281-290
A general performance model for multistage interconnection networks
C.J. Bouras
,
J.D. Garofalakis
,
P.G. Spirakis
,
V.D. Triantafillou
Lecture Notes in Computer Science
1300
, 1997, pp. 993-1000
Seiten 1
2
3
4
5
>