Table of Contents

• Extractors and pseudo-random generators with optimal seed lengthRussell Impagliazzo, Ronen Shaltiel, Avi Wigderson. 1-10 [doi]
• Pseudo-random functions and factoring (extended abstract)Moni Naor, Omer Reingold, Alon Rosen. 11-20 [doi]
• Satisfiability of equations in free groups is in PSPACEClaudio Gutiérrez. 21-27 [doi]
• Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)Dimitris Achlioptas. 28-37 [doi]
• A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)Artur Czumaj, Christian Scheideler. 38-47 [doi]
• Randomized metarounding (extended abstract)Robert D. Carr, Santosh Vempala. 58-62 [doi]
• Circuit minimization problemValentine Kabanets, Jin-yi Cai. 73-79 [doi]
• On the efficiency of local decoding procedures for error-correcting codesJonathan Katz, Luca Trevisan. 80-86 [doi]
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functionsSatoru Iwata, Lisa Fleischer, Satoru Fujishige. 97-106 [doi]
• Improved algorithms for submodular function minimization and submodular flowLisa Fleischer, Satoru Iwata. 107-116 [doi]
• On dual minimum cost flow algorithms (extended abstract)Jens Vygen. 117-125 [doi]
• Approximating the domatic numberUriel Feige, Magnús M. Halldórsson, Guy Kortsarz. 134-143 [doi]
• The value of strong inapproximability results for cliqueAravind Srinivasan. 144-152 [doi]
• The small-world phenomenon: an algorithm perspectiveJon M. Kleinberg. 163-170 [doi]
• A random graph model for massive graphsWilliam Aiello, Fan R. K. Chung, Linyuan Lu. 171-180 [doi]
• List decoding algorithms for certain concatenated codesVenkatesan Guruswami, Madhu Sudan. 181-190 [doi]
• A PCP characterization of NP with optimal amortized query complexityAlex Samorodnitsky, Luca Trevisan. 191-199 [doi]
• On the sum-of-squares algorithm for bin packingJános Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber. 208-217 [doi]
• Sharing the cost of muliticast transmissions (preliminary version)Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker. 218-227 [doi]
• The risk profile problem for stock portfolio optimization (extended abstract)Ming-Yang Kao, Andreas Nolte, Stephen R. Tate. 228-234 [doi]
• Resettable zero-knowledge (extended abstract)Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali. 235-244 [doi]
• Complete characterization of security notions for probabilistic private-key encryptionJonathan Katz, Moti Yung. 245-254 [doi]
• On zero-knowledge proofs (extended abstract): from membership to decision Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung. 255-264 [doi]
• Finding smooth integers in short intervals using CRT decodingDan Boneh. 265-272 [doi]
• Smoothing and cleaning up sliversHerbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington. 273-277 [doi]
• Hard-Potato routingCostas Busch, Maurice Herlihy, Roger Wattenhofer. 278-285 [doi]
• Approximation algorithms for geometric shortest path problemsLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. 286-295 [doi]
• Improved approximations of crossings in graph drawingsGuy Even, Sudipto Guha, Baruch Schieber. 296-305 [doi]
• On the decidability of accessibility problems (extended abstract)Rajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, Suresh Venkatasubramanian. 306-315 [doi]
• More general completeness theorems for secure two-party computationJoe Kilian. 316-324 [doi]
• On the complexity of verifiable secret sharing and multiparty computationRonald Cramer, Ivan Damgård, Stefan Dziembowski. 325-334 [doi]
• Tight(er) worst-case bounds on dynamic searching and priority queuesArne Andersson, Mikkel Thorup. 335-342 [doi]
• A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)Meena Mahajan, Kasturi R. Varadarajan. 351-357 [doi]
• Space complexity in propositional calculusMichael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson. 358-367 [doi]
• Higher lower bounds on monotone sizeDanny Harnik, Ran Raz. 378-387 [doi]
• Tighter bounds for nearest neighbor search and related problems in the cell probe modelOmer Barkol, Yuval Rabani. 388-396 [doi]
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)Roberto Grossi, Jeffrey Scott Vitter. 397-406 [doi]
• Faster suffix tree construction with missing suffix linksRichard Cole, Ramesh Hariharan. 407-415 [doi]
• Approximate nearest neighbors and sequence comparison with block operationsS. Muthukrishnan, Süleyman Cenk Sahinalp. 416-424 [doi]
• Near optimal multiple alignment within a band in polynomial timeMing Li, Bin Ma, Lusheng Wang. 425-434 [doi]
• Are bitvectors optimal?Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh. 449-458 [doi]
• Shortest path queries in planar graphsDanny Z. Chen, Jinhui Xu. 469-478 [doi]
• How tall is a tree?Bruce A. Reed. 479-483 [doi]
• Random walks with back buttons (extended abstract)Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins. 484-493 [doi]
• From partial consistency to global broadcastMatthias Fitzi, Ueli M. Maurer. 494-503 [doi]
• Strictly non-blocking WDM cross-connects for heterogeneous networksApril Rasala, Gordon T. Wilfong. 514-523 [doi]
• Finding long paths and cycles in sparse Hamiltonian graphsTomás Feder, Rajeev Motwani, Carlos S. Subi. 524-529 [doi]
• Approximating the minimum bisection size (extended abstract)Uriel Feige, Robert Krauthgamer, Kobbi Nissim. 530-536 [doi]
• A matter of degree: improved approximation algorithms for degree-bounded minimum spanning treesJochen Könemann, R. Ravi. 537-546 [doi]
• Exact computations of the inertia symmetric integer matricesSteven Fortune. 556-564 [doi]
• epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract)James B. Orlin, Andreas S. Schulz, Sudipta Sengupta. 565-572 [doi]
• Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolationVadim Olshevsky, Mohammad Amin Shokrollahi. 573-581 [doi]
• Query strategies for priced information (extended abstract)Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. 582-591 [doi]
• A guessing game and randomized online algorithmsSteven S. Seiden. 592-601 [doi]
• Computing the median with uncertaintyTomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom. 602-607 [doi]
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systemsAlexei Kitaev, John Watrous. 608-617 [doi]
• Rapid sampling though quantum computingLov K. Grover. 618-626 [doi]
• Normal subgroup reconstruction and quantum computation using group representationsSean Hallgren, Alexander Russell, Amnon Ta-Shma. 627-635 [doi]
• Quantum lower bounds by quantum argumentsAndris Ambainis. 636-643 [doi]
• On quantum and probabilistic communication: Las Vegas and one-way protocolsHartmut Klauck. 644-651 [doi]
• A constant factor approximation algorithm for a class of classification problemsAnupam Gupta, Éva Tardos. 652-658 [doi]
• Polynomial-time approximation scheme for data broadcastClaire Kenyon, Nicolas Schabanel, Neal E. Young. 659-666 [doi]
• Approximating permanents of complex matricesMartin Fürer. 667-669 [doi]
• Combining fairness with throughput: online routing with multiple objectivesAshish Goel, Adam Meyerson, Serge A. Plotkin. 670-679 [doi]
• Self-testing of universal and fault-tolerant sets of quantum gatesWim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha. 688-696 [doi]
• Computing with highly mixed states (extended abstract)Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani. 697-704 [doi]
• Quantum bit escrowDorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao. 705-714 [doi]
• A proof of the security of quantum key distribution (extended abstract)Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury. 715-724 [doi]
• Better algorithms for unfair metrical task systems and applicationsAmos Fiat, Manor Mendel. 725-734 [doi]
• A unified approach to approximating resource allocation and schedulingAmotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber. 735-744 [doi]
• Balanced allocations: the heavily loaded casePetra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking. 745-754 [doi]