The New Promise of Analog Computation. - José Félix Costa; Bruno Loff; Jerzy Mycka (CiE, 2007)

Computability on reals, infinite limits and differential equations. - Bruno Loff; José Félix Costa; Jerzy Mycka (Appl. Math. Comput., 2007)

On the Complexity of Measurement in Classical Physics. - Edwin J. Beggs; José Félix Costa; Bruno Loff; John V. Tucker (TAMC, 2008)

Oracles and Advice as Measurements. - Edwin J. Beggs; José Félix Costa; Bruno Loff; John V. Tucker (UC, 2008)

A foundation for real recursive function theory. - José Félix Costa; Bruno Loff; Jerzy Mycka (Ann. Pure Appl. Log., 2009)

Five Views of Hypercomputation. - Bruno Loff; José Félix Costa (Int. J. Unconv. Comput., 2009)

Derandomizing from Random Strings. - Harry Buhrman; Lance Fortnow; Michal Koucký 001; Bruno Loff (CCC, 2010)

Reductions to the set of random strings: the resource-bounded case. - Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff (Electron. Colloquium Comput. Complex., 2012)

Towards a Reverse Newman's Theorem in Interactive Information Complexity. - Joshua Brody; Harry Buhrman; Michal Koucký 001; Bruno Loff; Florian Speelman (Electron. Colloquium Comput. Complex., 2012)

Monotonicity Constraints in Characterizations of PSPACE. - Amir M. Ben-Amram; Bruno Loff; Isabel Oitavem (J. Log. Comput., 2012)

Learning Reductions to Sparse Sets. - Harry Buhrman; Lance Fortnow; John M. Hitchcock; Bruno Loff (MFCS, 2013)

Computing with a full memory: Catalytic space. - Harry Buhrman; Richard Cleve; Michal Koucký 001; Bruno Loff; Florian Speelman (Electron. Colloquium Comput. Complex., 2014)

Hardness of Approximation for Knapsack Problems. - Harry Buhrman; Bruno Loff; Leen Torenvliet (Theory Comput. Syst., 2015)

Towards a Reverse Newman's Theorem in Interactive Information Complexity. - Joshua Brody; Harry Buhrman; Michal Koucký 001; Bruno Loff; Florian Speelman; Nikolai K. Vereshchagin (Algorithmica, 2016)

Lower Bounds for Elimination via Weak Regularity. - Arkadev Chattopadhyay; Pavel Dvorák; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2016)

Simulation Theorems via Pseudorandom Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (CoRR, 2017)

Composition and Simulation Theorems via Pseudo-random Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Simulation Beats Richness: New Data-Structure Lower Bounds. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Lifting Theorems for Equality. - Bruno Loff; Sagnik Mukhopadhyay (Electron. Colloquium Comput. Complex., 2018)

Catalytic Space: Non-determinism and Hierarchy. - Harry Buhrman; Michal Koucký 001; Bruno Loff; Florian Speelman (Theory Comput. Syst., 2018)

Simulation Theorems via Pseudo-random Properties. - Arkadev Chattopadhyay; Michal Koucký 001; Bruno Loff; Sagnik Mukhopadhyay (Comput. Complex., 2019)

Lower Bounds for Semi-adaptive Data Structures via Corruption. - Pavel Dvorák; Bruno Loff (FSTTCS, 2020)

NP-Hardness of Circuit Minimization for Multi-Output Functions. - Rahul Ilango; Bruno Loff; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2020)

The computational power of parsing expression grammars. - Bruno Loff; Nelma Moreira; Rogério Reis (J. Comput. Syst. Sci., 2020)

Hardness of Constant-round Communication Complexity. - Shuichi Hirahara; Rahul Ilango; Bruno Loff (Electron. Colloquium Comput. Complex., 2021)

Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. - Harry Buhrman; Bruno Loff; Subhasree Patro; Florian Speelman (ITCS, 2022)

Memory Compression with Quantum Random-Access Gates. - Harry Buhrman; Bruno Loff; Subhasree Patro; Florian Speelman (TQC, 2022)

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. - Sepehr Assadi; Prantar Ghosh; Bruno Loff; Parth Mittal; Sagnik Mukhopadhyay (CCC, 2024)

Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. - Bruno Loff; Mateusz Skomra (ICALP, 2024)

A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. - Pavel Dvorák; Bruno Loff; Suhail Sherif (CoRR, 2024)

The hardness of decision tree complexity. - Bruno Loff; Alexey Milovanov (Electron. Colloquium Comput. Complex., 2024)

State preparation by shallow circuits using feed forward. - Harry Buhrman; Marten Folkertsma; Bruno Loff; Niels M. P. Neumann (Quantum, 2024)

Communication Complexity is NP-hard. - Shuichi Hirahara; Rahul Ilango; Bruno Loff (Electron. Colloquium Comput. Complex., 2025)

Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof. - Bruno Bauwens; Bruno Loff (CoRR, 2025)