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="Lebhar, Emmanuelle"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Local MST computation with short advice
Pierre Fraigniaud
,
Amos Korman
,
Emmanuelle Lebhar
Theory of Computing Systems
47
(4), 2010, pp. 920-933
A lower bound for network navigability
Pierre Fraigniaud
,
Emmanuelle Lebhar
,
Zvi Lotker
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 72-81
Recovering the long-range links in augmented graphs
Pierre Fraigniaud
,
Emmanuelle Lebhar
,
Zvi Lotker
Theoretical Computer Science
411
(14-15), 2010, pp. 1613-1625
Universal augmentation schemes for network navigability
Pierre Fraigniaud
,
Cyril Gavoille
,
Adrian Kosowski
,
Emmanuelle Lebhar
,
Zvi Lotker
Theoretical Computer Science
410
(21-23), 2009, pp. 1970-1981
Networks become navigable as nodes move and forget
Augustin Chaintreau
,
Pierre Fraigniaud
,
Emmanuelle Lebhar
Lecture Notes in Computer Science
5125
, 2008, pp. 133-144
Universal augmentation schemes for network navigability: Overcoming the
\sqrt n
-barrier
Pierre Fraigniaud
,
Cyril Gavoille
,
Adrian Kosowski
,
Emmanuelle Lebhar
,
Zvi Lotker
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 1-7
Local MST computation with short advice
Pierre Fraigniaud
,
Amos Korman
,
Emmanuelle Lebhar
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 154-160
Towards small world emergence
Philippe Duchon
,
Nicolas Hanusse
,
Emmanuelle Lebhar
,
Nicolas Schabanel
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. 225-232
Could any graph be turned into a small-world?
Philippe Duchon
,
Nicolas Hanusse
,
Emmanuelle Lebhar
,
Nicolas Schabanel
Theoretical Computer Science
355
(1), 2006, pp. 96-103
A doubling dimension threshold
\Theta (\log\log n)
for augmented graph navigability
Pierre Fraigniaud
,
Emmanuelle Lebhar
,
Zvi Lotker
Lecture Notes in Computer Science
4168
, 2006, pp. 376-386
Close to optimal decentralized routing in long-range contact networks
Emmanuelle Lebhar
,
Nicolas Schabanel
Theoretical Computer Science
348
(2-3), 2005, pp. 294-310
Almost optimal decentralized routing in long-range contact networks
Emmanuelle Lebhar
,
Nicolas Schabanel
Lecture Notes in Computer Science
3142
, 2004, pp. 894-905
A note on finding all homogeneous set sandwiches
Michel Habib
,
Emmanuelle Lebhar
,
Christophe Paul
Information Processing Letters
87
(3), 2003, pp. 147-151