| Computing with a full memory: catalytic space H Buhrman, R Cleve, M Koucký, B Loff, F Speelman Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 86 | 2014 |
| NP-hardness of circuit minimization for multi-output functions R Ilango, B Loff, IC Oliveira 35th Computational Complexity Conference (CCC 2020), 22: 1-22: 36, 2020 | 75 | 2020 |
| State preparation by shallow circuits using feed forward H Buhrman, M Folkertsma, B Loff, NMP Neumann Quantum 8, 1552, 2024 | 64 | 2024 |
| Simulation theorems via pseudo-random properties A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay computational complexity 28 (4), 617-659, 2019 | 59* | 2019 |
| Computational complexity with experiments as oracles E Beggs, JF Costa, B Loff, JV Tucker Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2008 | 58 | 2008 |
| Towards a reverse newman’s theorem in interactive information complexity J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin Algorithmica 76 (3), 749-781, 2016 | 39 | 2016 |
| Catalytic space: Non-determinism and hierarchy H Buhrman, M Koucký, B Loff, F Speelman Theory of Computing Systems 62 (1), 116-135, 2018 | 37 | 2018 |
| Computational complexity with experiments as oracles. II. Upper bounds E Beggs, JF Costa, B Loff, JV Tucker Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2009 | 36 | 2009 |
| Simulation beats richness: new data-structure lower bounds A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 28 | 2018 |
| Lifting theorems for equality B Loff, S Mukhopadhyay Leibniz International Proceedings in Informatics, LIPIcs 126, 50, 2019 | 27* | 2019 |
| Oracles and advice as measurements E Beggs, JF Costa, B Loff, JV Tucker International Conference on Unconventional Computation, 33-50, 2008 | 25 | 2008 |
| Derandomizing from random strings H Buhrman, L Fortnow, M Koucký, B Loff 2010 IEEE 25th Annual Conference on Computational Complexity, 58-63, 2010 | 24 | 2010 |
| On the complexity of measurement in classical physics E Beggs, JF Costa, B Loff, J Tucker International Conference on Theory and Applications of Models of Computation …, 2008 | 23 | 2008 |
| Five Views of Hypercomputation. B Loff, JF Costa Int. J. Unconv. Comput. 5 (3-4), 193-207, 2009 | 22 | 2009 |
| Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks H Buhrman, B Loff, S Patro, F Speelman arXiv preprint arXiv:2106.02005, 2021 | 21 | 2021 |
| Reductions to the set of random strings: The resource-bounded case E Allender, H Buhrman, L Friedman, B Loff Logical Methods in Computer Science 10, 2014 | 18 | 2014 |
| Computability on reals, infinite limits and differential equations B Loff, JF Costa, J Mycka Applied Mathematics and Computation 191 (2), 353-371, 2007 | 17 | 2007 |
| The computational power of parsing expression grammars B Loff, N Moreira, R Reis Journal of Computer and System Sciences 111, 1-21, 2020 | 16 | 2020 |
| Memory compression with quantum random-access gates H Buhrman, B Loff, S Patro, F Speelman arXiv preprint arXiv:2203.05599, 2022 | 15 | 2022 |
| A foundation for real recursive function theory JF Costa, B Loff, J Mycka Annals of Pure and Applied Logic 160 (3), 255-288, 2009 | 13 | 2009 |
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
