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 YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The loading time scheduling problem
Randeep Bhatia
,
Samir Khuller
,
Joseph (Seffi) Naor
Journal of Algorithms
36
(1), 2000, pp. 1-33
Alphabet-independent and scaled dictionary matching
Amihood Amir
,
Gruia Gălinescu
Journal of Algorithms
36
(1), 2000, pp. 34-62
New upper bounds for maximum satisfiability
Rolf Niedermeier
,
Peter Rossmanith
Journal of Algorithms
36
(1), 2000, pp. 63-88
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Hans Jürgen Prömel
,
Angelika Steger
Journal of Algorithms
36
(1), 2000, pp. 89-101
Simple optimal string matching algorithm
Cyril Allauzen
,
Mathieu Rafinot
Journal of Algorithms
36
(1), 2000, pp. 102-116
Distributed online frequency assignment in cellular networks
Jeannette Janssen
,
Danny Krizanc
,
Lata Narayanan
,
Sunil Shende
Journal of Algorithms
36
(2), 2000, pp. 119-151
Competitive parallel disk prefetching and buffer management
Rakesh Barve
,
Mahesh Kallahalla
,
Peter J. Varman
,
Jeffrey Scott Vitter
Journal of Algorithms
36
(2), 2000, pp. 152-181
A polynomial time approximation scheme for optimal product-requirement communication spanning trees
Bang Ye Wu
,
Kun-Mao Chao
,
Chuan Yi Tang
Journal of Algorithms
36
(2), 2000, pp. 182-204
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition
Elias Dahlhaus
Journal of Algorithms
36
(2), 2000, pp. 205-240
Computing Jacobi symbols modulo sparse integers and polynomials and some applications
Igor E. Shparlinski
Journal of Algorithms
36
(2), 2000, pp. 241-252
Finding an oriented Hamiltonian path in a tournament
Frédéric Havet
Journal of Algorithms
36
(2), 2000, pp. 253-275
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
Simple optimal parallel multiple pattern matching
S. Muthukrishnan
Journal of Algorithms
34
(1), 2000, pp. 1-13
Polynomial-time analysis of toroidal periodic graphs
F. Höfting
,
E. Wanke
Journal of Algorithms
34
(1), 2000, pp. 14-39
Seiten
<
1
2
3
>