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: Journal=J. Algorithms AND Volume=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Selecting the branches for an evolutionary tree: A polynomial time approximation scheme
Jonathan Badger
,
Paul Kearney
,
Ming Li
,
John Tsang
,
Tao Jiang
Journal of Algorithms
51
(1), 2004, pp. 1-14
Uniform consensus is harder than consensus
Bernadette Charron-Bost
,
André Schiper
Journal of Algorithms
51
(1), 2004, pp. 15-37
Tree exploration with little memory
Krzysztof Diks
,
Pierre Fraigniaud
,
Evangelos Kranakis
,
Andrzej Pelc
Journal of Algorithms
51
(1), 2004, pp. 38-63
Splay trees: A reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
George F. Georgakopoulos
Journal of Algorithms
51
(1), 2004, pp. 64-76
Parallel algorithms for
P
-comparability graphs
Stavros D. Nikolopoulos
,
Leonidas Palios
Journal of Algorithms
51
(1), 2004, pp. 77-104
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Magnus Wahlström
Journal of Algorithms
51
(2), 2004, pp. 107-121
Cuckoo hashing
Rasmus Pagh
,
Flemming Friche Rodler
Journal of Algorithms
51
(2), 2004, pp. 122-144
Establishing wireless conference calls under delay constraints
Amotz Bar-Noy
,
Grzegorz Malewicz
Journal of Algorithms
51
(2), 2004, pp. 145-169
Permuting in place: Analysis of two stopping rules
Alois Panholzer
,
Helmut Prodinger
,
Marko Riedel
Journal of Algorithms
51
(2), 2004, pp. 170-184
Circular arrangements and cyclic broadcast scheduling
Vincenzo Liberatore
Journal of Algorithms
51
(2), 2004, pp. 185-215