Table of Contents

• Recognizing string graphs in NPMarcus Schaefer, Eric Sedgwick, Daniel Stefankovic. 1-6 [doi]
• Dynamic subgraph connectivity with geometric applicationsTimothy M. Chan. 7-13 [doi]
• New results on monotone dualization and generating hypergraph transversalsThomas Eiter, Georg Gottlob, Kazuhisa Makino. 14-22 [doi]
• Combinatorial optimization problems in self-assemblyLeonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund. 23-32 [doi]
• The importance of being biasedIrit Dinur, Shmuel Safra. 33-42 [doi]
• On the advantage over a random assignmentJohan Håstad, Srinivasan Venkatesh. 43-52 [doi]
• The complexity of choosing an H-colouring (nearly) uniformly at randomLeslie Ann Goldberg, Steven Kelk, Mike Paterson. 53-62 [doi]
• Random sampling in residual graphsDavid R. Karger, Matthew S. Levine. 63-66 [doi]
• On the complexity of equilibriaXiaotie Deng, Christos H. Papadimitriou, Shmuel Safra. 67-71 [doi]
• Competitive generalized auctionsAmos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin. 72-81 [doi]
• Competitive recommendation systemsPetros Drineas, Iordanis Kerenidis, Prabhakar Raghavan. 82-90 [doi]
• The Glauber dynamics on colourings of a graph with high girth and maximum degreeMichael Molloy. 91-98 [doi]
• Clairvoyant scheduling of random walksPéter Gács. 99-108 [doi]
• Solving convex programs by random walksDimitris Bertsimas, Santosh Vempala. 109-115 [doi]
• The Joy of TheoryChristos H. Papadimitriou. 116 [doi]
• Improved decremental algorithms for maintaining transitive closure and all-pairs shortest pathsSurender Baswana, Ramesh Hariharan, Sandeep Sen. 117-123 [doi]
• Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machinesSpyros C. Kontogiannis. 124-133 [doi]
• On randomized online schedulingSusanne Albers. 134-143 [doi]
• On the complexity of matrix productRan Raz. 144-151 [doi]
• Near-optimal sparse fourier representations via samplingAnna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss. 152-161 [doi]
• Fitting algebraic curves to noisy dataSanjeev Arora, Subhash Khot. 162-169 [doi]
• A new average case analysis for completion time schedulingMark Scharbrodt, Thomas Schickinger, Angelika Steger. 170-178 [doi]
• A unified analysis of hot video schedulersWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. 179-188 [doi]
• Optimal rate-based scheduling on multiprocessorsAnand Srinivasan, James H. Anderson. 189-198 [doi]
• Almost all graphs with average degree 4 are 3-colorableDimitris Achlioptas, Cristopher Moore. 199-208 [doi]
• Models and thresholds for random constraint satisfaction problemsMichael Molloy. 209-217 [doi]
• Reimer s inequality and tardos conjectureClifford D. Smyth. 218-221 [doi]
• Clifford algebras and approximating the permanentSteve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair. 222-231 [doi]
• Random sampling and approximation of MAX-CSP problemsNoga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. 232-239 [doi]
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constantMary Cryan, Martin E. Dyer. 240-249 [doi]
• Approximate clustering via core-setsMihai Badoiu, Sariel Har-Peled, Piotr Indyk. 250-257 [doi]
• On paging with locality of referenceSusanne Albers, Lene M. Favrholdt, Oliver Giel. 258-267 [doi]
• Cache-oblivious priority queue and graph algorithm applicationsLars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro. 268-276 [doi]
• Average case analysis for batched disk scheduling and increasing subsequencesEitan Bachmat. 277-286 [doi]
• Selfish traffic allocation for server farmsArtur Czumaj, Piotr Krysta, Berthold Vöcking. 287-296 [doi]
• Approximation schemes for preemptive weighted flow timeChandra Chekuri, Sanjeev Khanna. 297-305 [doi]
• Approximation algorithms for minimum-cost k-vertex connected subgraphsJoseph Cheriyan, Santosh Vempala, Adrian Vetta. 306-312 [doi]
• Equitable cost allocations via primal-dual-type algorithmsKamal Jain, Vijay V. Vazirani. 313-321 [doi]
• 2-round zero knowledge and proof auditorsCynthia Dwork, Larry J. Stockmeyer. 322-331 [doi]
• Tight security proofs for the bounded-storage modelStefan Dziembowski, Ueli M. Maurer. 341-350 [doi]
• Hardness results for approximate hypergraph coloringSubhash Khot. 351-359 [doi]
• Space lower bounds for distance approximation in the data stream modelMichael E. Saks, Xiaodong Sun. 360-369 [doi]
• Approximate counting of inversions in a data streamMiklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar. 370-379 [doi]
• Similarity estimation techniques from rounding algorithmsMoses Charikar. 380-388 [doi]
• Fast, small-space algorithms for approximate histogram maintenanceAnna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. 389-398 [doi]
• Crawling on web graphsColin Cooper, Alan M. Frieze. 419-427 [doi]
• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problemMichael Elkin, Guy Kortsarz. 438-447 [doi]
• An exponential separation between regular and general resolutionMichael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart. 448-456 [doi]
• Size space tradeoffs for resolutionEli Ben-Sasson. 457-464 [doi]
• Exact learning of DNF formulas using DNF hypothesesLisa Hellerstein, Vijay Raghavan. 465-473 [doi]
• Monotonicity testing over general poset domainsEldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky. 474-483 [doi]
• Strict polynomial-time in simulation and extractionBoaz Barak, Yehuda Lindell. 484-493 [doi]
• Universally composable two-party and multi-party secure computationRan Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai. 494-503 [doi]
• The invasiveness of off-line memory checkingMiklós Ajtai. 504-513 [doi]
• On the composition of authenticated byzantine agreementYehuda Lindell, Anna Lysyanskaya, Tal Rabin. 514-523 [doi]
• Wait-free consensus with infinite arrivalsJames Aspnes, Gauri Shah, Jatin Shah. 524-533 [doi]
• Relations between average case complexity and approximation complexityUriel Feige. 534-543 [doi]
• Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilonJonas Holmerin. 544-552 [doi]
• Resolution lower bounds for the weak pigeonhole principleRan Raz. 553-562 [doi]
• Hard examples for bounded depth fregeEli Ben-Sasson. 563-572 [doi]
• Meldable heaps and boolean union-findHaim Kaplan, Nira Shafrir, Robert Endre Tarjan. 573-582 [doi]
• Optimal finger search trees in the pointer machineGerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas. 583-591 [doi]
• Verifying candidate matches in sparse and wildcard matchingRichard Cole, Ramesh Hariharan. 592-601 [doi]
• Deterministic sorting in O(nlog log n) time and linear spaceYijie Han. 602-608 [doi]
• Improved cryptographic hash functions with worst-case/average-case connectionDaniele Micciancio. 609-618 [doi]
• Algorithmic derandomization via complexity theoryD. Sivakumar. 619-626 [doi]
• Pseudo-random generators for all hardnessesChristopher Umans. 627-634 [doi]
• Secure multi-party quantum computationClaude Crépeau, Daniel Gottesman, Adam Smith. 643-652 [doi]
• Polynomial-time quantum algorithms for Pell s equation and the principal ideal problemSean Hallgren. 653-658 [doi]
• Randomness conductors and constant-degree lossless expandersMichael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson. 659-668 [doi]
• Expanders from symmetric codesRoy Meshulam, Avi Wigderson. 669-677 [doi]
• The complexity of approximating entropyTugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld. 678-687 [doi]
• Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problemsPaul Beame, Erik Vee. 688-697 [doi]
• Girth and euclidean distortionNathan Linial, Avner Magen, Assaf Naor. 705-711 [doi]
• Computing the betti numbers of arrangementsSaugata Basu. 712-720 [doi]
• Space-efficient approximate Voronoi diagramsSunil Arya, Theocharis Malamatos, David M. Mount. 721-730 [doi]
• A new greedy approach for facility location problemsKamal Jain, Mohammad Mahdian, Amin Saberi. 731-740 [doi]
• Finding nearest neighbors in growth-restricted metricsDavid R. Karger, Matthias Ruhl. 741-750 [doi]
• Hardness amplification within NPRyan O Donnell. 751-760 [doi]
• On the power of unique 2-prover 1-round gamesSubhash Khot. 767-775 [doi]
• Learnability beyond AC0Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio. 776-784 [doi]
• Approximating the smallest grammar: Kolmogorov complexity in natural modelsMoses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat. 792-801 [doi]
• Limits to list decodability of linear codesVenkatesan Guruswami. 802-811 [doi]
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabetsVenkatesan Guruswami, Piotr Indyk. 812-821 [doi]