CSDL - Proceedings C

Committees (PDF)

pp. x

Ron Book Prize for Best Student Paper (PDF)

pp. xi

2002 Best Paper Award (PDF)

pp. xii

Session 1: Joint Session with STOC 2002

Resolution Lower Bounds for the Weak Pigeonhole Principle (PDF)

Ran Raz, Weizmann Institute

pp. 0003

Hard Examples for Bounded Depth Frege (PDF)

E. Ben-Sasson

pp. 0004

Relations between Average Case Complexity and Approximation Complexity (PDF)

Uriel Feige, Weizmann Institute

pp. 0005

Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon (PDF)

Jonas Holmerin, Royal Institute of Technology

pp. 0006

Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection (PDF)

Session 2: Joint Session with STOC 2002

Daniele Micciancio, University of California aT San Diego

pp. 0009

Algorithmic Derandomization via Complexity Theory (PDF)

D. Sivakumar, IBM Almaden Research Center

pp. 0010

Pseudo-Random Generators for All Hardnesses (PDF)

Christopher Umans, Microsoft Research

pp. 0011

Session 3: Joint Session with STOC 2002

Randomness Conductors and Constant-Degree Lossless Expanders (PDF)

Michael Capalbo, Institute for Advanced Study

Omer Reingold, AT&T Labs

Salil Vadhan, Harvard University

Avi Wigderson, Hebrew University at Jerusalem and Institute for Advanced Study

pp. 0015

Expanders from Symmetric Codes (PDF)

pp. 0016

The Complexity of Approximating the Entropy (PDF)

Tugkan Batu, University of Pennsylvania

Sanjoy Dasgupta, AT&T Labs-Research

Ravi Kumar, IBM Almaden Research Center

Ronitt Rubinfeld, NEC Research Institute

pp. 0017

Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems (PDF)

Paul Beame, University of Washington

Erik Vee, University of Washington

pp. 0018

On Communication over an Entanglement-Assisted Quantum Channel (PDF)

Ashwin Nayak, California Institute of Technology

Julia Salzman, Princeton University

pp. 0019

Session 4: Joint Session with STOC 2002

Hardness Amplification within NP (PDF)

R. O'Donnell

pp. 0023

3-MANIFOLD KNOT GENUS is NP-complete (PDF)

Ian Agol, University of Illinois at Chicago

Joel Hass, University of California at Davis

William Thurston, University of California at Davis

pp. 0024

On the Power of Unique 2-Prover 1-Round Games (PDF)

Subhash Khot, Princeton University

pp. 0025

Learnability beyond AC0 (PDF)

pp. 0026

Session 5

Resolution Lower Bounds for Perfect Matching Principles (Abstract)

Alexander A. Razborov, Institute for Advanced Study and Steklov Mathematical Institute

pp. 0029

PDF

Resolution Width-Size Trade-offs for the Pigeon-Hole Principle (Abstract)

Stefan Dantchev, University of Aarhus

pp. 0039

PDF

The Inapproximability of Lattice and Coding Problems with Preprocessing (Abstract)

Uriel Feige, Weizmann Institute of Science

Daniele Micciancio, University of California at San Diego

pp. 0044

PDF

Sampling Short Lattice Vectors and the Closest Lattice Vector Problem (Abstract)

Miklos Ajtai, IBM Almaden Research Center

Ravi Kumar, IBM Almaden Research Center

D. Sivakumar, IBM Almaden Research Center

pp. 0053

PDF

Invited Address 1

The History of Complexity (PDF)

Lance Fortnow, NEC Research Institute

pp. 0061

Session 6

The Correlation Between Parity and Quadratic Polynomials Mod 3 (Abstract)

Frederic Green, Clark University

pp. 0065

PDF

Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable (Abstract)

Eldar Fischer, The Technion

Ilan Newman, University of Haifa and NEC Research Institute

pp. 0073

PDF

On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism (Abstract)

Philipp Woelfel, University of Dortmund

pp. 0080

PDF

Session 7

Information Theory Methods in Communication Complexity (Abstract)

Ziv Bar-Yossef, University of California at Berkeley

T. S. Jayram, IBM Almaden Research Center

Ravi Kumar, IBM Almaden Research Center

D. Sivakumar, IBM Almaden Research Center

pp. 0093

PDF

Extracting Quantum Entanglement (Abstract)

Andris Ambainis, Institute for Advanced Study

Adam Smith, Massachusetts Institute of Technology

Ke Yang, Carnegie Mellon University

pp. 0103

PDF

Algebras of Minimal Rank over Perfect Fields (Abstract)

Markus Bläser, Universit?t Luebeck

pp. 0113

PDF

Invited Address 2

Rapid Mixing (PDF)

Peter Winkler, Bell Laboratories

pp. 0125

Session 8

Pseudorandomness and Average-Case Complexity via Uniform Reductions (Abstract)

Luca Trevisan, University of California at Berkeley

Salil Vadhan, Harvard University

pp. 0129

PDF

Pseudo-Random Generators and Structure of Complete Degrees (Abstract)

Manindra Agrawal, Indian Institute of Technology at Kanpur

pp. 0139

PDF

Decoding Concatenated Codes using Soft Information (Abstract)

Venkatesan Guruswami, University of California at Berkeley

Madhu Sudan, Massachusetts Institute of Technology

pp. 0148

PDF

Survey Talk 1

Arthur and Merlin in a Quantum World (PDF)

John Watrous, University of Calgary

pp. 0161

Session 9

Streaming Computation of Combinatorial Objects (Abstract)

Ziv Bar-Yossef, University of California at Berkeley

Luca Trevisan, University of California at Berkeley

Omer Reingold, AT&T Labs - Research

Ronen Shaltiel, Weizmann Institute of Science

pp. 0165

PDF

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval (Abstract)

Oded Goldreich, Weizmann Institute of Science

Howard Karloff, AT&T Labs

Leonard J. Schulman, Caltech

Luca Trevisan, University of California at Berkeley

pp. 0175

PDF

Better Lower Bounds for Locally Decodable Codes (Abstract)

Amit Deshpande, Chennai Mathematical Institute

Rahul Jain, Tata Institute of Fundamental Research

T. Kavitha, Tata Institute of Fundamental Research

Jaikumar Radhakrishnan, Tata Institute of Fundamental Research

Satyanarayana V. Lokam, University of Michigan

pp. 0184

PDF

Universal Arguments and their Applications (Abstract)

Boaz Barak, Weizmann Institute of Science

Oded Goldreich, Weizmann Institute of Science

pp. 0194

PDF

Author Index (PDF)

pp. 0205