Volume 48,
Number 1,
January 2001
- Timothy M. Chan:
Dynamic planar convex hull operations in near-logarithmaic amortized time.
1-12
Electronic Edition (ACM DL) BibTeX
- Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson:
Adversarial queuing theory.
13-38
Electronic Edition (ACM DL) BibTeX
- Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg:
Universal-stability results and performance bounds for greedy contention-resolution protocols.
39-69
Electronic Edition (ACM DL) BibTeX
- David A. Basin, Harald Ganzinger:
Automated complexity analysis based on ordered resolution.
70-109
Electronic Edition (ACM DL) BibTeX
- John Case, Dayanand S. Rajan, Anil M. Shende:
Lattice computers for approximating Euclidean space.
110-144
Electronic Edition (ACM DL) BibTeX
- Jörg H. Siekmann, Graham Wrightson:
Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution.
145-147
Electronic Edition (ACM DL) BibTeX
Volume 48,
Number 2,
March 2001
Volume 48,
Number 3,
May 2001
Volume 48,
Number 4,
July 2001
- Adnan Darwiche:
Decomposable negation normal form.
608-647
Electronic Edition (ACM DL) BibTeX
- Nir Friedman, Joseph Y. Halpern:
Plausibility measures and default reasoning.
648-685
Electronic Edition (ACM DL) BibTeX
- Dorit S. Hochbaum:
An efficient algorithm for image segmentation, Markov random fields and related problems.
686-701
Electronic Edition (ACM DL) BibTeX
- Dan Boneh, Matthew K. Franklin:
Efficient generation of shared RSA keys.
702-722
Electronic Edition (ACM DL) BibTeX
- Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
723-760
Electronic Edition (ACM DL) BibTeX
- Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions.
761-777
Electronic Edition (ACM DL) BibTeX
- Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials.
778-797
Electronic Edition (ACM DL) BibTeX
- Johan Håstad:
Some optimal inapproximability results.
798-859
Electronic Edition (ACM DL) BibTeX
- Luca Trevisan:
Extractors and pseudorandom generators.
860-879
Electronic Edition (ACM DL) BibTeX
- Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong:
Logics with aggregate operators.
880-907
Electronic Edition (ACM DL) BibTeX
Volume 48,
Number 5,
September 2001
- Carlo Meghini, Fabrizio Sebastiani, Umberto Straccia:
A model of multimedia information retrieval.
909-970
Electronic Edition (ACM DL) BibTeX
- Alon Y. Halevy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli:
Static analysis in datalog extensions.
971-1012
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Eyal Dagan:
Improved implementations of binary universal operations.
1013-1037
Electronic Edition (ACM DL) BibTeX
- Timothy J. Hickey, Qun Ju, Maarten H. van Emden:
Interval arithmetic: From principles to implementation.
1038-1068
Electronic Edition (ACM DL) BibTeX
- Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling.
1069-1090
Electronic Edition (ACM DL) BibTeX
Volume 48,
Number 6,
November 2001
Copyright © Sun May 17 00:05:56 2009
by Michael Ley (ley@uni-trier.de)
