Table of Contents

• Quantum Weak Coin-Flipping with Bias of 0.192Carlos Mochon. 2-11 [doi]
• Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space TradeoffsHartmut Klauck, Robert Spalek, Ronald de Wolf. 12-21 [doi]
• Quantum Walk Algorithm for Element DistinctnessAndris Ambainis. 22-31 [doi]
• Quantum Speed-Up of Markov Chain Based AlgorithmsMario Szegedy. 32-41 [doi]
• Adiabatic Quantum Computation is Equivalent to Standard Quantum ComputationDorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev. 42-51 [doi]
• Maximizing Quadratic Programs: Extending Grothendieck s InequalityMoses Charikar, Anthony Wirth. 54-60 [doi]
• An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut TheoremLap Chi Lau. 61-70 [doi]
• Edge-Disjoint Paths in Planar GraphsChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. 71-80 [doi]
• Machine Minimization for Scheduling Jobs with Interval ConstraintsJulia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor. 81-90 [doi]
• Random Edge Can Be Exponential on Abstract CubesJirí Matousek, Tibor Szabó. 92-100 [doi]
• On the Integrality Ratio for Asymmetric TSPMoses Charikar, Michel X. Goemans, Howard J. Karloff. 101-107 [doi]
• The Hardness of Metric LabelingJulia Chuzhoy, Joseph Naor. 108-114 [doi]
• Hardness of Buy-at-Bulk Network DesignMatthew Andrews. 115-124 [doi]
• Hardness of Approximating the Shortest Vector Problem in LatticesSubhash Khot. 126-135 [doi]
• Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite CliqueSubhash Khot. 136-145 [doi]
• Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O Donnell. 146-154 [doi]
• Assignment Testers: Towards a Combinatorial Proof of the PCP-TheoremIrit Dinur, Omer Reingold. 155-164 [doi]
• Cryptography in NC:::0:::Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. 166-175 [doi]
• An Unconditional Study of Computational Zero KnowledgeSalil P. Vadhan. 176-185 [doi]
• Universally Composable Protocols with Relaxed Set-Up AssumptionsBoaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass. 186-195 [doi]
• On the (Im)possibility of Cryptography with Imperfect RandomnessYevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai. 196-205 [doi]
• Approximating the Stochastic Knapsack Problem: The Benefit of AdaptivityBrian C. Dean, Michel X. Goemans, Jan Vondrák. 208-217 [doi]
• An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network DesignAnupam Gupta, R. Ravi, Amitabh Sinha. 218-227 [doi]
• Stochastic Optimization is (Almost) as easy as Deterministic OptimizationDavid B. Shmoys, Chaitanya Swamy. 228-237 [doi]
• 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n:::2:::) TimeSanjeev Arora, Elad Hazan, Satyen Kale. 238-247 [doi]
• Maximum Matchings via Gaussian EliminationMarcin Mucha, Piotr Sankowski. 248-255 [doi]
• Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix GameRahul Savani, Bernhard von Stengel. 258-267 [doi]
• Edge Pricing of Multicommodity Networks for Heterogeneous Selfish UsersGeorge Karakostas, Stavros G. Kolliopoulos. 268-276 [doi]
• Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion GamesLisa Fleischer, Kamal Jain, Mohammad Mahdian. 277-285 [doi]
• A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear UtilitiesKamal Jain. 286-294 [doi]
• The Price of Stability for Network Design with Fair Cost AllocationElliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden. 295-304 [doi]
• Holographic Algorithms (Extended Abstract)Leslie G. Valiant. 306-315 [doi]
• Hierarchy Theorems for Probabilistic Polynomial TimeLance Fortnow, Rahul Santhanam. 316-324 [doi]
• Private Codes or Succinct Random Codes That Are (Almost) PerfectMichael Langberg. 325-334 [doi]
• On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)Qi Cheng, Daqing Wan. 335-341 [doi]
• Multilinear-NC neq Multilinear-NCRan Raz. 344-351 [doi]
• Algebras with Polynomial Identities and Computing the DeterminantSteve Chien, Alistair Sinclair. 352-361 [doi]
• Lattice Problems in NP cap coNPDorit Aharonov, Oded Regev. 362-371 [doi]
• Worst-Case to Average-Case Reductions Based on Gaussian MeasuresDaniele Micciancio, Oded Regev. 372-381 [doi]
• Extracting Randomness Using Few Independent SourcesBoaz Barak, Russell Impagliazzo, Avi Wigderson. 384-393 [doi]
• Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent SeedAriel Gabizon, Ran Raz, Ronen Shaltiel. 394-403 [doi]
• Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral GapYonatan Bilu, Nathan Linial. 404-412 [doi]
• Testing Polynomials over General FieldsTali Kaufman, Dana Ron. 413-422 [doi]
• Testing Low-Degree Polynomials over Prime FieldsCharanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman. 423-432 [doi]
• Measured Descent: A New Embedding Method for Finite MetricsRobert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor. 434-443 [doi]
• Triangulation and Embedding Using Small Sets of BeaconsJon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler. 444-453 [doi]
• A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any DimensionsAmit Kumar, Yogish Sabharwal, Sandeep Sen. 454-462 [doi]
• On the Power of Discrete and of Lexicographic Helly-Type TheoremsNir Halman. 463-472 [doi]
• An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour SearchingAmit Chakrabarti, Oded Regev. 473-482 [doi]
• Dynamic Optimality -- AlmostErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu. 484-490 [doi]
• No Sorting? Better Searching!Gianni Franceschini, Roberto Grossi. 491-498 [doi]
• Dynamic Approximate All-Pairs Shortest Paths in Undirected GraphsLiam Roditty, Uri Zwick. 499-508 [doi]
• Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)Piotr Sankowski. 509-517 [doi]
• Dynamic Speed Scaling to Manage Energy and TemperatureNikhil Bansal, Tracy Kimbrel, Kirk Pruhs. 520-529 [doi]
• Optimal Power-Down StrategiesJohn Augustine, Sandy Irani, Chaitanya Swamy. 530-539 [doi]
• On the Streaming Model Augmented with a Sorting PrimitiveGagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, Matthias Ruhl. 540-549 [doi]
• Approximating Edit Distance EfficientlyZiv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. 550-559 [doi]
• trong Spatial Mixing for Lattice Graphs with Fewer ColoursLeslie Ann Goldberg, Russell A. Martin, Mike Paterson. 562-571 [doi]
• Shuffling by Semi-Random TranspositionsElchanan Mossel, Yuval Peres, Alistair Sinclair. 572-581 [doi]
• Randomly Coloring Constant Degree GraphsMartin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda. 582-589 [doi]
• The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction ProblemHarold S. Connamacher, Michael Molloy. 590-599 [doi]
• Spectral Analysis of Random Graphs with Skewed Degree DistributionsAnirban Dasgupta, John E. Hopcroft, Frank McSherry. 602-610 [doi]
• Learning with Errors in Answers to Membership QueriesLaurence Bisht, Nader H. Bshouty, Lawrance Khoury. 611-620 [doi]
• Learnability and AutomatizabilityMichael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi. 621-630 [doi]