Volume 21, Issue 4 | Algorithmica

Search all Algorithmica articles

Volume 21, Issue 4

August 1998

Filter by

Volume:

Sort by

Date published:

New to old Old to new

4 articles in this issue

Computing Betti Numbers via Combinatorial Laplacians
J. Friedman
Pages: 331 - 346
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms
I. Ben-Aroya
D. D. Chinn
A. Schuster
Pages: 347 - 376
On Certificates and Lookahead in Dynamic Graph Problems
S. Khanna
R. Motwani
R. H. Wilson
Pages: 377 - 394
Approximating Biconnectivity in Parallel
Ka Wong Chong
Tak Wah Lam
Pages: 395 - 410