Conferences in DBLP

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

1. Marius Zimand
   On Derandomizing Probabilistic Sublinear-Time Algorithms. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:1-9 [Conf]
   
2. Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
   The Communication Complexity of Correlation. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:10-23 [Conf]
   
3. Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf
   On Computation and Communication with Small Bias. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:24-32 [Conf]
   
4. Amit Chakrabarti
   Lower Bounds for Multi-Player Pointer Jumping. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:33-45 [Conf]
   
5. Luis Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto
   Low-Depth Witnesses are Easy to Find. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:46-51 [Conf]
   
6. Richard Chang, Suresh Purini
   Bounded Queries and the NP Machine Hypothesis. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:52-59 [Conf]
   
7. Wolfgang Merkle, Frank Stephan
   On C-Degrees, H-Degrees and T-Degrees. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:60-69 [Conf]
   
8. Ryan Williams
   Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:70-82 [Conf]
   
9. Alexander A. Sherstov
   Halfspace Matrices. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:83-95 [Conf]
   
10. Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
    Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf]
    
11. Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
    Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:109-114 [Conf]
    
12. Scott Aaronson, Greg Kuperberg
    Quantum versus Classical Proofs and Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:115-128 [Conf]
    
13. Andris Ambainis, Joseph Emerson
    Quantum t-designs: t-wise Independence in the Quantum World. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:129-140 [Conf]
    
14. Emanuele Viola, Avi Wigderson
    Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:141-154 [Conf]
    
15. Emanuele Viola
    On Approximate Majority and Probabilistic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:155-168 [Conf]
    
16. Kei Uchizawa, Eiji Takimoto
    An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:169-178 [Conf]
    
17. Uriel Feige, Guy Kindler, Ryan O'Donnell
    Understanding Parallel Repetition Requires Understanding Foams. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:179-192 [Conf]
    
18. Guillaume Malod
    The Complexity of Polynomials and Their Coefficient Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:193-204 [Conf]
    
19. Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
    A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:205-216 [Conf]
    
20. Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
    Directed Planar Reachability is in Unambiguous Log-Space. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:217-221 [Conf]
    
21. Mark Braverman, Raghav Kulkarni, Sambuddha Roy
    Parity Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:222-235 [Conf]
    
22. Kai-min Chung, Omer Reingold, Salil P. Vadhan
    S-T Connectivity on Digraphs with a Known Stationary Distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:236-249 [Conf]
    
23. Yijia Chen, Jörg Flum
    On Parameterized Path and Chordless Path Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:250-263 [Conf]
    
24. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
    Testing Properties of Constraint-Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:264-277 [Conf]
    
25. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Efficient Arguments without Short PCPs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:278-291 [Conf]
    
26. Jin-yi Cai, Pinyan Lu
    Bases Collapse in Holographic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:292-304 [Conf]
    
27. Jin-yi Cai, Vinay Choudhary, Pinyan Lu
    On the Theory of Matchgate Computations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:305-318 [Conf]
    
28. Iftach Haitner, Omer Reingold
    A New Interactive Hashing Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:319-332 [Conf]
    
29. Chris Peikert
    Limits on the Hardness of Lattice Problems in ell _p Norms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:333-346 [Conf]
    
30. Konstantin Pervyshev
    On Heuristic Time Hierarchies. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:347-358 [Conf]