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=36
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