Abstract is missing.
- Resolution Lower Bounds for the Weak Pigeonhole PrincipleRan Raz. 3 [doi]
- Hard Examples for Bounded Depth FregeEli Ben-Sasson. 4 [doi]
- Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - /epsilonJonas Holmerin. 6 [doi]
- Improved Cryptographic Hash Functions with Worst-Case/Average-Case ConnectionDaniele Micciancio. 9 [doi]
- Algorithmic Derandomization via Complexity TheoryD. Sivakumar. 10 [doi]
- Pseudo-Random Generators for All HardnessesChristopher Umans. 11 [doi]
- Expanders from Symmetric CodesRoy Meshulam, Avi Wigderson. 16 [doi]
- The Complexity of Approximating the EntropyTugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld. 17 [doi]
- Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor ProblemsPaul Beame, Erik Vee. 18 [doi]
- On Communication over an Entanglement-Assisted Quantum ChannelAshwin Nayak, Julia Salzman. 19 [doi]
- On the Power of Unique 2-Prover 1-Round GamesSubhash Khot. 25 [doi]
- Learnability beyond AC0Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio. 26 [doi]
- Resolution Lower Bounds for Perfect Matching PrinciplesAlexander A. Razborov. 29-38 [doi]
- Resolution Width-Size Trade-offs for the Pigeon-Hole PrincipleStefan S. Dantchev. 39-43 [doi]
- Sampling Short Lattice Vectors and the Closest Lattice Vector ProblemMiklós Ajtai, Ravi Kumar, D. Sivakumar. 53-57 [doi]
- The History of ComplexityLance Fortnow. 61 [doi]
- Functions that have Read-Twice Constant Width Branching Programs are not Necessarily TestableEldar Fischer, Ilan Newman. 73-79 [doi]
- On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited NondeterminismPhilipp Woelfel. 80-89 [doi]
- Information Theory Methods in Communication ComplexityZiv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar. 93-102 [doi]
- Extracting Quantum EntanglementAndris Ambainis, Adam Smith, Ke Yang. 103-112 [doi]
- Rapid MixingPeter Winkler. 125 [doi]
- Pseudo-Random Generators and Structure of Complete DegreesManindra Agrawal. 139-147 [doi]
- Decoding Concatenated Codes using Soft InformationVenkatesan Guruswami, Madhu Sudan. 148-157 [doi]
- Streaming Computation of Combinatorial ObjectsZiv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel. 165-174 [doi]
- Lower Bounds for Linear Locally Decodable Codes and Private Information RetrievalOded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. 175-183 [doi]
- Better Lower Bounds for Locally Decodable CodesAmit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam. 184-193 [doi]
- Universal Arguments and their ApplicationsBoaz Barak, Oded Goldreich. 194-203 [doi]