JCSS,
Volume 63
Volume 63,
Number 1,
August 2001
- Fan Chung Graham:
Editor's Foreword.
1 BibTeX
- Jon M. Kleinberg, Yuval Rabani, Éva Tardos:
Fairness in Routing and Load Balancing.
2-20 BibTeX
- Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker:
Sharing the Cost of Multicast Transmissions.
21-41 BibTeX
- Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis.
42-61 BibTeX
- Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Combining Fairness with Throughput: Online Routing with Multiple Objectives.
62-79 BibTeX
- Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker:
The Combinatorics of Cache Misses during Matrix Multiplication.
80-126 BibTeX
- Micah Adler, Frank Thomson Leighton:
Compression Using Efficient Multicasting.
127-145 BibTeX
Volume 63,
Number 2,
September 2001
- Pavel Pudlák:
Gust Editor's Foreword.
147 BibTeX
- Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection.
148-185 BibTeX
- David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie:
On the Complexity of Some Problems on Groups Input as Multiplication Tables.
186-200 BibTeX
- André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity.
201-221 BibTeX
- Oliver Giel:
Branching Program Size Is Almost Linear in Formula Size.
222-235 BibTeX
- Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error.
236-252 BibTeX
- Ketan Mulmuley, Pradyut Shah:
A Lower Bound for the Shortest Path Problem.
253-267 BibTeX
- Iannis Tourlakis:
Time-Space Tradeoffs for SAT on Nonuniform Machines.
268-287 BibTeX
- Ke Yang:
Integer Circuit Evaluation Is PSPACE-Complete.
288-303 BibTeX
Volume 63,
Number 3,
November 2001
Volume 63,
Number 4,
December 2001
Copyright © Sun May 17 00:08:15 2009
by Michael Ley (ley@uni-trier.de)
