Bruno Loff
Recent News
International Conference on Computational Complexity brings together researchers in LisbonThe ‘Complexity as a Kaleidoscope’ workshop proposed new ways of communicating research into complexity
LASIGE publishes in the Quantum journal
LASIGE Workshop 2024
Theory of Computing is LASIGE's new RLE
International Conference on Computational Complexity brings together researchers in Lisbon
The ‘Complexity as a Kaleidoscope’ workshop proposed new ways of communicating research into complexity
LASIGE publishes in the Quantum journal
LASIGE Workshop 2024
Theory of Computing is LASIGE's new RLE
LASIGE @ Ciências Research & Innovation Day 2023
LASIGE 25 years Celebration
LASIGE turns 25!
The ‘Complexity as a Kaleidoscope’ workshop proposed new ways of communicating research into complexity
LASIGE publishes in the Quantum journal
LASIGE Workshop 2024
Theory of Computing is LASIGE's new RLE
LASIGE @ Ciências Research & Innovation Day 2023
LASIGE 25 years Celebration
LASIGE turns 25!
ONGOING
| Acronym | Title | Funding Entity | Start Date | End Date |
|---|---|---|---|---|
| HOFGA | The Hardness of Finding Good Algorithms | ERC | 01/03/2023 | 29/02/2028 |
Pavel Dvořák, Bruno Loff, Suhail Sherif. A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), pages 665-684. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026 [Biblius]
Bruno Loff, Alexey Milovanov. The Hardness of Decision Tree Complexity. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025) . Leibniz International Proceedings in Informatics (LIPIcs), 2025 [Biblius]