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