Conferences in DBLP
Awards. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:- [Conf ] Committees. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:- [Conf ] Preface. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:- [Conf ] Neeraj Kayal , Nitin Saxena On the Ring Isomorphism and Automorphism Problems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:2-12 [Conf ] Vikraman Arvind , Piyush P. Kurur , T. C. Vijayaraghavan Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:13-27 [Conf ] Thanh Minh Hoang , Thomas Thierauf The Complexity of the Inertia and Some Closure Properties of GapL. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:28-37 [Conf ] Ryan Williams Better Time-Space Lower Bounds for SAT and Related Problems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:40-49 [Conf ] Paul Beame , Toniann Pitassi , Nathan Segerlind , Avi Wigderson A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:52-66 [Conf ] Amos Beimel , Enav Weinreb Monotone Circuits for Weighted Threshold Functions. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:67-75 [Conf ] Sophie Laplante , Troy Lee , Mario Szegedy The Quantum Adversary Method and Classical Formula Size Lower Bounds. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:76-90 [Conf ] Andrej Bogdanov , Hoeteck Wee More on Noncommutative Polynomial Identity Testing. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:92-99 [Conf ] Ingo Wegener , Philipp Woelfel New Results on the Complexity of the Middle Bit of Multiplication. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:100-110 [Conf ] Richard J. Lipton , Evangelos Markakis , Aranyak Mehta , Nisheeth K. Vishnoi On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:112-119 [Conf ] Eli Ben-Sasson , Oded Goldreich , Prahladh Harsha , Madhu Sudan , Salil P. Vadhan Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf ] Eldar Fischer , Lance Fortnow Tolerant Versus Intolerant Testing for Boolean Properties. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:135-140 [Conf ] Shuchi Chawla , Robert Krauthgamer , Ravi Kumar , Yuval Rabani , D. Sivakumar On the Hardness of Approximating Multicut and Sparsest-Cut. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:144-153 [Conf ] Venkatesan Guruswami , Subhash Khot Hardness of Max 3SAT with No Mixed Clauses. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:154-162 [Conf ] Sourav Chakraborty On the Sensitivity of Cyclically-Invariant Boolean Functions. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:163-167 [Conf ] Chi-Jen Lu , Shi-Chun Tsai , Hsin-Lung Wu On the Complexity of Hardness Amplification. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:170-182 [Conf ] Emanuele Viola On Constructing Parallel Pseudorandom Generators from One-Way Functions. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:183-197 [Conf ] Emanuele Viola Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:198-209 [Conf ] Ronen Shaltiel , Christopher Umans Pseudorandomness for Approximate Counting and Sampling. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:212-226 [Conf ] Lance Fortnow , Adam R. Klivans NP with Small Advice. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:228-234 [Conf ] Arfst Nickelsen , Birgit Schelm Average-Case Computations - Comparing AvgP, HP, and Nearly-P. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:235-242 [Conf ] Dan Gutfreund , Ronen Shaltiel , Amnon Ta-Shma If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:243-257 [Conf ] Benny Applebaum , Yuval Ishai , Eyal Kushilevitz Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:260-274 [Conf ] David P. Woodruff , Sergey Yekhanin A Geometric Approach to Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:275-284 [Conf ] Rahul Jain , Jaikumar Radhakrishnan , Pranab Sen Prior Entanglement, Message Compression and Privacy in Quantum Communication. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:285-296 [Conf ] Eric Allender , Samir Datta , Sambuddha Roy Topology Inside NC¹. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf ] Michael Alekhnovich , Allan Borodin , Joshua Buresh-Oppenheim , Russell Impagliazzo , Avner Magen , Toniann Pitassi Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf ] Lance Fortnow , Russell Impagliazzo , Valentine Kabanets , Christopher Umans On the Complexity of Succinct Zero-Sum Games. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:323-332 [Conf ] Gus Gutoski Upper Bounds for Quantum Interactive Proofs with Competing Provers. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:334-343 [Conf ] Bill Rosgen On the Hardness of Distinguishing Mixed-State Quantum Computations. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:344-354 [Conf ]