default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 63
Volume 63, Number 1, August 2001
- Fan Chung Graham:
Editor's Foreword. 1 - Jon M. Kleinberg, Yuval Rabani
, Éva Tardos:
Fairness in Routing and Load Balancing. 2-20 - Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker:
Sharing the Cost of Multicast Transmissions. 21-41 - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis. 42-61 - Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Combining Fairness with Throughput: Online Routing with Multiple Objectives. 62-79 - Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker:
The Combinatorics of Cache Misses during Matrix Multiplication. 80-126 - Micah Adler, Frank Thomson Leighton:
Compression Using Efficient Multicasting. 127-145
Volume 63, Number 2, September 2001
- Pavel Pudlák:
Gust Editor's Foreword. 147 - Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection. 148-185 - 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 - André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity. 201-221 - Oliver Giel:
Branching Program Size Is Almost Linear in Formula Size. 222-235 - Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. 236-252 - Ketan Mulmuley, Pradyut Shah:
A Lower Bound for the Shortest Path Problem. 253-267 - Iannis Tourlakis:
Time-Space Tradeoffs for SAT on Nonuniform Machines. 268-287 - Ke Yang:
Integer Circuit Evaluation Is PSPACE-Complete. 288-303
Volume 63, Number 3, November 2001
- Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. 305-354 - Sanjay Gupta, R. K. P. Zia:
Quantum Neural Networks. 355-383 - Hing Leung:
Tight Lower Bounds on the Size of Sweeping Automata. 384-393 - Nicolas Bedon:
Logic over Words on Denumerable Ordinals. 394-431 - Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross:
Distance Realization Problems with Applications to Internet Tomography. 432-448 - Satyanarayana V. Lokam:
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. 449-473 - David Peleg, Eilon Reshef:
Low Complexity Variants of the Arrow Distributed Directory. 474-485 - Jay Sethuraman, Chung-Piaw Teo:
A Polynomial-time Algorithm for the Bistable Roommates Problem. 486-497 - Johan Håstad:
A Slight Sharpening of LMN. 498-508
Volume 63, Number 4, December 2001
- Rajeev Motwani:
Guest Editor's Foreword. 511 - Russell Impagliazzo, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? 512-530 - Wenceslas Fernandez de la Vega, Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT. 531-541 - Paul Beame, T. S. Jayram, Michael E. Saks:
Time-Space Tradeoffs for Branching Programs. 542-572 - Micah Adler, Bruce M. Maggs:
Protocols for Asymmetric Communication Channels. 573-596 - Christopher Umans:
The Minimum Equivalent DNF Problem and Shortest Implicants. 597-611 - Alexander Russell, David Zuckerman:
Perfect Information Leader Election in log* n+O (1) Rounds. 612-626 - Piotr Indyk:
On Approximate Nearest Neighbors under linfinity Norm. 627-638 - Uriel Feige, Joe Kilian:
Heuristics for Semirandom Graph Problems. 639-671 - Russell Impagliazzo, Avi Wigderson:
Randomness vs Time: Derandomization under a Uniform Assumption. 672-688
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.
last updated on 2025-05-06 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
