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=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal randomized EREW PRAM algorithms for finding spanning forests
Shay Halperin
,
Uri Zwick
Journal of Algorithms
39
(1), 2001, pp. 1-46
Fault-tolerant broadcasting in radio networks
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
Journal of Algorithms
39
(1), 2001, pp. 47-67
A simple algorithm for the planar multiway cut problem
Wei-Chang Yeh
Journal of Algorithms
39
(1), 2001, pp. 68-77
Approximating layout problems on random geometric graphs
Josep Díaz
,
Mathew D. Penrose
,
Jordi Petit
,
María Serna
Journal of Algorithms
39
(1), 2001, pp. 78-116
On Markov chains for randomly
H
-coloring a graph
Colin Cooper
,
Martin Dyer
,
Alan Frieze
Journal of Algorithms
39
(1), 2001, pp. 117-134
Using homogeneous weights for approximating the partial cover problem
Reuven Bar-Yehuda
Journal of Algorithms
39
(2), 2001, pp. 137-144
A lower bound for elementary oblivious routing on three-dimensional meshes
Kazuo Iwama
,
Eiji Miyano
Journal of Algorithms
39
(2), 2001, pp. 145-161
A new way of using semidefinite programming with applications to linear equations mod
p
Gunnar Andersson
,
Lars Engebretsen
,
Johan Håstad
Journal of Algorithms
39
(2), 2001, pp. 162-204
Space efficient suffix trees
J. Ian Munro
,
Venkatesh Raman
,
S. Srinivasa Rao
Journal of Algorithms
39
(2), 2001, pp. 205-222
Greedy local improvement and weighted set packing approximation
Barun Chandra
,
Magnús M. Haldórsson
Journal of Algorithms
39
(2), 2001, pp. 223-240