Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 37



21
TITLE: Hardness of Approximation for Knapsack Problems
AUTHORS: Harry Buhrman; Bruno Loff ; Leen Torenvliet;
PUBLISHED: 2015, SOURCE: Theory Comput. Syst., VOLUME: 56, ISSUE: 2
INDEXED IN: Scopus DBLP CrossRef: 6
IN MY: ORCID
22
TITLE: Computing with a full memory: catalytic space. catalytic space  Full Text
AUTHORS: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2014, SOURCE: STOC
INDEXED IN: Scopus DBLP CrossRef: 21
IN MY: ORCID
23
TITLE: Reductions to the set of random strings: The resource-bounded case
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
PUBLISHED: 2014, SOURCE: Log. Methods Comput. Sci., VOLUME: 10, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 4
IN MY: ORCID
24
TITLE: Learning Reductions to Sparse Sets
AUTHORS: Harry Buhrman; Fortnow, Lance ; John M Hitchcock; Bruno Loff ;
PUBLISHED: 2013, SOURCE: MFCS, VOLUME: 8087 LNCS
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID
25
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLISHED: 2013, SOURCE: CCC
INDEXED IN: Scopus DBLP CrossRef: 10
IN MY: ORCID
26
TITLE: Monotonicity Constraints in Characterizations of PSPACE
AUTHORS: Ben Amram, AM; Loff, B ; Oitavem, I ;
PUBLISHED: 2012, SOURCE: JOURNAL OF LOGIC AND COMPUTATION, VOLUME: 22, ISSUE: 2
INDEXED IN: Scopus WOS DBLP CrossRef: 3
IN MY: ORCID
27
TITLE: Reductions to the Set of Random Strings: The Resource-Bounded Case
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
PUBLISHED: 2012, SOURCE: MFCS, VOLUME: 10, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 4
IN MY: ORCID
28
TITLE: Derandomizing from Random Strings  Full Text
AUTHORS: Harry Buhrman; Fortnow, Lance ; Koucky, Michal ; Bruno Loff ;
PUBLISHED: 2010, SOURCE: CCC
INDEXED IN: Scopus DBLP CrossRef: 7
IN MY: ORCID
29
TITLE: A foundation for real recursive function theory  Full Text
AUTHORS: Costa, JF ; Loff, B ; Mycka, J;
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: 8
IN MY: ORCID
30
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
Page 3 of 4. Total results: 37.

footer slogan

Useful Links

Get Help

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