Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 33



11
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2018, SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, ISSUE: 1
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
12
TITLE: Simulation Beats Richness: New Data-Structure Lower Bounds
AUTHORS: Arkadev Chattopadhyay; Michal Koucky; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLISHED: 2018, SOURCE: 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC) in STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING
INDEXED IN: Scopus WOS DBLP CrossRef: 7
IN MY: ORCID | DBLP
13
TITLE: The Computational Power of Parsing Expression Grammars
AUTHORS: Bruno Loff ; Nelma Moreira ; Rogério Reis ;
PUBLISHED: 2018, SOURCE: 22nd International Conference on Developments in Language Theory, DLT 2018 in Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, VOLUME: 11088
INDEXED IN: Scopus DBLP CrossRef: 3
IN MY: ORCID | DBLP
14
TITLE: Lower Bounds for Elimination via Weak Regularity
AUTHORS: Arkadev Chattopadhyay; Pavel Dvorák; Koucky, Michal ; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLISHED: 2017, SOURCE: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017 in 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, VOLUME: 66
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
15
TITLE: Catalytic Space: Non-determinism and Hierarchy  Full Text
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2016, SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, ISSUE: 1
INDEXED IN: Scopus DBLP CrossRef: 4
IN MY: ORCID | DBLP
16
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLISHED: 2016, SOURCE: Algorithmica, VOLUME: 76, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 4
IN MY: ORCID | DBLP
17
TITLE: Hardness of Approximation for Knapsack Problems  Full Text
AUTHORS: Harry Buhrman; Bruno Loff ; Leen Torenvliet;
PUBLISHED: 2015, SOURCE: Theory Comput. Syst., VOLUME: 56, ISSUE: 2
INDEXED IN: Scopus DBLP CrossRef: 5
IN MY: ORCID | DBLP
18
TITLE: Computing with a full memory: catalytic space. catalytic space
AUTHORS: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2014, SOURCE: 4th Annual ACM Symposium on Theory of Computing, STOC 2014 in Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014
INDEXED IN: Scopus DBLP CrossRef: 8
IN MY: ORCID | DBLP
19
TITLE: Reductions to the set of random strings: The resource-bounded case PDF  Full Text
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
PUBLISHED: 2014, SOURCE: 37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012 in Logical Methods in Computer Science, VOLUME: 10, ISSUE: 3
INDEXED IN: Scopus DBLP arXiv CrossRef: 4
IN MY: ORCID | DBLP
20
TITLE: Learning Reductions to Sparse Sets
AUTHORS: Harry Buhrman; Fortnow, Lance ; John M Hitchcock; Bruno Loff ;
PUBLISHED: 2013, SOURCE: 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 in Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, VOLUME: 8087
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
Page 2 of 4. Total results: 33.

A place for researchers and their institutions

Useful Links

Get Help

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