| Limit on nonlocality in any world in which communication complexity is not trivial G Brassard, H Buhrman, N Linden, AA Méthot, A Tapp, F Unger Physical Review Letters 96 (25), 250401, 2006 | 357 | 2006 |
| Classical command of quantum systems BW Reichardt, F Unger, U Vazirani Nature 496 (7446), 456-460, 2013 | 305 | 2013 |
| Perfect parallel repetition theorem for quantum XOR proof systems R Cleve, W Slofstra, F Unger, S Upadhyay Computational Complexity 17 (2), 282-299, 2008 | 122 | 2008 |
| Implications of superstrong non-locality for cryptography H Buhrman, M Christandl, F Unger, S Wehner, A Winter Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2006 | 67 | 2006 |
| New limits on fault-tolerant quantum computation H Buhrman, R Cleve, M Laurent, N Linden, A Schrijver, F Unger 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 57 | 2006 |
| A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games BW Reichardt, F Unger, U Vazirani arXiv preprint arXiv:1209.0448, 2012 | 54 | 2012 |
| Young Turk social engineering: mass violence and the nation state in UU Üngör Turkish Studies 26 (1), 359-69, 2002 | 23* | 2002 |
| Noisy interactive quantum communication G Brassard, A Nayak, A Tapp, D Touchette, F Unger 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 296-305, 2014 | 21 | 2014 |
| Stability of a spatial polling system with greedy myopic service L Leskelä, F Unger Annals of Operations Research 198 (1), 165-183, 2012 | 20 | 2012 |
| A probabilistic inequality with applications to threshold direct-product theorems F Unger 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 221-229, 2009 | 17 | 2009 |
| Noise threshold for universality of two-input gates F Unger IEEE Transactions on Information Theory 54 (8), 3693-3698, 2008 | 17 | 2008 |
| Sempa: Software engineering for parallel scientific computing P Luksch, U Maier, S Rathmayer, M Weidmann, F Unger IEEE concurrency 5 (3), 64-72, 1997 | 13 | 1997 |
| Upper bounds on the noise threshold for fault-tolerant quantum computing J Kempe, O Regev, F Unger, R De Wolf International Colloquium on Automata, Languages, and Programming, 845-856, 2008 | 9 | 2008 |
| Better gates can make fault-tolerant computation impossible. F Unger Electron. Colloquium Comput. Complex. 17, 164, 2010 | 8 | 2010 |
| Annual IEEE Symposium on Foundations of Computer Science H Buhrman, R Cleve, M Laurent, N Linden, A Schrijver, F Unger IEEE Computer Society, 2006 | 8 | 2006 |
| Counterexamples to a conjecture of Woods O Regev, U Shapira, B Weiss Duke Mathematical Journal 166 (13), 2443-2446, 2017 | 7 | 2017 |
| Parallelization of a state-of-the-art industrial CFD package for execution on networks of workstations and massively parallel processors P Luksch, U Maier, S Rathmayer, F Unger, M Weidmann European Parallel Virtual Machine Conference, 45-52, 1996 | 7 | 1996 |
| Noise in classical and quantum computation and non-locality F Unger PhD thesis, University of Amsterdam, 2008 | 6 | 2008 |
| Noise threshold for universality of 2-input gates F Unger 2007 IEEE International Symposium on Information Theory, 1901-1905, 2007 | 6 | 2007 |
| SEMPA: Software Engineering Methods for Parallel Applications in Scientific Computing P Luksch, U Maier, S Rathmayer, M Weidmann, F Unger, P Bastian, ... Research Report Series LRR-TUM 12, 1998 | 6 | 1998 |
Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoftVerified email at cwi.nl
