Bruno Loff

Cited by

	All	Since 2020
Citations	658	331
h-index	16	10
i10-index	21	10

200620072008200920102011201220132014201520162017201820192020202120222023202420254 5 18 25 26 10 27 27 35 13 19 31 42 36 48 48 74 71 83 4

Public access

View all

12 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
José Félix CostaProfessor Catedrático de Matemática, Instituto Superior TécnicoVerified email at math.tecnico.ulisboa.pt
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Sagnik MukhopadhyayLecturer in AlgorithmsVerified email at sheffield.ac.uk
Florian SpeelmanUniversity of Amsterdam, QuSoftVerified email at uva.nl
Edwin BeggsCollege of Science, Swansea UniversityVerified email at swansea.ac.uk
Arkadev ChattopadhyayProfessor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Richard CleveInstitute for Quantum Computing, University of WaterlooVerified email at uwaterloo.ca
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Subhasree PatroEindhoven University of Technology and QuSoft, Centrum Wiskunde and InformaticaVerified email at tue.nl
Igor Carboni OliveiraUniversity of WarwickVerified email at dcs.warwick.ac.uk
Joshua BrodyAssociate Professor, Swarthmore CollegeVerified email at cs.swarthmore.edu
Leen TorenvlietILLC University of Amsterdam (retired)Verified email at uva.nl
Marten FolkertsmaPhDVerified email at cwi.nl
Niels NeumannTNO, QuSoftVerified email at tno.nl
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Nelma MoreiraUniversidade do PortoVerified email at fc.up.pt
Rogerio ReisProfessor of Computer Science, Universidade do PortoVerified email at dcc.fc.up.pt
John M. HitchcockProfessor of Computer Science, University of WyomingVerified email at uwyo.edu
Prantar GhoshAssistant Professor, Tennessee Technological UniversityVerified email at tntech.edu

Bruno Loff

LASIGE, Faculdade de Ciências da Universidade de Lisboa

Verified email at fc.up.pt - Homepage

Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	68	2014
NP-hardness of circuit minimization for multi-output functions R Ilango, B Loff, I Carboni Oliveira CCC'20: Proceedings of the 35th Computational Complexity Conference, 1-36, 2020	61	2020
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	56	2008
Simulation theorems via pseudo-random properties A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay computational complexity 28, 617-659, 2019	51*	2019
Towards a reverse newman’s theorem in interactive information complexity J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin Algorithmica 76, 749-781, 2016	40	2016
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
Catalytic space: Non-determinism and hierarchy H Buhrman, M Koucký, B Loff, F Speelman Theory of Computing Systems 62, 116-135, 2018	28	2018
State preparation by shallow circuits using feed forward H Buhrman, M Folkertsma, B Loff, NMP Neumann Quantum 8, 1552, 2024	27	2024
Oracles and advice as measurements E Beggs, JF Costa, B Loff, JV Tucker Unconventional Computing: 7th International Conference, UC 2008 Vienna …, 2008	25	2008
Lifting theorems for equality B Loff, S Mukhopadhyay Leibniz International Proceedings in Informatics, LIPIcs 126, 50, 2019	24*	2019
On the complexity of measurement in classical physics E Beggs, JF Costa, B Loff, J Tucker Theory and Applications of Models of Computation: 5th International …, 2008	24	2008
Derandomizing from random strings H Buhrman, L Fortnow, M Koucký, B Loff 2010 IEEE 25th Annual Conference on Computational Complexity, 58-63, 2010	23	2010
Five Views of Hypercomputation. B Loff, JF Costa Int. J. Unconv. Comput. 5 (3-4), 193-207, 2009	21	2009
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	17	2014
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	16	2021
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
Computability on reals, infinite limits and differential equations B Loff, JF Costa, J Mycka Applied Mathematics and Computation 191 (2), 353-371, 2007	16	2007
Memory compression with quantum random-access gates H Buhrman, B Loff, S Patro, F Speelman arXiv preprint arXiv:2203.05599, 2022	14	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

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors