


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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.