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
Hilfe
Suche: Author="Gavoille, Cyril"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Ittai Abraham
,
Shiri Chechik
,
Cyril Gavoille
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 1199-1218
The stretch factor of
L_1
- and
L_{\infty}
-Delaunay triangulations
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
7501
, 2012, pp. 205-216
Sparse spanners vs. compact routing
Cyril Gavoille
,
Christian Sommer
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 225-234
Strong-diameter decompositions of minor free graphs
Ittai Abraham
,
Cyril Gavoille
,
Dahlia Malkhi
,
Udi Wiedr
Theory of Computing Systems
47
(4), 2010, pp. 837-855
Parameterized modal satisfiability
Antonis Achilleos
,
Michael Lampis
,
Valia Mitsou
Lecture Notes in Computer Science
6199
, 2010, pp. 369-380
How efficient can gossip be? (On the cost of resilient information exchange)
Dan Alistarh
,
Seth Gilbert
,
Rachid Guerraoui
,
Morteza Zadimoghaddam
Lecture Notes in Computer Science
6199
, 2010, pp. 115-126
Weak completeness notions for exponential time
Klaus Ambos-Spies
,
Timur Bakibayev
Lecture Notes in Computer Science
6198
, 2010, pp. 503-514
Cycle detection and correction
Amihood Amir
,
Estrella Eisenberg
,
Avivit Levy
,
Ely Porat
,
Natalie Shapira
Lecture Notes in Computer Science
6198
, 2010, pp. 43-54
Online network design with outliers
Aris Anagnostopoulos
,
Fabrizio Grandoni
,
Stefano Leonardi
,
Piotr Sankowski
Lecture Notes in Computer Science
6198
, 2010, pp. 114-126
From secrecy to soundness: Efficient verification via secure computation
Benny Applebaum
,
Yuval Ishai
,
Eyal Kushilevitz
Lecture Notes in Computer Science
6198
, 2010, pp. 152-163
Mean-payoff games and propositional proofs
Albert Atserias
,
Elitza Maneva
Lecture Notes in Computer Science
6198
, 2010, pp. 102-113
Metrical task systems and the
k
-server problem on HSTs
Nikhil Bansal
,
Niv Buchbinder
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
6198
, 2010, pp. 287-298
Approximation algorithms for diversified search ranking
Nikhil Bansal
,
Kamal Jain
,
Anna Kazeykina
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
6199
, 2010, pp. 273-284
Inapproximability of hypergraph vertex cover and applications to scheduling problems
Nikhil Bansal
,
Subhash Khot
Lecture Notes in Computer Science
6198
, 2010, pp. 250-261
Better scalable algorithms for broadcast scheduling
Nikhil Bansal
,
Ravishankar Krishnaswamy
,
Viswanath Nagarajan
Lecture Notes in Computer Science
6198
, 2010, pp. 324-335
The cooperative game theory foundations of network bargaining games
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Nicole Immorlica
,
Hamid Mahini
Lecture Notes in Computer Science
6198
, 2010, pp. 67-78
Choosing, agreeing, and eliminating in communication complexity
Amos Beimel
,
Sebastian Ben Daniel
,
Eyal Kushilevitz
,
Enav Weinreb
Lecture Notes in Computer Science
6198
, 2010, pp. 451-462
Efficient information exchange in the random phone-call model
Petra Berenbrink
,
Jurek Czyzowicz
,
Robert Elsässer
,
Leszek Ga̧sieniec
Lecture Notes in Computer Science
6199
, 2010, pp. 127-138
On approximate Horn formula minimization
Amitava Bhattacharya
,
Bhaskar DasGupta
,
Dhruv Mubayi
,
György Turán
Lecture Notes in Computer Science
6198
, 2010, pp. 438-450
Covering and packing in linear space
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Lecture Notes in Computer Science
6198
, 2010, pp. 727-737
The serializability of network codes
Anna Blasiak
,
Robert Kleinberg
Lecture Notes in Computer Science
6199
, 2010, pp. 100-114
Resolving the complexity of some data privacy problems
Jeremiah Blocki
,
Ryan Williams
Lecture Notes in Computer Science
6199
, 2010, pp. 393-404
On
LR(k)
-parsers of polynomial size
Norbert Blum
Lecture Notes in Computer Science
6199
, 2010, pp. 163-174
Efficient evaluation of nondeterministic automata using factorization forests
Mikoƚaj Bojańczyk
,
Paweƚ Parys
Lecture Notes in Computer Science
6198
, 2010, pp. 515-526
Alternation removal in Büchi automata
Udi Boker
,
Orna Kupferman
,
Adin Rosenberg
Lecture Notes in Computer Science
6199
, 2010, pp. 76-87
Seiten 1
2
3
4
5
6
7
>