Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 33



1
TITLE: Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks
AUTHORS: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLISHED: 2022, SOURCE: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., VOLUME: 215
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
2
TITLE: Memory Compression with Quantum Random-Access Gates
AUTHORS: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLISHED: 2022, SOURCE: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022 in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA., VOLUME: 232
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
3
TITLE: Hardness of Constant-Round Communication Complexity
AUTHORS: Shuichi Hirahara; Rahul Ilango; Bruno Loff ;
PUBLISHED: 2021, SOURCE: 36th Computational Complexity Conference, CCC 2021 in 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., VOLUME: 200
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
4
TITLE: Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
AUTHORS: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLISHED: 2021, SOURCE: CoRR, VOLUME: abs/2106.02005
INDEXED IN: DBLP
IN MY: ORCID | DBLP
5
TITLE: Lower Bounds for Semi-adaptive Data Structures via Corruption
AUTHORS: Pavel Dvorák; Bruno Loff ;
PUBLISHED: 2020, SOURCE: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference)., VOLUME: 182
INDEXED IN: DBLP
IN MY: ORCID | DBLP
6
TITLE: NP-Hardness of Circuit Minimization for Multi-Output Functions
AUTHORS: Rahul Ilango; Bruno Loff ; Igor Carboni Oliveira;
PUBLISHED: 2020, SOURCE: 35th Computational Complexity Conference, CCC 2020 in 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., VOLUME: 169
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
7
TITLE: The computational power of parsing expression grammars
AUTHORS: Bruno Loff ; Nelma Moreira ; Rogerio Reis ;
PUBLISHED: 2020, SOURCE: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, VOLUME: 111
INDEXED IN: Scopus WOS DBLP CrossRef: 6
IN MY: ORCID | DBLP | CIÊNCIAVITAE
8
TITLE: Lifting Theorems for Equality
AUTHORS: Bruno Loff ; Sagnik Mukhopadhyay;
PUBLISHED: 2019, 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
INDEXED IN: WOS DBLP
IN MY: ORCID | DBLP | CIÊNCIAVITAE
9
TITLE: Simulation Theorems via Pseudo-random Properties
AUTHORS: Arkadev Chattopadhyay; Koucky, Michal ; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLISHED: 2019, SOURCE: Comput. Complex., VOLUME: 28, ISSUE: 4
INDEXED IN: DBLP
IN MY: ORCID | DBLP
10
TITLE: Simulation Theorems via Pseudo-random Properties  Full Text
AUTHORS: Chattopadhyay, A; Koucky, M; Loff, B ; Mukhopadhyay, S;
PUBLISHED: 2019, SOURCE: COMPUTATIONAL COMPLEXITY, VOLUME: 28, ISSUE: 4
INDEXED IN: Scopus WOS DBLP CrossRef: 8
IN MY: ORCID | DBLP | CIÊNCIAVITAE
Page 1 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