Journal of Algorithms
, Volume 36
Volume 36, Number 1, July 2000
Randeep Bhatia
,
Samir Khuller
,
Joseph Naor
: The Loading Time Scheduling Problem. 1-33
BibTeX
Amihood Amir
,
Gruia Calinescu
: Alphabet-Independent and Scaled Dictionary Matching. 34-62
BibTeX
Rolf Niedermeier
,
Peter Rossmanith
: New Upper Bounds for Maximum Satisfiability. 63-88
BibTeX
Hans Jürgen Prömel
,
Angelika Steger
: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. 89-101
BibTeX
Cyril Allauzen
,
Mathieu Raffinot
: Simple Optimal String Matching Algorithm. 102-116
BibTeX
Volume 36, Number 2, August 2000
Jeannette Janssen
,
Danny Krizanc
,
Lata Narayanan
,
Sunil M. Shende
: Distributed Online Frequency Assignment in Cellular Networks. 119-151
BibTeX
Rakesh D. Barve
,
Mahesh Kallahalla
,
Peter J. Varman
,
Jeffrey Scott Vitter
: Competitive Parallel Disk Prefetching and Buffer Management. 152-181
BibTeX
Bang Ye Wu
,
Kun-Mao Chao
,
Chuan Yi Tang
: A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. 182-204
BibTeX
Elias Dahlhaus
: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. 205-240
BibTeX
Igor Shparlinski
: Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. 241-252
BibTeX
Frédéric Havet
: Finding an Oriented Hamiltonian Path in a Tournament. 253-275
BibTeX
Copyright ©
Sun May 17 00:06:09 2009 by
Michael Ley
(
ley@uni-trier.de
)