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.G."
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
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
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
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
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
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
D. Kavvadias
,
G.E. Pantziou
,
P.G. Spirakis
,
Ch.D. Zaroliagis
Lecture Notes in Computer Science
841
, 1994, pp. 462-472
Resilient parallel computing on unreliable parallel machines
Z.M. Kedem
,
K.V. Palem
,
A. Raghunathan
,
P.G. Spirakis
Lectures on Parallel Computation
Cambridge International Series on Parallel Computation 4
, 1993, pp. 149-176
On the limitation of the global time assumption in distributed systems
Uri Abraham
,
Shai Ben-David
,
Shlomo Moran
Lecture Notes in Computer Science
579
, 1992, pp. 1-8
Causal memory
Mustaque Ahamad
,
James E. Burns
,
Phillip W. Hutto
,
Gil Neiger
Lecture Notes in Computer Science
579
, 1992, pp. 9-30
More on the power of random walks: Uniform self-stabilizing randomized algorithms
Efthymios Anagnostou
,
Ran El-Yaniv
Lecture Notes in Computer Science
579
, 1992, pp. 31-51
Pseudo read-modify-write operations: Bounded wait-free implementations
James H. Anderson
,
Bojan GrosĖelj
Lecture Notes in Computer Science
579
, 1992, pp. 52-70
Maintaining digital clocks in step
Anish Arora
,
Shlomi Dolev
,
Mohamed Gouda
Lecture Notes in Computer Science
579
, 1992, pp. 71-79
Implementing FIFO queues and stacks
Hagit Attiya
Lecture Notes in Computer Science
579
, 1992, pp. 80-94
Optimal amortized distributed consensus
Amotz Bar-Noy
,
Xiaotie Deng
,
Juan A. Garay
,
Tiko Kameda
Lecture Notes in Computer Science
579
, 1992, pp. 95-107
Optimally simulating crash failures in a Byzantine environment
Rida Bazzi
,
Gil Neiger
Lecture Notes in Computer Science
579
, 1992, pp. 108-128
Efficient distributed consensus with
n = (3 + \varepsilon)t
processors
Piotr Berman
,
Juan A. Garay
Lecture Notes in Computer Science
579
, 1992, pp. 129-142
Randomized consensus in expected
O(n^2 \log n)
operations
Gabi Bracha
,
Ophir Rachman
Lecture Notes in Computer Science
579
, 1992, pp. 143-150
Using adaptive timeouts to achieve at-most-once message delivery
Choma Chaudhuri
,
Brian A. Coan
,
Jennifer L. Welch
Lecture Notes in Computer Science
579
, 1992, pp. 151-166
Seiten 1
2
>