Search dblp for Publications

export results for "toc:db/conf/coco/coco2006.bht:"

 download as .bib file

@inproceedings{DBLP:conf/coco/Aaronson06,
  author       = {Scott Aaronson},
  title        = {QMA/qpoly {\textbackslash}subseteq PSPACE/poly: De-Merlinizing Quantum
                  Protocols},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {261--273},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.36},
  doi          = {10.1109/CCC.2006.36},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Aaronson06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Aaronson06a,
  author       = {Scott Aaronson},
  title        = {Oracles Are Subtle But Not Malicious},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {340--354},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.32},
  doi          = {10.1109/CCC.2006.32},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Aaronson06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AllenderBCDR06,
  author       = {Eric Allender and
                  David A. Mix Barrington and
                  Tanmoy Chakraborty and
                  Samir Datta and
                  Sambuddha Roy},
  title        = {Grid Graph Reachability Problems},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {299--313},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.22},
  doi          = {10.1109/CCC.2006.22},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AllenderBCDR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AllenderBKM06,
  author       = {Eric Allender and
                  Peter B{\"{u}}rgisser and
                  Johan Kjeldgaard{-}Pedersen and
                  Peter Bro Miltersen},
  title        = {On the Complexity of Numerical Analysis},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {331--339},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.30},
  doi          = {10.1109/CCC.2006.30},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AllenderBKM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AllenderHMPS06,
  author       = {Eric Allender and
                  Lisa Hellerstein and
                  Paul McCabe and
                  Toniann Pitassi and
                  Michael E. Saks},
  title        = {Minimizing {DNF} Formulas and AC\({}^{\mbox{0}}\)\({}_{\mbox{d}}\)
                  Circuits Given a Truth Table},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {237--251},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.27},
  doi          = {10.1109/CCC.2006.27},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AllenderHMPS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Atserias06,
  author       = {Albert Atserias},
  title        = {Distinguishing {SAT} from Polynomial-Size Circuits, through Black-Box
                  Queries},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {88--95},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.17},
  doi          = {10.1109/CCC.2006.17},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Atserias06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BehlL06,
  author       = {Christoph Behle and
                  Klaus{-}J{\"{o}}rn Lange},
  title        = {FO[{\textless}]-Uniformity},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {183--189},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.20},
  doi          = {10.1109/CCC.2006.20},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BehlL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Buresh-OppenheimS06,
  author       = {Joshua Buresh{-}Oppenheim and
                  Rahul Santhanam},
  title        = {Making Hard Problems Harder},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {73--87},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.26},
  doi          = {10.1109/CCC.2006.26},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Buresh-OppenheimS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CalabroIP06,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Ramamohan Paturi},
  title        = {A Duality between Clause Width and Clause Density for {SAT}},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {252--260},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.6},
  doi          = {10.1109/CCC.2006.6},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/CalabroIP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenG06,
  author       = {Yijia Chen and
                  Martin Grohe},
  title        = {An Isomorphism between Subexponential and Parameterized Complexity
                  Theory},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {314--330},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.8},
  doi          = {10.1109/CCC.2006.8},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenG06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Feldman06,
  author       = {Vitaly Feldman},
  title        = {Optimal Hardness Results for Maximizing Agreements with Monomials},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {226--236},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.31},
  doi          = {10.1109/CCC.2006.31},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Feldman06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GavinskyKW06,
  author       = {Dmitry Gavinsky and
                  Julia Kempe and
                  Ronald de Wolf},
  title        = {Strengths and Weaknesses of Quantum Fingerprinting},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {288--298},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.39},
  doi          = {10.1109/CCC.2006.39},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GavinskyKW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Gopalan06,
  author       = {Parikshit Gopalan},
  title        = {Constructing Ramsey Graphs from Boolean Function Representations},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {115--128},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.14},
  doi          = {10.1109/CCC.2006.14},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Gopalan06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Hansen06,
  author       = {Kristoffer Arnsfelt Hansen},
  title        = {On Modular Counting with Polynomials},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {202--212},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.29},
  doi          = {10.1109/CCC.2006.29},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Hansen06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HavivR06,
  author       = {Ishay Haviv and
                  Oded Regev},
  title        = {Hardness of the Covering Radius Problem on Lattices},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {145--158},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.23},
  doi          = {10.1109/CCC.2006.23},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HavivR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KayalS06,
  author       = {Neeraj Kayal and
                  Nitin Saxena},
  title        = {Polynomial Identity Testing for Depth 3 Circuits},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {9--17},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.34},
  doi          = {10.1109/CCC.2006.34},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KayalS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KhotS06,
  author       = {Subhash Khot and
                  Rishi Saket},
  title        = {A 3-Query Non-Adaptive {PCP} with Perfect Completeness},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {159--169},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.5},
  doi          = {10.1109/CCC.2006.5},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KhotS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KouckyLPT06,
  author       = {Michal Kouck{\'{y}} and
                  Clemens Lautemann and
                  Sebastian Poloczek and
                  Denis Th{\'{e}}rien},
  title        = {Circuit Lower Bounds via Ehrenfeucht-Fraisse Games},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {190--201},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.12},
  doi          = {10.1109/CCC.2006.12},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KouckyLPT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MelkebeekP06,
  author       = {Dieter van Melkebeek and
                  Konstantin Pervyshev},
  title        = {A Generic Time Hierarchy for Semantic Models with One Bit of Advice},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {129--144},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.7},
  doi          = {10.1109/CCC.2006.7},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MelkebeekP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ODonnellS06,
  author       = {Ryan O'Donnell and
                  Rocco A. Servedio},
  title        = {Learning Monotone Decision Trees in Polynomial Time},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {213--225},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.25},
  doi          = {10.1109/CCC.2006.25},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ODonnellS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Pass06,
  author       = {Rafael Pass},
  title        = {Parallel Repetition of Zero-Knowledge Proofs and the Possibility of
                  Basing Cryptography on NP-Hardness},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {96--110},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.33},
  doi          = {10.1109/CCC.2006.33},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/Pass06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Pudlak06,
  author       = {Pavel Pudl{\'{a}}k},
  title        = {Godel and Computations (Abstract)},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {3--5},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.21},
  doi          = {10.1109/CCC.2006.21},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Pudlak06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Sen06,
  author       = {Pranab Sen},
  title        = {Random Measurement Bases, Quantum State Distinction and Applications
                  to the Hidden Subgroup Problem},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {274--287},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.37},
  doi          = {10.1109/CCC.2006.37},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Sen06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Servedio06,
  author       = {Rocco A. Servedio},
  title        = {Every Linear Threshold Function has a Low-Weight Approximator},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {18--32},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.18},
  doi          = {10.1109/CCC.2006.18},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Servedio06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Shaltiel06,
  author       = {Ronen Shaltiel},
  title        = {How to Get More Mileage from Randomness Extractors},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {46--60},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.24},
  doi          = {10.1109/CCC.2006.24},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Shaltiel06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Shpilka06,
  author       = {Amir Shpilka},
  title        = {Constructions of Low-Degree and Error-Correcting in-Biased Generators},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {33--45},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.15},
  doi          = {10.1109/CCC.2006.15},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/Shpilka06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Tourlakis06,
  author       = {Iannis Tourlakis},
  title        = {New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {170--182},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.28},
  doi          = {10.1109/CCC.2006.28},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Tourlakis06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Venkateswaran06,
  author       = {H. Venkateswaran},
  title        = {Derandomization of Probabilistic Auxiliary Pushdown Automata Classes},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {355--370},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.16},
  doi          = {10.1109/CCC.2006.16},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Venkateswaran06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Wigderson06,
  author       = {Avi Wigderson},
  title        = {Applications of the Sum-Product Theorem in Finite Fields},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {111},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.9},
  doi          = {10.1109/CCC.2006.9},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Wigderson06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X06,
  title        = {Preface},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.35},
  doi          = {10.1109/CCC.2006.35},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X06a,
  title        = {Committees},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.13},
  doi          = {10.1109/CCC.2006.13},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X06b,
  title        = {Reviewers},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.38},
  doi          = {10.1109/CCC.2006.38},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X06b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X06c,
  title        = {Awards},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.11},
  doi          = {10.1109/CCC.2006.11},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X06c.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Zimand06,
  author       = {Marius Zimand},
  title        = {Exposure-Resilient Extractors},
  booktitle    = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  pages        = {61--72},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CCC.2006.19},
  doi          = {10.1109/CCC.2006.19},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Zimand06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/coco/2006,
  title        = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
                  16-20 July 2006, Prague, Czech Republic},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://ieeexplore.ieee.org/xpl/conhome/11039/proceeding},
  isbn         = {0-7695-2596-2},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/2006.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.