Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 33



21
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLISHED: 2013, SOURCE: 2013 IEEE Conference on Computational Complexity, CCC 2013 in Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013
INDEXED IN: Scopus DBLP CrossRef: 10
IN MY: ORCID | DBLP | CIÊNCIAVITAE
22
TITLE: Monotonicity Constraints in Characterizations of PSPACE
AUTHORS: Amir M Ben Amram; Bruno Loff ; Isabel Oitavem ;
PUBLISHED: 2012, SOURCE: JOURNAL OF LOGIC AND COMPUTATION, VOLUME: 22, ISSUE: 2
INDEXED IN: Scopus WOS DBLP CrossRef: 3
IN MY: ORCID | DBLP | CIÊNCIAVITAE
23
TITLE: Reductions to the Set of Random Strings: The Resource-Bounded Case  Full Text
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
PUBLISHED: 2012, SOURCE: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, VOLUME: 7464, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 3
IN MY: ORCID | DBLP | CIÊNCIAVITAE
24
TITLE: Derandomizing from Random Strings
AUTHORS: Harry Buhrman; Fortnow, Lance ; Koucky, Michal ; Bruno Loff ;
PUBLISHED: 2010, SOURCE: 25th Annual IEEE Conference on Computational Complexity, CCC 2010 in Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010
INDEXED IN: Scopus DBLP CrossRef: 6
IN MY: ORCID | DBLP | CIÊNCIAVITAE
25
TITLE: A foundation for real recursive function theory  Full Text
AUTHORS: Jose Felix Costa ; Bruno Loff ; Jerzy Mycka;
PUBLISHED: 2009, SOURCE: 3rd Conference CiE 2007 - Computation and Logic in the Real World in ANNALS OF PURE AND APPLIED LOGIC, VOLUME: 160, ISSUE: 3
INDEXED IN: Scopus WOS DBLP CrossRef: 7
IN MY: ORCID | DBLP | CIÊNCIAVITAE
26
TITLE: Computational complexity with experiments as oracles. II. Upper bounds
AUTHORS: Edwin Beggs; Jose Felix Costa ; Bruno Loff ; Tucker, JV;
PUBLISHED: 2009, SOURCE: PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, VOLUME: 465, ISSUE: 2105
INDEXED IN: Scopus WOS CrossRef: 18
IN MY: ORCID | CIÊNCIAVITAE
27
TITLE: Five Views of Hypercomputation
AUTHORS: Bruno Loff ; Jose Felix Costa ;
PUBLISHED: 2009, SOURCE: INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, VOLUME: 5, ISSUE: 3-4
INDEXED IN: Scopus WOS DBLP
IN MY: ORCID | DBLP | CIÊNCIAVITAE
28
TITLE: Computational complexity with experiments as oracles
AUTHORS: Edwin Beggs; Jose Felix Costa ; Bruno Loff ; John V Tucker;
PUBLISHED: 2008, SOURCE: PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, VOLUME: 464, ISSUE: 2098
INDEXED IN: Scopus WOS CrossRef: 25
IN MY: ORCID | CIÊNCIAVITAE
29
TITLE: Differential equations, infinite limits and real recursive functions
AUTHORS: Jose Felix Costa ; Bruno Loff ; Jerzy Mycka;
PUBLISHED: 2008, SOURCE: Applied Computing Conference 2008 in COMPUTATIONAL METHODS AND APPLIED COMPUTING
INDEXED IN: WOS
IN MY: ORCID
30
TITLE: On the complexity of measurement in classical physics
AUTHORS: Edwin Beggs; Jose Felix Costa ; Bruno Loff ; John Tucker;
PUBLISHED: 2008, SOURCE: 5th International Conference on Theory and Applications of Models of Computation in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, VOLUME: 4978
INDEXED IN: Scopus WOS DBLP
IN MY: ORCID | DBLP | CIÊNCIAVITAE
Page 3 of 4. Total results: 33.

footer slogan

Useful Links

Get Help

© 2025 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service