Table of Contents

• A randomized linear-time algorithm for finding minimum spanning treesPhilip N. Klein, Robert Endre Tarjan. 9-15 [doi]
• Polylog-time and near-linear work approximation scheme for undirected shortest pathsEdith Cohen. 16-26 [doi]
• Faster shortest-path algorithms for planar graphsPhilip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian. 27-37 [doi]
• On the complexity of negation-limited Boolean networksKeisuke Tanaka, Tetsuro Nishino. 38-47 [doi]
• On the computational power of depth 2 circuits with threshold and modulo gatesMatthias Krause, Pavel Pudlák. 48-57 [doi]
• Circuit complexity: from the worst case to the average caseAndreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer. 58-67 [doi]
• On point location and motion planning among simplicesMarco Pellegrini. 95-104 [doi]
• On lazy randomized incremental constructionMark de Berg, Katrin Dobrindt, Otfried Schwarzkopf. 105-114 [doi]
• On the fault tolerance of the butterflyAnna R. Karlin, Greg Nelson, Hisao Tamaki. 125-133 [doi]
• Efficient routing in all-optical networksPrabhakar Raghavan, Eli Upfal. 134-143 [doi]
• Scalable expanders: exploiting hierarchical random wiringEric A. Brewer, Frederic T. Chong, Tom Leighton. 144-152 [doi]
• On contention resolution protocols and associated probabilistic phenomenaPhilip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman. 153-162 [doi]
• The minimum latency problemAvrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan. 163-171 [doi]
• Two prover protocols: low error at affordable ratesUriel Feige, Joe Kilian. 172-183 [doi]
• Improved non-approximability resultsMihir Bellare, Madhu Sudan. 184-193 [doi]
• Nearly-linear size holographic proofsAlexander Polishchuk, Daniel A. Spielman. 194-203 [doi]
• Natural proofsAlexander A. Razborov, Steven Rudich. 204-213 [doi]
• Efficient asynchronous distributed symmetry breakingBaruch Awerbuch, Lenore Cowen, Mark A. Smith. 214-223 [doi]
• Time bounds for mutual exclusion and related problemsJae-Heon Yang, James H. Anderson. 224-233 [doi]
• Simple and efficient leader election in the full information modelRafail Ostrovsky, Sridhar Rajagopalan, Umesh V. Vazirani. 234-242 [doi]
• A simple constructive computability theorem for wait-free computationMaurice Herlihy, Nir Shavit. 243-252 [doi]
• Weakly learning DNF and characterizing statistical query learning using Fourier analysisAvrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich. 253-262 [doi]
• Simulating access to hidden information while learningPeter Auer, Philip M. Long. 263-272 [doi]
• On the learnability of discrete distributionsMichael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie. 273-282 [doi]
• Choosing a learning team: a topological approachKalvis Apsitis, Rusins Freivalds, Carl H. Smith. 283-289 [doi]
• Optimal parallel suffix tree constructionRamesh Hariharan. 290-299 [doi]
• Symmetry breaking for suffix tree constructionSüleyman Cenk Sahinalp, Uzi Vishkin. 300-309 [doi]
• Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)S. Rao Kosaraju. 310-316 [doi]
• The complexity of searching a sorted array of stringsArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson. 317-325 [doi]
• Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphsNoga Alon, Raphael Yuster, Uri Zwick. 326-335 [doi]
• A spectral technique for coloring random 3-colorable graphs (preliminary version)Noga Alon, Nabil Kahale. 346-355 [doi]
• Pseudorandomness for network algorithmsRussell Impagliazzo, Noam Nisan, Avi Wigderson. 356-364 [doi]
• The complexity of verificationRobert P. Kurshan. 365-371 [doi]
• Trade-offs between communication throughput and parallel timeYishay Mansour, Noam Nisan, Uzi Vishkin. 372-381 [doi]
• Optimal parallel string algorithms: sorting, merging and computing the minimumTorben Hagerup. 382-391 [doi]
• The computational complexity of recognizing permutation functionsKeju Ma, Joachim von zur Gathen. 392-401 [doi]
• Low degree spanning trees of small weightSamir Khuller, Balaji Raghavachari, Neal E. Young. 412-421 [doi]
• .879-approximation algorithms for MAX CUT and MAX 2SATMichel X. Goemans, David P. Williamson. 422-431 [doi]
• Greed is good: approximating independent sets in sparse and bounded-degree graphsMagnús M. Halldórsson, Jaikumar Radhakrishnan. 439-448 [doi]
• Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani. 459-467 [doi]
• Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. 468-477 [doi]
• Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networksBaruch Awerbuch, Tom Leighton. 487-496 [doi]
• An accelerated interior point method whose running time depends only on A (extended abstract)Stephen A. Vavasis, Yinyu Ye. 512-521 [doi]
• How to share a function securelyAlfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung. 522-533 [doi]
• Computational complexity and knowledge complexity (extended abstract)Oded Goldreich, Rafail Ostrovsky, Erez Petrank. 534-543 [doi]
• Receipt-free secret-ballot elections (extended abstract)Josh Cohen Benaloh, Dwight Tuinstra. 544-553 [doi]
• A minimal model for secure computation (extended abstract)Uriel Feige, Joe Kilian, Moni Naor. 554-563 [doi]
• Improved algorithms via approximations of probability distributions (extended abstract)Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan. 584-592 [doi]
• Balanced allocations (extended abstract)Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal. 593-602 [doi]
• Decision tree complexity and Betti numbersAndrew Chi-Chih Yao. 615-624 [doi]
• Lower bounds for union-split-find related problems on random access machinesPeter Bro Miltersen. 625-634 [doi]
• Lower bounds on testing membership to a polyhedron by algebraic decision treesDima Grigoriev, Marek Karpinski, Nicolai Vorobjov. 635-644 [doi]
• Random sampling in cut, flow, and network design problemsDavid R. Karger. 648-657 [doi]
• Two heads are better than two tapesTao Jiang, Joel I. Seiferas, Paul M. B. Vitányi. 668-675 [doi]
• On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson. 676-685 [doi]
• Improved data structures for fully dynamic biconnectivityMonika Rauch. 686-695 [doi]
• Efficient splitting off algorithms for graphsHarold N. Gabow. 696-705 [doi]
• Alpha-algorithms for incremental planarity testing (preliminary version)Johannes A. La Poutré. 706-715 [doi]
• The connectivity carcass of a vertex subset in a graph and its incremental maintenanceYefim Dinitz, Alek Vainshtein. 716-725 [doi]
• On complexity as bounded rationality (extended abstract)Christos H. Papadimitriou, Mihalis Yannakakis. 726-733 [doi]
• Optimality and domination in repeated games with bounded playersLance Fortnow, Duke Whang. 741-749 [doi]
• Fast algorithms for finding randomized strategies in game treesDaphne Koller, Nimrod Megiddo, Bernhard von Stengel. 750-759 [doi]
• Aligning sequences via an evolutionary tree: complexity and approximationTao Jiang, Eugene L. Lawler, Lusheng Wang. 760-769 [doi]
• Non-standard stringology: algorithms and complexityS. Muthukrishnan, Krishna V. Palem. 770-779 [doi]
• A functional equation often arising in the analysis of algorithms (extended abstract)Philippe Jacquet, Wojciech Szpankowski. 780-789 [doi]
• A coding theorem for distributed computationSridhar Rajagopalan, Leonard J. Schulman. 790-799 [doi]
• Time-adaptive algorithms for synchronizationRajeev Alur, Hagit Attiya, Gadi Taubenfeld. 800-809 [doi]
• A theory of clock synchronization (extended abstract)Boaz Patt-Shamir, Sergio Rajsbaum. 810-819 [doi]
• Efficient probabilistic checkable proofs and applications to approximationMihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell. 820 [doi]