Table of Contents

• Hidden translation and orbit coset in quantum computingKatalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen. 1-9 [doi]
• Classical deterministic complexity of Edmonds Problem and quantum entanglementLeonid Gurvits. 10-19 [doi]
• Adiabatic quantum state generation and statistical zero knowledgeDorit Aharonov, Amnon Ta-Shma. 20-29 [doi]
• Better streaming algorithms for clustering problemsMoses Charikar, Liadan O Callaghan, Rina Panigrahy. 30-39 [doi]
• Approximation algorithms for hierarchical location problemsC. Greg Plaxton. 40-49 [doi]
• Approximation schemes for clustering problemsWenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani. 50-58 [doi]
• Exponential algorithmic speedup by a quantum walkAndrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman. 59-68 [doi]
• Quantum time-space tradeoffs for sortingHartmut Klauck. 69-76 [doi]
• On the power of quantum fingerprintingAndrew Chi-Chih Ya. 77-81 [doi]
• Management of multi-queue switches in QoS networksYossi Azar, Yossi Richter. 82-89 [doi]
• Constant factor approximation of vertex-cuts in planar graphsEyal Amir, Robert Krauthgamer, Satish Rao. 90-99 [doi]
• The online set cover problemNoga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. 100-105 [doi]
• Exponential lower bound for 2-query locally decodable codes via a quantum argumentIordanis Kerenidis, Ronald de Wolf. 106-115 [doi]
• Optimal probabilistic fingerprint codesGábor Tardos. 116-125 [doi]
• Linear time encodable and list decodable codesVenkatesan Guruswami, Piotr Indyk. 126-135 [doi]
• Reconstructing curves in three (and higher) dimensional space from noisy dataDon Coppersmith, Madhu Sudan. 136-142 [doi]
• Short path queries in planar graphs in constant timeLukasz Kowalik, Maciej Kurowski. 143-148 [doi]
• Integer priority queues with decrease key in constant time and the single source shortest paths problemMikkel Thorup. 149-158 [doi]
• A new approach to dynamic all pairs shortest pathsCamil Demetrescu, Giuseppe F. Italiano. 159-166 [doi]
• A fast algorithm for computing steiner edge connectivityRichard Cole, Ramesh Hariharan. 167-176 [doi]
• The computational complexity of some julia setsRobert Rettinger, Klaus Weihrauch. 177-185 [doi]
• Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functionsMartin Sauerhoff, Philipp Woelfel. 186-195 [doi]
• Boosting in the presence of noiseAdam Kalai, Rocco A. Servedio. 195-205 [doi]
• Learning juntasElchanan Mossel, Ryan O Donnell, Rocco A. Servedio. 206-212 [doi]
• Generating random regular graphsJeong Han Kim, Van H. Vu. 213-222 [doi]
• The threshold for random k-SAT is 2:::k::: (ln 2 - O(k))Dimitris Achlioptas, Yuval Peres. 223-231 [doi]
• Random knapsack in expected polynomial timeRené Beier, Berthold Vöcking. 232-241 [doi]
• Server scheduling in the L::p:: norm: a rising tide lifts all boatNikhil Bansal, Kirk Pruhs. 242-250 [doi]
• Work-competitive scheduling for cooperative computing with dynamic groupsChryssis Georgiou, Alexander Russell, Alexander A. Shvartsman. 251-258 [doi]
• A tight time lower bound for space-optimal implementations of multi-writer snapshotsPanagiota Fatourou, Faith Ellen Fich, Eric Ruppert. 259-268 [doi]
• Randomly coloring graphs of girth at least fiveThomas P. Hayes. 269-278 [doi]
• Evolving sets and mixinBen Morris, Yuval Peres. 279-286 [doi]
• Modified log-sobolev inequalities, mixing and hypercontractivitySergey Bobkov, Prasad Tetali. 287-296 [doi]
• On the fractal behavior of TCPAnna C. Gilbert, Howard J. Karloff. 297-306 [doi]
• On the limits of cache-obliviousnessGerth Stølting Brodal, Rolf Fagerberg. 307-315 [doi]
• A sublinear algorithm for weakly approximating edit distanceTugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami. 316-324 [doi]
• New degree bounds for polynomial threshold functionsRyan O Donnell, Rocco A. Servedio. 325-334 [doi]
• Sampling lower bounds via information theoryZiv Bar-Yossef. 335-344 [doi]
• Some 3CNF properties are hard to testEli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova. 345-354 [doi]
• Derandomizing polynomial identity tests means proving circuit lower boundsValentine Kabanets, Russell Impagliazzo. 355-364 [doi]
• Simpler and better approximation algorithms for network designAnupam Gupta, Amit Kumar, Tim Roughgarden. 365-372 [doi]
• Meet and merge: approximation algorithms for confluent flowsJiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram. 373-382 [doi]
• Optimal oblivious routing in polynomial timeYossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. 383-388 [doi]
• Primal-dual meets local search: approximating MST s with nonuniform degree boundsJochen Könemann, R. Ravi. 389-395 [doi]
• The worst-case behavior of schnorr s algorithm approximating the shortest nonzero vector in a latticeMiklós Ajtai. 396-406 [doi]
• New lattice based cryptographic constructionsOded Regev. 407-416 [doi]
• Lower bounds on the efficiency of encryption and digital signature schemesRosario Gennaro, Yael Gertner, Jonathan Katz. 417-425 [doi]
• Non-interactive and reusable non-malleable commitment schemesIvan Damgård, Jens Groth. 426-437 [doi]
• The intrinsic dimensionality of graphsRobert Krauthgamer, James R. Lee. 438-447 [doi]
• A tight bound on approximating arbitrary metrics by tree metricsJittat Fakcharoenphol, Satish Rao, Kunal Talwar. 448-455 [doi]
• On average distortion of embedding metrics into the line and into L1Yuri Rabinovich. 456-462 [doi]
• On metric ramsey-type phenomenaYair Bartal, Nathan Linial, Manor Mendel, Assaf Naor. 463-472 [doi]
• Touring a sequence of polygonsMoshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell. 473-482 [doi]
• Well-separated pair decomposition for the unit-disk graph metric and its applicationsJie Gao, Li Zhang. 483-492 [doi]
• Alpha-shapes and flow shapes are homotopy equivalentTamal K. Dey, Joachim Giesen, Matthias John. 493-502 [doi]
• Reducing truth-telling online mechanisms to online optimizationBaruch Awerbuch, Yossi Azar, Adam Meyerson. 503-510 [doi]
• Near-optimal network design with selfish agentsElliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler. 511-520 [doi]
• Pricing network edges for heterogeneous selfish usersRichard Cole, Yevgeniy Dodis, Tim Roughgarden. 521-530 [doi]
• Sublinear geometric algorithmsBernard Chazelle, Ding Liu, Avner Magen. 531-540 [doi]
• Distinct distances in three and higher dimensionsBoris Aronov, János Pach, Micha Sharir, Gábor Tardos. 541-546 [doi]
• Cutting triangular cycles of lines in spaceBoris Aronov, Vladlen Koltun, Micha Sharir. 547-555 [doi]
• OPT versus LOAD in dynamic storage allocationAdam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. 556-564 [doi]
• Consistent load balancing via spread minimizationRobert D. Kleinberg, Frank Thomson Leighton. 565-574 [doi]
• A stochastic process on the hypercube with applications to peer-to-peer networksMicah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani. 575-584 [doi]
• Polylogarithmic inapproximabilityEran Halperin, Robert Krauthgamer. 585-594 [doi]
• A new multilayered PCP and the hardness of hypergraph vertex coverIrit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev. 595-601 [doi]
• Extractors: optimal up to constant factorsChi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson. 602-611 [doi]
• Randomness-efficient low degree tests and short PCPs via epsilon-biased setsEli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson. 612-621 [doi]
• Uniform hashing in constant time and linear spaceAnna Östlin, Rasmus Pagh. 622-628 [doi]
• Almost random graphs with simple hash functionsMartin Dietzfelbinger, Philipp Woelfel. 629-638 [doi]
• Dynamic rectangular intersection with prioritiesHaim Kaplan, Eyal Molad, Robert Endre Tarjan. 639-648 [doi]
• Space efficient dynamic stabbing with fast queriesMikkel Thorup. 649-658 [doi]
• Lower bounds on the amount of randomness in private computationAnna Gál, Adi Rosén. 659-666 [doi]
• Cell-probe lower bounds for the partial match problemT. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani. 667-672 [doi]
• Two applications of information complexityT. S. Jayram, Ravi Kumar, D. Sivakumar. 673-682 [doi]
• Bounded-concurrent secure two-party computation without setup assumptionsYehuda Lindell. 683-692 [doi]
• Approximate counting by dynamic programmingMartin E. Dyer. 693-699 [doi]
• Testing subgraphs in directed graphsNoga Alon, Asaf Shapira. 700-709 [doi]
• On the sample size of k-restricted min-wise independent permutations and other k-wise distributionsToshiya Itoh, Yoshinori Takei, Jun Tarui. 710-719 [doi]
• A proof of Alon s second eigenvalue conjectureJoel Friedman. 720-724 [doi]