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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Load balancing for response time
Jeffery Westbrook
Journal of Algorithms
35
(1), 2000, pp. 1-16
On Markov chains for independent sets
Martin Dyer
,
Catherine Greenhill
Journal of Algorithms
35
(1), 2000, pp. 17-49
A faster implementation of a parallel tree contraction scheme and its application on distance-hereditary graphs
Sun-yuan Hsieh
,
Chin-wen Ho
,
Tsan-sheng Hsu
,
Ming-Tat Ko
,
Gen-Huey Chen
Journal of Algorithms
35
(1), 2000, pp. 50-81
Pattern matching in hypertext
Amihood Amir
,
Moshe Lewenstein
,
Noa Lewenstein
Journal of Algorithms
35
(1), 2000, pp. 82-99
A loopless Gray-code algorithm for listing
k
-ary trees
Dominique Roelants van Baronaigien
Journal of Algorithms
35
(1), 2000, pp. 100-107
On-line load balancing for related machines
Piotr Berman
,
Moses Charikar
,
Marek Karpinski
Journal of Algorithms
35
(1), 2000, pp. 108-121
Processor efficient parallel solution of linear systems of equations
Gilles Villard
Journal of Algorithms
35
(1), 2000, pp. 122-126
Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology
Norbert Blum
Journal of Algorithms
35
(2), 2000, pp. 129-168
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Stephen Alstrup
,
Mikkel Thorup
Journal of Algorithms
35
(2), 2000, pp. 169-188
Floats, integers, and single source shortest paths
Mikkel Thorup
Journal of Algorithms
35
(2), 2000, pp. 189-201
On four-connecting a triconnected graph
Tsan-sheng Hsu
Journal of Algorithms
35
(2), 2000, pp. 202-234
A polynomial-time algorithm for finding regular simple paths in outerplanar graphs
Zhivko P. Nedev
,
Peter T. Wood
Journal of Algorithms
35
(2), 2000, pp. 235-259