Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 25



1
TITLE: Lifting Theorems for Equality
AUTHORS: Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: 36th International Symposium on Theoretical Aspects of Computer Science (STACS) in 36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), VOLUME: 126, PUBLISHED: 2019
INDEXED IN: WOS DBLP
IN MY: ORCID | DBLP
2
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman;
SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, ISSUE: 1, PUBLISHED: 2018
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
3
TITLE: Simulation Beats Richness: New Data-Structure Lower Bounds
AUTHORS: Arkadev Chattopadhyay; Michal Koucky; Bruno Loff ; Sagnik Mukhopadhyay;
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, PUBLISHED: 2018
INDEXED IN: Scopus WOS DBLP CrossRef
IN MY: ORCID | DBLP
4
TITLE: The Computational Power of Parsing Expression Grammars
AUTHORS: Bruno Loff ; Nelma Moreira ; Rogério Reis ;
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, PUBLISHED: 2018
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
5
TITLE: Composition and Simulation Theorems via Pseudo-random Properties
AUTHORS: Arkadev Chattopadhyay; Michal Koucký; Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: Electronic Colloquium on Computational Complexity (ECCC), VOLUME: 24, PUBLISHED: 2017
INDEXED IN: DBLP
IN MY: ORCID | DBLP
6
TITLE: Lower Bounds for Elimination via Weak Regularity
AUTHORS: Arkadev Chattopadhyay; Pavel Dvorák; Michal Koucký; Bruno Loff ; Sagnik Mukhopadhyay;
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, PUBLISHED: 2017
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
7
TITLE: Catalytic Space: Non-determinism and Hierarchy  Full Text
AUTHORS: Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman;
SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, ISSUE: 1, PUBLISHED: 2016
INDEXED IN: Scopus DBLP CrossRef
IN MY: ORCID | DBLP
8
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
SOURCE: Algorithmica, VOLUME: 76, ISSUE: 3, PUBLISHED: 2016
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
9
TITLE: Hardness of Approximation for Knapsack Problems  Full Text
AUTHORS: Harry Buhrman; Bruno Loff ; Leen Torenvliet;
SOURCE: Theory Comput. Syst., VOLUME: 56, ISSUE: 2, PUBLISHED: 2015
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
10
TITLE: Computing with a full memory: catalytic space
AUTHORS: Harry Buhrman; Richard Cleve; Michal Koucký; Bruno Loff ; Florian Speelman;
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, PUBLISHED: 2014
INDEXED IN: Scopus DBLP CrossRef: 3
IN MY: ORCID | DBLP
Page 1 of 3. Total results: 25.

A place for researchers and their institutions

Useful Links

Get Help

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