Bruno Serra Loff Barreto


AuthID: R-002-9K3

Confirmed Publications: 37



1
TITLE: Communication Complexity is NP-hard
AUTHORS: Shuichi Hirahara; Rahul Ilango; Bruno Loff ;
PUBLISHED: 2025, SOURCE: Electron. Colloquium Comput. Complex., VOLUME: TR25
INDEXED IN: DBLP
2
TITLE: Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
AUTHORS: Bruno Bauwens; Bruno Loff ;
PUBLISHED: 2025, SOURCE: CoRR, VOLUME: abs/2504.16311
INDEXED IN: DBLP
3
TITLE: The Hardness of Decision Tree Complexity  Full Text
AUTHORS: Loff, Bruno ; Milovanov, Alexey;
PUBLISHED: 2025, SOURCE: 42nd International Symposium on Theoretical Aspects of Computer Science-STACS in 42ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2025, VOLUME: 327
INDEXED IN: Scopus WOS DBLP
4
TITLE: A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity
AUTHORS: Pavel Dvorák; Bruno Loff ; Suhail Sherif;
PUBLISHED: 2024, SOURCE: CoRR, VOLUME: abs/2409.04592
INDEXED IN: DBLP
5
TITLE: Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy  Full Text
AUTHORS: Assadi, Sepehr; Ghosh, Prantar; Loff, Bruno ; Mittal, Parth; Mukhopadhyay, Sagnik;
PUBLISHED: 2024, SOURCE: 39th Conference on Computational Complexity-CCC-Annual in 39TH COMPUTATIONAL COMPLEXITY CONFERENCE, CCC 2024, VOLUME: 300
INDEXED IN: Scopus WOS DBLP
6
TITLE: Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games
AUTHORS: Bruno Loff ; Mateusz Skomra;
PUBLISHED: 2024, SOURCE: ICALP, VOLUME: 297
INDEXED IN: Scopus DBLP
7
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: ITCS, VOLUME: 215
INDEXED IN: Scopus DBLP
IN MY: ORCID
8
TITLE: Memory Compression with Quantum Random-Access Gates
AUTHORS: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLISHED: 2022, SOURCE: TQC, VOLUME: 232
INDEXED IN: Scopus DBLP
IN MY: ORCID
9
TITLE: Hardness of Constant-Round Communication Complexity  Full Text
AUTHORS: Shuichi Hirahara; Rahul Ilango; Bruno Loff ;
PUBLISHED: 2021, SOURCE: CCC, VOLUME: 200
INDEXED IN: Scopus DBLP
IN MY: ORCID
10
TITLE: Lower Bounds for Semi-adaptive Data Structures via Corruption
AUTHORS: Pavel Dvorák; Bruno Loff ;
PUBLISHED: 2020, SOURCE: FSTTCS
INDEXED IN: DBLP
IN MY: ORCID
Page 1 of 4. Total results: 37.

footer slogan

Useful Links

Get Help

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