Bruno Loff

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Memory compression with quantum random-access gates	2024-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q6126258	2024-04-09	Paper
Hardness of constant-round communication complexity	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5092472	2022-07-21	Paper
Lifting Theorems for Equality	2022-07-18	Paper
The computational power of parsing expression grammars	2020-03-26	Paper
Simulation theorems via pseudo-random properties	2019-12-19	Paper
Simulation beats richness: new data-structure lower bounds	2019-08-22	Paper
The computational power of parsing expression grammars	2018-11-22	Paper
Lower Bounds for Elimination via Weak Regularity	2018-04-19	Paper
Catalytic space: non-determinism and hierarchy	2018-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4601876	2018-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4600389	2018-01-09	Paper
Towards a reverse Newman's theorem in interactive information complexity	2016-11-29	Paper
Computing with a full memory	2015-06-26	Paper
Hardness of approximation for knapsack problems	2015-05-29	Paper
Reductions to the set of random strings: the resource-bounded case	2014-09-05	Paper
Learning Reductions to Sparse Sets	2013-09-20	Paper
Reductions to the set of random strings: the resource-bounded case	2012-09-25	Paper
Monotonicity constraints in characterizations of PSPACE	2012-05-07	Paper
Computability on reals, infinite limits and differential equations	2010-09-01	Paper
Computational complexity with experiments as oracles. II. Upper bounds	2010-05-19	Paper
A foundation for real recursive function theory	2009-10-26	Paper
Computational complexity with experiments as oracles	2009-01-23	Paper
Oracles and Advice as Measurements	2008-12-02	Paper
On the Complexity of Measurement in Classical Physics	2008-05-27	Paper
The New Promise of Analog Computation	2007-11-13	Paper

Research outcomes over time

This page was built for person: Bruno Loff