dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Falk Unger Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin: Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 17: 163 (2010)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: Better gates can make fault-tolerant computation impossible. Electronic Colloquium on Computational Complexity (ECCC) 17: 164 (2010)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Falk Unger, Ronald de Wolf: Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Information & Computation 10(5&6): 361-376 (2010)
2009
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems. FOCS 2009: 221-229
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: A Probabilistic Inequality with Applications to Threshold Direct-product Theorems. Electronic Colloquium on Computational Complexity (ECCC) 16: 78 (2009)
2008
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Falk Unger, Ronald de Wolf: Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay: Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Computational Complexity 17(2): 282-299 (2008)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: Noise Threshold for Universality of Two-Input Gates. IEEE Transactions on Information Theory 54(8): 3693-3698 (2008)
2007
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay: Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. IEEE Conference on Computational Complexity 2007: 109-114
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: Noise threshold for universality of 2-input gates CoRR abs/0711.0351: (2007)
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger: New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Leen Torenvliet, Falk Unger: Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFalk Unger: On Small Hard Leaf Languages. MFCS 2005: 781-792

Coauthor Index

1Harry Buhrman [2] [3] [13]
2Richard Cleve [3] [5] [7]
3Julia Kempe [8] [11]
4Monique Laurent [3]
5Noah Linden [3]
6Oded Regev [8] [11]
7Alexander Schrijver [3]
8William Slofstra [5] [7]
9Leen Torenvliet [2] [13]
10Sarvagya Upadhyay [5] [7]
11Nikolai K. Vereshchagin (Nikolay K. Vereshchagin) [13]
12Ronald de Wolf [8] [11]

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page