On Small Hard Leaf Languages. - Falk Unger (MFCS, 2005)

New Limits on Fault-Tolerant Quantum Computation. - Harry Buhrman; Richard Cleve; Monique Laurent; Noah Linden; Alexander Schrijver; Falk Unger (FOCS, 2006)

Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. - Harry Buhrman; Leen Torenvliet; Falk Unger (STACS, 2006)

Noise threshold for universality of 2-input gates. - Falk Unger (ISIT, 2007)

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. - Richard Cleve; William Slofstra; Falk Unger; Sarvagya Upadhyay (Comput. Complex., 2008)

Noise Threshold for Universality of Two-Input Gates. - Falk Unger (IEEE Trans. Inf. Theory, 2008)

A Probabilistic Inequality with Applications to Threshold Direct-product Theorems. - Falk Unger (Electron. Colloquium Comput. Complex., 2009)

Sparse Selfreducible Sets and Nonuniform Lower Bounds. - Harry Buhrman; Leen Torenvliet; Falk Unger; Nikolai K. Vereshchagin (Electron. Colloquium Comput. Complex., 2010)

Better gates can make fault-tolerant computation impossible. - Falk Unger (Electron. Colloquium Comput. Complex., 2010)

Upper bounds on the noise threshold for fault-tolerant quantum computing. - Julia Kempe; Oded Regev 001; Falk Unger; Ronald de Wolf (Quantum Inf. Comput., 2010)

Stability of a spatial polling system with greedy myopic service. - Lasse Leskelä; Falk Unger (Ann. Oper. Res., 2012)

A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. - Ben W. Reichardt; Falk Unger; Umesh V. Vazirani (ITCS, 2013)

Classical command of quantum systems. - Ben W. Reichardt; Falk Unger; Umesh V. Vazirani (Nat., 2013)

Noisy Interactive Quantum Communication. - Gilles Brassard; Ashwin Nayak 001; Alain Tapp; Dave Touchette; Falk Unger (SIAM J. Comput., 2019)