Bruno Loff

Cited by

	All	Since 2018
Citations	522	273
h-index	15	9
i10-index	17	8

2006200720082009201020112012201320142015201620172018201920202021202220234 5 18 24 27 10 27 29 39 13 17 30 39 34 47 48 77 27

Public access

View all

11 articles

0 articles

available

not available

Based on funding mandates

Co-authors

José Félix CostaProfessor Associado de Matemática, Instituto Superior TécnicoVerified email at math.tecnico.ulisboa.pt
Harry BuhrmanGroup leader CWI & Distinguished Research Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at cwi.nl
Edwin BeggsCollege of Science, Swansea UniversityVerified email at swansea.ac.uk
Florian SpeelmanUniversity of Amsterdam, QuSoftVerified email at uva.nl
Sagnik MukhopadhyayLecturer in AlgorithmsVerified email at sheffield.ac.uk
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Arkadev ChattopadhyayAssociate Professor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Subhasree PatroQuSoft, Centrum Wiskunde and InformaticaVerified email at cwi.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooVerified email at uwaterloo.ca
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
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
Rogerio ReisProfessor of Computer Science, Universidade do PortoVerified email at dcc.fc.up.pt
Nelma MoreiraUniversidade do PortoVerified email at fc.up.pt
John HitchcockProfessor of Computer Science, University of WyomingVerified email at uwyo.edu
Amir Ben-AmramVerified email at cs.mta.ac.il

Bruno Loff

University of Porto and INESC-Tec

Verified email at fc.up.pt - Homepage

Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	53	2008
Simulation theorems via pseudo-random properties A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay computational complexity 28, 617-659, 2019	46*	2019
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	46	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	38	2020
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	37	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	32	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	26	2018
Oracles and advice as measurements E Beggs, JF Costa, B Loff, JV Tucker Unconventional Computing: 7th International Conference, UC 2008 Vienna …, 2008	24	2008
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
Lifting theorems for equality B Loff, S Mukhopadhyay 36th International Symposium on Theoretical Aspects of Computer Science …, 2019	20*	2019
Reductions to the Set of Random Strings: The Resource-Bounded Case. E Allender, H Buhrman, L Friedman, B Loff MFCS, 88-99, 2012	17	2012
Catalytic space: non-determinism and hierarchy H Buhrman, M Koucký, B Loff, F Speelman Theory of Computing Systems 62, 116-135, 2018	16	2018
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
The computational power of parsing expression grammars B Loff, N Moreira, R Reis Journal of Computer and System Sciences 111, 1-21, 2020	12	2020
A foundation for real recursive function theory JF Costa, B Loff, J Mycka Annals of Pure and Applied Logic 160 (3), 255-288, 2009	11	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	9	2021
Hardness of approximation for knapsack problems H Buhrman, B Loff, L Torenvliet Theory of Computing Systems 56, 372-393, 2015	9*	2015
The new promise of analog computation B Loff, JF Costa, J Mycka Computability in Europe, 2007	8*	2007

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