Conferences in DBLP

Conference on Computational Complexity / (coco)
2002 (conf/coco/2002)

1. Ran Raz
   Resolution Lower Bounds for the Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:3- [Conf]
   
2. Eli Ben-Sasson
   Hard Examples for Bounded Depth Frege. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:4- [Conf]
   
3. Uriel Feige
   Relations between Average Case Complexity and Approximation Complexity. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:5- [Conf]
   
4. Jonas Holmerin
   Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:6- [Conf]
   
5. Daniele Micciancio
   Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:9- [Conf]
   
6. D. Sivakumar
   Algorithmic Derandomization via Complexity Theory. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:10- [Conf]
   
7. Christopher Umans
   Pseudo-Random Generators for All Hardnesses. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:11- [Conf]
   
8. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
   Randomness Conductors and Constant-Degree Lossless Expanders. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:15- [Conf]
   
9. Roy Meshulam, Avi Wigderson
   Expanders from Symmetric Codes. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:16- [Conf]
   
10. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
    The Complexity of Approximating the Entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:17- [Conf]
    
11. Paul Beame, Erik Vee
    Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:18- [Conf]
    
12. Ashwin Nayak, Julia Salzman
    On Communication over an Entanglement-Assisted Quantum Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:19- [Conf]
    
13. Ryan O'Donnell
    Hardness Amplification within NP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:23- [Conf]
    
14. Ian Agol, Joel Hass, William P. Thurston
    3-MANIFOLD KNOT GENUS is NP-complete. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:24- [Conf]
    
15. Subhash Khot
    On the Power of Unique 2-Prover 1-Round Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:25- [Conf]
    
16. Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
    Learnability beyond AC0. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:26- [Conf]
    
17. Alexander A. Razborov
    Resolution Lower Bounds for Perfect Matching Principles. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:29-38 [Conf]
    
18. Stefan S. Dantchev
    Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:39-43 [Conf]
    
19. Uriel Feige, Daniele Micciancio
    The Inapproximability of Lattice and Coding Problems with Preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:44-52 [Conf]
    
20. Miklós Ajtai, Ravi Kumar, D. Sivakumar
    Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:53-57 [Conf]
    
21. Lance Fortnow
    The History of Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:61- [Conf]
    
22. Frederic Green
    The Correlation Between Parity and Quadratic Polynomials Mod 3. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:65-72 [Conf]
    
23. Eldar Fischer, Ilan Newman
    Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:73-79 [Conf]
    
24. Philipp Woelfel
    On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:80-89 [Conf]
    
25. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    Information Theory Methods in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:93-102 [Conf]
    
26. Andris Ambainis, Adam Smith, Ke Yang
    Extracting Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:103-112 [Conf]
    
27. Markus Bläser
    Algebras of Minimal Rank over Perfect Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:113-122 [Conf]
    
28. Peter Winkler
    Rapid Mixing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:125- [Conf]
    
29. Luca Trevisan, Salil P. Vadhan
    Pseudorandomness and Average-Case Complexity via Uniform Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:129-138 [Conf]
    
30. Manindra Agrawal
    Pseudo-Random Generators and Structure of Complete Degrees. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:139-147 [Conf]
    
31. Venkatesan Guruswami, Madhu Sudan
    Decoding Concatenated Codes using Soft Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:148-157 [Conf]
    
32. John Watrous
    Arthur and Merlin in a Quantum World. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:161- [Conf]
    
33. Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel
    Streaming Computation of Combinatorial Objects. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:165-174 [Conf]
    
34. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
    Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:175-183 [Conf]
    
35. Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
    Better Lower Bounds for Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:184-193 [Conf]
    
36. Boaz Barak, Oded Goldreich
    Universal Arguments and their Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:194-203 [Conf]