Bruno Serra Loff Barreto


AuthID: R-002-9K3

Publications Requiring Validation

1
TITLE: The Hardness of Decision Tree Complexity
AUTHORS: Bruno Loff; Alexey Milovanov;
PUBLISHED: 2025, SOURCE: 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany, VOLUME: 327
INDEXED IN: DBLP
IN MY: DBLP
2
TITLE: Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games
AUTHORS: Bruno Loff; Mateusz Skomra;
PUBLISHED: 2024, SOURCE: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024 in 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia, VOLUME: 297
INDEXED IN: Scopus DBLP
IN MY: DBLP
3
TITLE: The hardness of decision tree complexity
AUTHORS: Bruno Loff; Alexey Milovanov;
PUBLISHED: 2024, SOURCE: Electron. Colloquium Comput. Complex., VOLUME: TR24
INDEXED IN: DBLP
IN MY: DBLP
4
TITLE: Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy
AUTHORS: Sepehr Assadi; Prantar Ghosh; Bruno Loff; Parth Mittal; Sagnik Mukhopadhyay;
PUBLISHED: 2024, SOURCE: 39th Computational Complexity Conference, CCC 2024 in 39th Computational Complexity Conference, CCC 2024, July 22-25, 2024, Ann Arbor, MI, USA, VOLUME: 300
INDEXED IN: Scopus DBLP
IN MY: DBLP
5
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
IN MY: DBLP

footer slogan

Useful Links

Get Help

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