Bruno Loff
Bruno Loff
University of Porto and INESC-Tec
Verified email at fc.up.pt - Homepage
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
522008
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
382014
Simulation theorems via pseudo-random properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28 (4), 617-659, 2019
34*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 (3), 749-781, 2016
342016
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
292009
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
232008
Derandomizing from random strings
H Buhrman, L Fortnow, M Koucký, B Loff
2010 IEEE 25th Annual Conference on Computational Complexity, 58-63, 2010
212010
Oracles and advice as measurements
E Beggs, JF Costa, B Loff, JV Tucker
International Conference on Unconventional Computation, 33-50, 2008
212008
Five Views of Hypercomputation.
B Loff, JF Costa
Int. J. Unconv. Comput. 5 (3-4), 193-207, 2009
192009
Computability on reals, infinite limits and differential equations
B Loff, JF Costa, J Mycka
Applied Mathematics and Computation 191 (2), 353-371, 2007
162007
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
152018
Catalytic space: non-determinism and hierarchy
H Buhrman, M Koucký, B Loff, F Speelman
Theory of Computing Systems 62 (1), 116-135, 2018
142018
Reductions to the set of random strings: The resource-bounded case
B Loff, L Friedman, H Buhrman, E Allender
Logical Methods in Computer Science 10, 2014
14*2014
Lifting theorems for equality
B Loff, S Mukhopadhyay
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
13*2019
A foundation for real recursive function theory
JF Costa, B Loff, J Mycka
Annals of Pure and Applied Logic 160 (3), 255-288, 2009
9*2009
NP-hardness of circuit minimization for multi-output functions
R Ilango, B Loff, IC Oliveira
35th Computational Complexity Conference (CCC 2020), 2020
82020
A functional characterisation of the analytical hierarchy
B Loff
Computability in Europe, 247-256, 2007
82007
The new promise of analog computation
B Loff, JF Costa, J Mycka
Computability in Europe, 2007
7*2007
Hardness of approximation for knapsack problems
H Buhrman, B Loff, L Torenvliet
Theory of Computing Systems 56 (2), 372-393, 2015
5*2015
The computational power of parsing expression grammars
B Loff, N Moreira, R Reis
Journal of Computer and System Sciences 111, 1-21, 2020
42020
The system can't perform the operation now. Try again later.
Articles 1–20