Table of Contents

• Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median ProblemsKamal Jain, Vijay V. Vazirani. 2-13 [doi]
• Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random FieldsJon M. Kleinberg, Éva Tardos. 14-23 [doi]
• Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesLisa Fleischer. 24-31 [doi]
• Approximation Schemes for Minimizing Average Weighted Completion Time with Release DatesFoto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. 32-44 [doi]
• A 5/2 n:::2:::-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary FieldsMarkus Bläser. 45-50 [doi]
• Improved Bounds for Sampling ColoringsEric Vigoda. 51-59 [doi]
• A Non-linear Time Lower Bound for Boolean Branching ProgramsMiklós Ajtai. 60-70 [doi]
• Derandomizing Arthur-Merlin Games Using Hitting SetsPeter Bro Miltersen, N. V. Vinodchandran. 71-80 [doi]
• Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in DigraphsValerie King. 81-91 [doi]
• Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized TimeTimothy M. Chan. 92-99 [doi]
• Taking a Walk in a Planar ArrangementSariel Har-Peled. 100-111 [doi]
• PSPACE Has Constant-Round Quantum Interactive Proof SystemsJohn Watrous. 112-119 [doi]
• Verifiable Random FunctionsSilvio Micali, Michael O. Rabin, Salil P. Vadhan. 120-130 [doi]
• How Asymmetry Helps Load BalancingBerthold Vöcking. 131-141 [doi]
• Noncryptographic Selection ProtocolsUriel Feige. 142-153 [doi]
• A Sublinear Time Approximation Scheme for Clustering in Metric SpacesPiotr Indyk. 154-159 [doi]
• Efficient Regular Data Structures and Algorithms for Location and Proximity ProblemsArnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet. 160-170 [doi]
• Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via EmbeddingsMartin Farach-Colton, Piotr Indyk. 171-180 [doi]
• Error Reduction for ExtractorsRan Raz, Omer Reingold, Salil P. Vadhan. 191-201 [doi]
• Primality and Identity Testing via Chinese RemainderingManindra Agrawal, Somenath Biswas. 202-209 [doi]
• On Counting Independent Sets in Sparse GraphsMartin E. Dyer, Alan M. Frieze, Mark Jerrum. 210-217 [doi]
• Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical PhysicsChristian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu. 218-229 [doi]
• Random Walks on Truncated Cubes and Sampling 0-1 Knapsack SolutionsBen Morris, Alistair Sinclair. 230-240 [doi]
• Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainV. S. Anil Kumar, H. Ramesh. 241-252 [doi]
• A Near-Tight Lower Bound on the Time Complexity of Distributed MST ConstructionDavid Peleg, Vitaly Rubinovich. 253-261 [doi]
• ong-lived Adaptive Collect with ApplicationsYehuda Afek, Gideon Stupp, Dan Touitou. 262-272 [doi]
• A Theoretical Framework for Memory-Adaptive AlgorithmsRakesh D. Barve, Jeffrey Scott Vitter. 273-284 [doi]
• Cache-Oblivious AlgorithmsMatteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran. 285-298 [doi]
• The Directed Steiner Network Problem is Tractable for a Constant Number of TerminalsJon Feldman, Matthias Ruhl. 299-308 [doi]
• Setting Parameters by ExampleDavid Eppstein. 309-318 [doi]
• Finding Double Euler Trails of Planar Graphs in Linear TimeZhi-Zhong Chen, Xin He, Chun-Hsi Huang. 319-329 [doi]
• Edge-Disjoint Routing in Plane Switch Graphs in Linear TimeKarsten Weihe. 330-340 [doi]
• On Quantum and Classical Space-bounded Processes with Algebraic Transition AmplitudesJohn Watrous. 341-351 [doi]
• A Better Lower Bound for Quantum Algorithms Searching an Ordered ListAndris Ambainis. 352-357 [doi]
• Bounds for Small-Error and Zero-Error Quantum AlgorithmsHarry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka. 358-368 [doi]
• Optimal Lower Bounds for Quantum Automata and Random Access CodesAshwin Nayak. 369-377 [doi]
• Improved Combinatorial Algorithms for the Facility Location and k-Median ProblemsMoses Charikar, Sudipto Guha. 378-388 [doi]
• Lovász s Lemma for the Three-Dimensional K-Level of Concave Surfaces and its ApplicationsNaoki Katoh, Takeshi Tokuyama. 389-398 [doi]
• Cuts, Trees and l::1::-Embeddings of GraphsAnupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair. 399-409 [doi]
• A Probabilistic Algorithm for k-SAT and Constraint Satisfaction ProblemsUwe Schöning. 410-414 [doi]
• Random CNF s are Hard for the Polynomial CalculusEli Ben-Sasson, Russell Impagliazzo. 415-421 [doi]
• A Study of Proof Search Algorithms for Resolution and Polynomial CalculusMaria Luisa Bonet, Nicola Galesi. 422-432 [doi]
• Online Scheduling to Minimize Average StretchS. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke. 433-442 [doi]
• Weak Adversaries for the k-Server ProblemElias Koutsoupias. 444-449 [doi]
• Finely-Competitive PagingAvrim Blum, Carl Burch, Adam Kalai. 450-458 [doi]
• On the Complexity of SATRichard J. Lipton, Anastasios Viglas. 459-464 [doi]
• Hardness of Approximating Sigma::2:::::p::: Minimization ProblemsChristopher Umans. 465-474 [doi]
• Hardness of Approximating the Minimum Distance of a Linear CodeIlya Dumer, Daniele Micciancio, Madhu Sudan. 475-485 [doi]
• On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor s BasisP. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan. 486-494 [doi]
• Satisfiability of Word Equations with Constants is in PSPACEWojciech Plandowski. 495-500 [doi]
• An Approximate L:::1:::-Difference Algorithm for Massive Data StreamsJoan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan. 501-511 [doi]
• Algorithmic Aspects of Protein Structure SimilarityDeborah Goldman, Sorin Istrail, Christos H. Papadimitriou. 512-522 [doi]
• Magic FunctionsCynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer. 523-534 [doi]
• Limits on the Efficiency of One-Way Permutation-Based Hash FunctionsJeong Han Kim, Daniel R. Simon, Prasad Tetali. 535-542 [doi]
• Non-Interactive CryptoComputing For NC:::1:::Tomas Sander, Adam Young, Moti Yung. 554-567 [doi]
• Fairness in Routing and Load BalancingJon M. Kleinberg, Yuval Rabani, Éva Tardos. 568-578 [doi]
• Stochastic Load Balancing and Related ProblemsAshish Goel, Piotr Indyk. 579-586 [doi]
• Reducing Network Congestion and Blocking Probability Through Balanced AllocationMalwina J. Luczak, Eli Upfal. 587-595 [doi]
• Finding Maximal Repetitions in a Word in Linear TimeRoman M. Kolpakov, Gregory Kucherov. 596-604 [doi]
• All Pairs Shortest Paths in Undirected Graphs with Integer WeightsAvi Shoshan, Uri Zwick. 605-615 [doi]
• An Algorithmic Theory of Learning: Robust Concepts and Random ProjectionRosa I. Arriaga, Santosh Vempala. 616-623 [doi]
• Boosting and Hard-Core SetsAdam Klivans, Rocco A. Servedio. 624-633 [doi]
• Learning Mixtures of GaussiansSanjoy Dasgupta. 634-644 [doi]
• Regular Languages Are Testable with a Constant Number of QueriesNoga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy. 645-655 [doi]
• Efficient Testing of Large GraphsNoga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy. 656-666 [doi]