Abstract is missing.
- Some Optimal Inapproximability ResultsJohan Håstad. 1-10 [doi]
- A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint SatisfactionSanjeev Khanna, Madhu Sudan, David P. Williamson. 11-20 [doi]
- When Hamming Meets Euclid: The Approximability of Geometric TSP and MST (Extended Abstract)Luca Trevisan. 21-29 [doi]
- Approximate Complex Polynomial Evaluation in Near Constant Work Per PointJohn H. Reif. 30-39 [doi]
- Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic IntegersJoe Buhler, Mohammad Amin Shokrollahi, Volker Stemann. 40-47 [doi]
- General Techniques for Comparing Unrooted Evolutionary TreesMing-Yang Kao, Tak Wah Lam, Teresa M. Przytycka, Wing-Kin Sung, Hing-Fung Ting. 54-65 [doi]
- Tree Pattern Matching and Subset Matching in Randomized O(n log:::3:::m) TimeRichard Cole, Ramesh Hariharan. 66-75 [doi]
- Randomized Omega(n:::2:::) Lower Bound for KnapsackDima Grigoriev, Marek Karpinski. 76-85 [doi]
- Exponential Lower Bounds for Depth 3 Boolean CircuitsRamamohan Paturi, Michael E. Saks, Francis Zane. 86-91 [doi]
- Approximating Total Flow Time on Parallel MachinesStefano Leonardi, Danny Raz. 110-119 [doi]
- Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract)Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng. 120-129 [doi]
- Better Bounds for Online SchedulingSusanne Albers. 130-139 [doi]
- Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract)Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein. 140-149 [doi]
- Practical Loss-Resilient CodesMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann. 150-159 [doi]
- Spectral Techniques for Expander CodesJohn D. Lafferty, Daniel N. Rockmore. 160-167 [doi]
- Faster Solution of the Key Equation for Decoding BCH Error-Correcting CodesVictor Y. Pan. 168-175 [doi]
- Fault-Tolerant Quantum Computation With Constant ErrorDorit Aharonov, Michael Ben-Or. 176-188 [doi]
- On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract)Moni Naor, Omer Reingold. 189-199 [doi]
- Reducing Randomness via Irrational NumbersZhi-Zhong Chen, Ming-Yang Kao. 200-209 [doi]
- ::::P = BPP:::: if ::::E:::: Requires Exponential Circuits: Derandomizing the XOR LemmaRussell Impagliazzo, Avi Wigderson. 220-229 [doi]
- SL <= L:::4/3:::Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou. 230-239 [doi]
- Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected GraphsDavid R. Karger. 240-249 [doi]
- Combinatorial Complexity of the Central CurvePeter A. Beling, Sushil Verma. 250-255 [doi]
- Approximation of ::::k::::-Set Cover by Semi-Local OptimizationRong-chii Duh, Martin Fürer. 256-264 [doi]
- Approximation Algorithms for Facility Location Problems (Extended Abstract)David B. Shmoys, Éva Tardos, Karen Aardal. 265-274 [doi]
- Covering Points in the Plane by ::::k::::-Tours: Towards a Polynomial Time Approximation Scheme for General ::::k::::Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. 275-283 [doi]
- A Public-Key Cryptosystem with Worst-Case/Average-Case EquivalenceMiklós Ajtai, Cynthia Dwork. 284-293 [doi]
- Private Information Storage (Extended Abstract)Rafail Ostrovsky, Victor Shoup. 294-303 [doi]
- Computationally Private Information Retrieval (Extended Abstract)Benny Chor, Niv Gilboa. 304-313 [doi]
- Approximating Hyper-Rectangles: Learning and Pseudo-Random SetsPeter Auer, Philip M. Long, Aravind Srinivasan. 314-323 [doi]
- A Composition Theorem for Learning Algorithms with Applications to Geometric Concept ClassesShai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. 324-333 [doi]
- Using and Combining Predictors That SpecializeYoav Freund, Robert E. Schapire, Yoram Singer, Manfred K. Warmuth. 334-343 [doi]
- On-Line Algorithms for Steiner Tree Problems (Extended Abstract)Piotr Berman, Chris Coulston. 344-353 [doi]
- Online Algorithms for Selective Multicast and Maximal Dense TreesBaruch Awerbuch, Tripurari Singh. 354-362 [doi]
- Direct Product Results and the GCD Problem, in Old and New Communication ModelsItzhak Parnafes, Ran Raz, Avi Wigderson. 363-372 [doi]
- The Linear-Array Problem in Communication Complexity ResolvedMartin Dietzfelbinger. 373-382 [doi]
- Paul Erdös (1913-1996): His Influence on the Theory of ComputingLászló Babai. 383-401 [doi]
- Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract)William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas. 402-405 [doi]
- On Floorplans of Planar GraphsXin He. 426-435 [doi]
- Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and ArgumentsRonald Cramer, Ivan Damgård. 436-445 [doi]
- Oblivious Data Structures: Applications to CryptographyDaniele Micciancio. 456-464 [doi]
- Is Linear Hashing Good?Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. 465-474 [doi]
- A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NPRan Raz, Shmuel Safra. 475-484 [doi]
- Improved Low-Degree Testing and its ApplicationsSanjeev Arora, Madhu Sudan. 485-495 [doi]
- Probabilistically Checkable Proofs with Zero KnowledgeJoe Kilian, Erez Petrank, Gábor Tardos. 496-505 [doi]
- Making Games Short (Extended Abstract)Uriel Feige, Joe Kilian. 506-516 [doi]
- Improved Routing and Sorting on MultibutterfliesBruce M. Maggs, Berthold Vöcking. 517-530 [doi]
- Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version)Andrei Z. Broder, Alan M. Frieze, Eli Upfal. 531-539 [doi]
- On Sorting Strings in External Memory (Extended Abstract)Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter. 540-548 [doi]
- Pointer Jumping Requires Concurrent ReadNoam Nisan, Ziv Bar-Yossef. 549-558 [doi]
- Lower Bounds for Distributed Coin-Flipping and Randomized ConsensusJames Aspnes. 559-568 [doi]
- Byzantine Quorum SystemsDahlia Malkhi, Michael K. Reiter. 569-578 [doi]
- All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not RobustWai-Kau Lo, Vassos Hadzilacos. 579-588 [doi]
- The Decidability of Distributed Decision Tasks (Extended Abstract)Maurice Herlihy, Sergio Rajsbaum. 589-598 [doi]
- Two Algorithms for Nearest-Neighbor Search in High DimensionsJon M. Kleinberg. 599-608 [doi]
- Nearest Neighbor Queries in Metric SpacesKenneth L. Clarkson. 609-617 [doi]
- Locality-Preserving Hashing in Multidimensional SpacesPiotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala. 618-625 [doi]
- Incremental Clustering and Dynamic Information RetrievalMoses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. 626-635 [doi]
- A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global CriteriaAravind Srinivasan, Chung-Piaw Teo. 636-643 [doi]
- Universal ::::O::::(Congestion + Dilation + log:::1+epsilon:::::::N::::) Local Control Packet Switching AlgorithmsRafail Ostrovsky, Yuval Rabani. 644-653 [doi]
- Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide WebDavid R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin. 654-663 [doi]
- Allocating Bandwidth for Bursty ConnectionsJon M. Kleinberg, Yuval Rabani, Éva Tardos. 664-673 [doi]
- The Swendsen-Wang Process Does Not Always Mix RapidlyVivek Gore, Mark Jerrum. 674-681 [doi]
- Approximately Counting Up To Four (Extended Abstract)Michael Luby, Eric Vigoda. 682-687 [doi]
- Page Replacement with Multi-Size Pages and Applications to Web CachingSandy Irani. 701-710 [doi]
- A polylog(::::n::::)-Competitive Algorithm for Metrical Task SystemsYair Bartal, Avrim Blum, Carl Burch, Andrew Tomkins. 711-719 [doi]
- On ACC:::0:::[::::p:::k:::::::] Frege ProofsAlexis Maciel, Toniann Pitassi. 720-729 [doi]
- Reducing the Complexity of ReductionsManindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich. 730-738 [doi]
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal CalculusAlexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao. 739-748 [doi]
- Retraction of Probabilistic Computation and Linear TimeLance Fortnow, Michael Sipser. 750 [doi]