42nd IEEE Symposium on Foundations of Computer Science [front matter] (PDF)

Forward (PDF)

Program Committee (PDF)

Reviewers (PDF)

Game Theory and Mathematical Economics: A Theoratical Computer Scientist's Introduction (Abstract)

Algorithmic Applications of Low-Distortion Geometric Embeddings (Abstract)

Coding Theory: Tutorial and Survey (Abstract)

Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions (Abstract)

Approximate Shape Fitting via Linearization (Abstract)

On the Complexity of Many Faces in Arrangements of Circles (Abstract)

Clustering Motion (Abstract)

A Replacement for Voronoi Diagrams of Near Linear Size (Abstract)

How to Go Beyond the Black-Box Simulation Barrier (Abstract)

Resettably-Sound Zero-Knowledge and its Applications (Abstract)

On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates (Abstract)

Universally Composable Security: A New Paradigm for Cryptographic Protocols (Abstract)

Traveling with a Pez Dispenser (Or, Routing Issues in MPLS) (Abstract)

Simple Routing Strategies for Adversarial Systems (Abstract)

Source Routing and Scheduling in Packet Networks (Abstract)

The Natural Work-Stealing Algorithm is Stable (Abstract)

Lower Bounds for Polynomial Calculus: Non-Binomial Case (Abstract)

Counting Axioms Do Not Polynomially Simulate Counting Gates (Abstract)

Resolution is Not Automatizable Unless W[P] is Tractable (Abstract)

"Planar" Tautologies Hard for Resolution (Abstract)

Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time (Abstract)

Compact Oracles for Reachability and Approximate Distances in Planar Digraphs (Abstract)

Vickrey Prices and Shortest Paths: What is an Edge Worth? (Abstract)

Fully Dynamic All Pairs Shortest Paths with Real Edge Weights (Abstract)

Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity (Abstract)

How Powerful is Adiabatic Quantum Computation? (Abstract)

Lower Bounds for Quantum Communication Complexity (Abstract)

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time (Abstract)

On the Average-Case Hardness of CVP (Abstract)

Approximating Directed Multicuts (Abstract)

Facility Location with Nonuniform Hard Capacities (Abstract)

An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem (Abstract)

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems (Abstract)

Lower Bounds for Matrix Product (Abstract)

Deterministic Computation of the Frobenius Form (Abstract)

The Complexity of Factors of Multivariate Polynomials (Abstract)

Linear-Time Recognition of Circular-Arc Graphs (Abstract)

A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems (Abstract)

Designing Networks Incrementally (Abstract)

Sorting and Selection with Structured Costs (Abstract)

Online Facility Location (Abstract)

Testing Subgraphs in Large Graphs (Abstract)

Testing Random Variables for Independence and Identity (Abstract)

Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication (Abstract)

Three Theorems Regarding Testing Graph Properties (Abstract)

Designing Networks for Selfish Users is Hard (Abstract)

Truthful Mechanisms for One-Parameter Agents (Abstract)

Building Low-Diameter P2P Networks (Abstract)

Web Search via Hub Synthesis (Abstract)

Random Evolution in Massive Graphs (Abstract)

Tight Approximation Results for General Covering Integer Programs (Abstract)

Spectral Partitioning of Random Graphs (Abstract)

Sequential and Parallel Algorithms for Mixed Packing and Covering (Abstract)

Unique Sink Orientations of Cubes (Abstract)

Arc-Disjoint Paths in Expander Digraphs (Abstract)

Glauber Dynamics onTrees and Hyperbolic Graphs (Abstract)

Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree (Abstract)

Distributions on Level-Sets with Applications to Approximation Algorithms (Abstract)

Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring (Abstract)

Query Efficient PCPs with Perfect Completeness (Abstract)

S^p _2 \subseteq ZPP^{NP} (Abstract)

Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications (Abstract)

Extractors from Reed-Muller Codes (Abstract)

Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator (Abstract)

Expander-Based Constructions of Efficiently Decodable Codes (Abstract)

Author Index (PDF)