Abstract is missing.
- Game Theory and Mathematical Economics: A Theoretical Computer Scientist s IntroductionChristos H. Papadimitriou. 4-8
- Algorithmic Applications of Low-Distortion Geometric EmbeddingsPiotr Indyk. 10-33
- Coding Theory: Tutorial and SurveyMadhu Sudan. 36-53
- Almost Tight Upper Bounds for Vertical Decompositions in Four DimensionsVladlen Koltun. 56-65
- Approximate Shape Fitting via LinearizationSariel Har-Peled, Kasturi R. Varadarajan. 66-73
- On the Complexity of Many Faces in Arrangements of CirclesPankaj K. Agarwal, Boris Aronov, Micha Sharir. 74-83
- Clustering MotionSariel Har-Peled. 84-93
- A Replacement for Voronoi Diagrams of Near Linear SizeSariel Har-Peled. 94-103
- How to Go Beyond the Black-Box Simulation BarrierBoaz Barak. 106-115
- Resettably-Sound Zero-Knowledge and its ApplicationsBoaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell. 116-125
- Universally Composable Security: A New Paradigm for Cryptographic ProtocolsRan Canetti. 136-145
- Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)Anupam Gupta, Amit Kumar, Rajeev Rastogi. 148-157
- Simple Routing Strategies for Adversarial SystemsBaruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler. 158-167
- Source Routing and Scheduling in Packet NetworksMatthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang. 168-177
- The Natural Work-Stealing Algorithm is StablePetra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg. 178-187
- Lower Bounds for Polynomial Calculus: Non-Binomial CaseMichael Alekhnovich, Alexander A. Razborov. 190-199
- Resolution is Not Automatizable Unless W[P] is TractableMichael Alekhnovich, Alexander A. Razborov. 210-219
- Planar Tautologies Hard for ResolutionStefan S. Dantchev, Søren Riis. 220-229
- Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear TimeJittat Fakcharoenphol, Satish Rao. 232-241
- Vickrey Prices and Shortest Paths: What is an Edge Worth?John Hershberger, Subhash Suri. 252-259
- Fully Dynamic All Pairs Shortest Paths with Real Edge WeightsCamil Demetrescu, Giuseppe F. Italiano. 260-267
- Informational Complexity and the Direct Sum Problem for Simultaneous Message ComplexityAmit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao. 270-278
- How Powerful is Adiabatic Quantum Computation?Wim van Dam, Michele Mosca, Umesh V. Vazirani. 279-287
- Lower Bounds for Quantum Communication ComplexityHartmut Klauck. 288-297
- The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial TimeHubert Comon, Guillem Godoy, Robert Nieuwenhuis. 298-307
- On the Average-Case Hardness of CVPJin-yi Cai. 308-317
- Approximating Directed MulticutsJoseph Cheriyan, Howard J. Karloff, Yuval Rabani. 320-328
- Facility Location with Nonuniform Hard CapacitiesMartin Pál, Éva Tardos, Tom Wexler. 329-338
- An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity ProblemLisa Fleischer, Kamal Jain, David P. Williamson. 339-347
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling ProblemsJulia Chuzhoy, Rafail Ostrovsky, Yuval Rabani. 348-356
- Lower Bounds for Matrix ProductAmir Shpilka. 358-367
- The Complexity of Factors of Multivariate PolynomialsPeter Bürgisser. 378-385
- Linear-time Recognition of Circular-arc GraphsRoss M. McConnell. 386-394
- A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related ProblemsYair Bartal, Béla Bollobás, Manor Mendel. 396-405
- Designing Networks IncrementallyAdam Meyerson, Kamesh Munagala, Serge A. Plotkin. 406-415
- Sorting and Selection with Structured CostsAnupam Gupta, Amit Kumar. 416-425
- Online Facility LocationAdam Meyerson. 426-431
- Testing Subgraphs in Large GraphsNoga Alon. 434-441
- Testing Random Variables for Independence and IdentityTugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White. 442-451
- Fast Monte-Carlo Algorithms for Approximate Matrix MultiplicationPetros Drineas, Ravi Kannan. 452-459
- Truthful Mechanisms for One-Parameter AgentsAaron Archer, Éva Tardos. 482-491
- Building Low-Diameter P2P NetworksGopal Pandurangan, Prabhakar Raghavan, Eli Upfal. 492-499
- Web Search via Hub SynthesisDimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry. 500-509
- Random Evolution in Massive GraphsWilliam Aiello, Fan R. K. Chung, Linyuan Lu. 510-519
- Spectral Partitioning of Random GraphsFrank McSherry. 529-537
- Unique Sink Orientations of CubesTibor Szabó, Emo Welzl. 547-555
- Arc-Disjoint Paths in Expander DigraphsTom Bohman, Alan M. Frieze. 558-567
- Glauber Dynamics on Trees and Hyperbolic GraphsClaire Kenyon, Elchanan Mossel, Yuval Peres. 568-578
- Randomly Colouring Graphs with Lower Bounds on Girth and Maximum DegreeMartin E. Dyer, Alan M. Frieze. 579-587
- Distributions on Level-Sets with Applications to Approximation AlgorithmsAravind Srinivasan. 588-597
- Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph ColoringSubhash Khot. 600-609
- Query Efficient PCPs with Perfect CompletenessJohan Håstad, Subhash Khot. 610-619
- S:::p:::::2:: subseteq ZPP:::NP:::Jin-yi Cai. 620-629
- Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and ApplicationsNoga Alon, Alexander Lubotzky, Avi Wigderson. 630-637
- Extractors from Reed-Muller CodesAmnon Ta-Shma, David Zuckerman, Shmuel Safra. 638-647
- Simple Extractors for All Min-Entropies and a New Pseudo-Random GeneratorRonen Shaltiel, Christopher Umans. 648-657
- Expander-Based Constructions of Efficiently Decodable CodesVenkatesan Guruswami, Piotr Indyk. 658-667