Table of Contents

• Machine Learning: My Favorite Results, Directions, and Open ProblemsAvrim Blum. 2 [doi]
• MixingDana Randall. 4 [doi]
• Performance Analysis of Dynamic Network ProcessesEli Upfal. 18 [doi]
• A Polynomial Algorithm for Recognizing Perfect GraphsGérard Cornuéjols, Xinming Liu, Kristina Vuskovic. 20-27 [doi]
• On Certain Connectivity Properties of the Internet TopologyMilena Mihail, Christos H. Papadimitriou, Amin Saberi. 28-35 [doi]
• Paths, Trees, and Minimum Latency ToursKamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar. 36-45 [doi]
• Approximation Algorithms for Orienteering and Discounted-Reward TSPAvrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. 46-55 [doi]
• Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular MultigraphsHaim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko. 56 [doi]
• On the Implementation of Huge Random ObjectsOded Goldreich, Shafi Goldwasser, Asaf Nussboim. 68-79 [doi]
• Zero-Knowledge SetsSilvio Micali, Michael O. Rabin, Joe Kilian. 80-91 [doi]
• Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient CryptographyJesse Kamp, David Zuckerman. 92-101 [doi]
• On the (In)security of the Fiat-Shamir ParadigmShafi Goldwasser, Yael Tauman Kalai. 102 [doi]
• Locally Testable Cyclic CodesLászló Babai, Amir Shpilka, Daniel Stefankovic. 116-125 [doi]
• List-Decoding Using The XOR LemmaLuca Trevisan. 126-135 [doi]
• On e-Biased Generators in NC0Elchanan Mossel, Amir Shpilka, Luca Trevisan. 136-145 [doi]
• Proving Hard-Core Predicates Using List DecodingAdi Akavia, Shafi Goldwasser, Shmuel Safra. 146 [doi]
• Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing ModelRajat Bhattacharjee, Ashish Goel. 160-167 [doi]
• Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment ProblemChandra Nair, Balaji Prabhakar, Mayank Sharma. 168-178 [doi]
• Always Good Turing: Asymptotically Optimal Probability EstimationAlon Orlitsky, Narayana P. Santhanam, Junan Zhang. 179-188 [doi]
• Learning DNF from Random WalksNader H. Bshouty, Elchanan Mossel, Ryan O Donnell, Rocco A. Servedio. 189 [doi]
• Quantum Search of Spatial RegionsScott Aaronson, Andris Ambainis. 200-209 [doi]
• A Lattice Problem in Quantum NPDorit Aharonov, Oded Regev. 210-219 [doi]
• A Lower Bound for the Bounded Round Quantum Communication Complexity of Set DisjointnessRahul Jain, Jaikumar Radhakrishnan, Pranab Sen. 220-229 [doi]
• Polynomial Degree vs. Quantum Query ComplexityAndris Ambainis. 230 [doi]
• An In-Place Sorting with O(n log n) Comparisons and O(n) MovesGianni Franceschini, Viliam Geffert. 242-250 [doi]
• Breaking a Time-and-Space Barrier in Constructing Full-Text IndicesWing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. 251-260 [doi]
• I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar GraphsLars Arge, Norbert Zeh. 261-270 [doi]
• The Cost of Cache-Oblivious SearchingMichael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz. 271-282 [doi]
• Tight Lower Bounds for the Distinct Elements ProblemPiotr Indyk, David P. Woodruff. 283 [doi]
• Hardness of Approximating the Shortest Vector Problem in High Lp NormsSubhash Khot. 290-297 [doi]
• More on Average Case vs Approximation ComplexityMichael Alekhnovich. 298-307 [doi]
• On Worst-Case to Average-Case Reductions for NP ProblemsAndrej Bogdanov, Luca Trevisan. 308-317 [doi]
• Rank Bounds and Integrality Gaps for Cutting Planes Procedures JoshuaJosh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi. 318 [doi]
• The Resolution Complexity of Random Constraint Satisfaction ProblemsMichael Molloy, Mohammad R. Salavatipour. 330-339 [doi]
• Algorithms and Complexity Results for #SAT and Bayesian InferenceFahiem Bacchus, Shannon Dalmao, Toniann Pitassi. 340-351 [doi]
• Linear Upper Bounds for Random Walk on Small Density Random 3-CNFMichael Alekhnovich, Eli Ben-Sasson. 352-361 [doi]
• On the Maximum Satisfiability of Random FormulasDimitris Achlioptas, Assaf Naor, Yuval Peres. 362 [doi]
• Logics for Reasoning about Cryptographic ConstructionsRussell Impagliazzo, Bruce M. Kapron. 372-383 [doi]
• Lower Bounds for Non-Black-Box Zero KnowledgeBoaz Barak, Yehuda Lindell, Salil P. Vadhan. 384-393 [doi]
• General Composition and Universal Composability in Secure Multi-Party ComputationYehuda Lindell. 394-403 [doi]
• Bounded-Concurrent Secure Two-Party Computation in a Constant Number of RoundsRafael Pass, Alon Rosen. 404 [doi]
• Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m:::1.31:::)Daniel A. Spielman, Shang-Hua Teng. 416-427 [doi]
• Separating the Power of Monotone Span Programs over Different FieldsAmos Beimel, Enav Weinreb. 428-437 [doi]
• A Group-Theoretic Approach to Fast Matrix MultiplicationHenry Cohn, Christopher Umans. 438-449 [doi]
• Symmetric Polynomials over Z::m:: and Simultaneous Communication ProtocolNayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton. 450 [doi]
• Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback AlgorithmLuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. 462-471 [doi]
• Stability and Efficiency of a Random Local Load Balancing ProtocolAris Anagnostopoulos, Adam Kirsch, Eli Upfal. 472-481 [doi]
• Gossip-Based Computation of Aggregate InformationDavid Kempe, Alin Dobra, Johannes Gehrke. 482-491 [doi]
• Broadcasting Algorithms in Radio Networks with Unknown TopologyArtur Czumaj, Wojciech Rytter. 492-501 [doi]
• Switch Scheduling via Randomized Edge ColoringGagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu. 502 [doi]
• On the Impossibility of Dimension Reduction in l::1::Bo Brinkman, Moses Charikar. 514-523 [doi]
• Clustering with Qualitative InformationMoses Charikar, Venkatesan Guruswami, Anthony Wirth. 524-533 [doi]
• Bounded Geometries, Fractals, and Low-Distortion EmbeddingsAnupam Gupta, Robert Krauthgamer, James R. Lee. 534-543 [doi]
• On Levels in Arrangements of Curves, II: A Simple Inequality and Its ConsequencesTimothy M. Chan. 544 [doi]
• The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other SideMartin Grohe. 552-561 [doi]
• Towards a Dichotomy Theorem for the Counting Constraint Satisfaction ProblemAndrei A. Bulatov, Víctor Dalmau. 562 [doi]
• Towards a Characterization of Truthful Combinatorial AuctionsRon Lavi, Ahuva Mu alem, Noam Nisan. 574-583 [doi]
• Group Strategyproof Mechanisms via Primal-Dual AlgorithmsMartin Pál, Éva Tardos. 584-593 [doi]
• The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price AuctionsRobert D. Kleinberg, Frank Thomson Leighton. 594-605 [doi]
• Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy ProblemAnupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. 606 [doi]
• A Non-Markovian Coupling for Randomly Sampling ColoringsThomas P. Hayes, Eric Vigoda. 618-627 [doi]
• The Ising Model on Trees: Boundary Conditions and Mixing TimeFabio Martinelli, Alistair Sinclair, Dror Weitz. 628-639 [doi]
• Logconcave Functions: Geometry and Efficient Sampling AlgorithmsLászló Lovász, Santosh Vempala. 640-649 [doi]
• Simulated Annealing in Convex Bodies and an 0*(n4) Volume AlgorithmLászló Lovász, Santosh Vempala. 650 [doi]