Abstract is missing.
- Universality and ToleranceNoga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. 14-21
- Extracting Randomness via Repeated CondensingOmer Reingold, Ronen Shaltiel, Avi Wigderson. 22-31
- Extracting Randomness from Samplable DistributionsLuca Trevisan, Salil P. Vadhan. 32-42
- Pseudorandom Generators in Propositional Proof ComplexityMichael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson. 43-53
- Random graph models for the web graphRavi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal. 57-65
- Optimization Problems in Congestion ControlRichard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker. 66-74
- On the Approximability of Trade-offs and Optimal Access of Web SourcesChristos H. Papadimitriou, Mihalis Yannakakis. 86-92
- How Bad is Selfish Routing?Tim Roughgarden, Éva Tardos. 93-102
- A polylogarithmic approximation of the minimum bisectionUriel Feige, Robert Krauthgamer. 105-115
- Approximability and in-approximability results for no-wait shop schedulingMaxim Sviridenko, Gerhard J. Woeginger. 116-125
- Nested Graph Dissection and Approximation AlgorithmsSudipto Guha. 126-135
- Approximating the single source unsplittable min-cost flow problemMartin Skutella. 136-145
- Hardness of Approximate Hypergraph ColoringVenkatesan Guruswami, Johan Håstad, Madhu Sudan. 149-158
- Soft-decision Decoding of Chinese Remainder CodesVenkatesan Guruswami, Amit Sahai, Madhu Sudan. 159-168
- Super-linear time-space tradeoff lower bounds for randomized computationPaul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. 169-179
- On the Hardness of Graph IsomorphismJacobo Torán. 180-186
- Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream ComputationPiotr Indyk. 189-197
- New Data Structures for Orthogonal Range SearchingStephen Alstrup, Gerth Stølting Brodal, Theis Rauhe. 198-207
- Nearly Optimal Expected-Case Planar Point LocationSunil Arya, Theocharis Malamatos, David M. Mount. 208-218
- On Levels in Arrangements of CurvesTimothy M. Chan. 219-227
- Detecting a Network FailureJon M. Kleinberg. 231-239
- Testing of ClusteringNoga Alon, Seannie Dar, Michal Parnas, Dana Ron. 240-250
- Testing of Functions that have small width Branching ProgramsIlan Newman. 251-258
- Testing that distributions are closeTugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White. 259-269
- Using Upper Confidence Bounds for Online LearningPeter Auer. 270-279
- Zaps and Their ApplicationsCynthia Dwork, Moni Naor. 283-293
- Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure ComputationYuval Ishai, Eyal Kushilevitz. 294-304
- Concurrent Oblivious TransferJuan A. Garay, Philip D. MacKenzie. 314-324
- The Relationship between Public Key Encryption and Oblivious TransferYael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan. 325-335
- The Online Median ProblemRamgopal R. Mettu, C. Greg Plaxton. 339-348
- Polynomial Time Approximation Schemes for Geometric k-ClusteringRafail Ostrovsky, Yuval Rabani. 349-358
- Clustering Data StreamsSudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O Callaghan. 359-366
- Fully Dynamic Transitive Closure: Breaking Through the O(n:::2:::) BarrierCamil Demetrescu, Giuseppe F. Italiano. 381-389
- Opportunistic Data Structures with ApplicationsPaolo Ferragina, Giovanni Manzini. 390-398
- Using Expander Graphs to Find Vertex ConnectivityHarold N. Gabow. 410-420
- On the boundary complexity of the union of fat trianglesJános Pach, Gábor Tardos. 423-431
- Straighting Polygonal Arcs and Convexifying Polygonal CyclesRobert Connelly, Erik D. Demaine, Günter Rote. 432-442
- A Combinatorial Approach to Planar Non-colliding Robot Arm Motion PlanningIleana Streinu. 443-453
- Topological Persistence and SimplificationHerbert Edelsbrunner, David Letscher, Afra Zomorodian. 454-463
- The Cover Time, the Blanket Time, and the Matthews BoundJeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu. 467-475
- The product replacement algorithm is polynomialIgor Pak. 476-485
- Efficient Algorithms for Universal PortfoliosAdam Kalai, Santosh Vempala. 486-491
- Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition MethodRussell A. Martin, Dana Randall. 492-502
- The Randomness Recycler: A New Technique for Perfect SamplingJames Allen Fill, Mark Huber. 503-511
- An Improved Quantum Fourier Transform Algorithm and ApplicationsLisa Hales, Sean Hallgren. 515-525
- Fast parallel circuits for the quantum Fourier transformRichard Cleve, John Watrous. 526-536
- Private Quantum ChannelsAndris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf. 547-553
- The Quantum Complexity of Set MembershipJaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh. 554-562
- Randomized Rumor SpreadingRichard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking. 565-574
- Fast Broadcasting and Gossiping in Radio NetworksMarek Chrobak, Leszek Gasieniec, Wojciech Rytter. 575-581
- Linear Waste of Best Fit Bin Packing on Skewed DistributionsClaire Kenyon, Michael Mitzenmacher. 582-589
- Optimal myopic algorithms for random 3-SATDimitris Achlioptas, Gregory B. Sorkin. 590-600
- Hierarchical Placement and Network Design ProblemsSudipto Guha, Adam Meyerson, Kamesh Munagala. 603-612
- Building Steiner Trees with Incomplete Global KnowledgeDavid R. Karger, Maria Minkoff. 613-623
- Cost-Distance: Two Metric Network DesignAdam Meyerson, Kamesh Munagala, Serge A. Plotkin. 624-630
- Combinatorial feature selection problemsMoses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai. 631-640
- The Common Fragment of CTL and LTLMonika Maidl. 643-652
- On the Existence of Booster TypesMaurice Herlihy, Eric Ruppert. 653-663
- Existential Second-Order Logic over Graphs: Charting the Tractability FrontierGeorg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. 664-674
- Computing the Determinant and Smith Form of an Integer MatrixWayne Eberly, Mark Giesbrecht, Gilles Villard. 675-685