1
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: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., VOLUME: 215
INDEXED IN: Scopus DBLP
2
TITLE: Memory Compression with Quantum Random-Access Gates
AUTHORS: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLISHED: 2022, SOURCE: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022 in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA., VOLUME: 232
INDEXED IN: Scopus DBLP
3
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2018, SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, ISSUE: 1
INDEXED IN: Scopus DBLP
4
TITLE: Catalytic Space: Non-determinism and Hierarchy  Full Text
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2016, SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, ISSUE: 1
INDEXED IN: Scopus DBLP CrossRef: 4
5
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLISHED: 2016, SOURCE: Algorithmica, VOLUME: 76, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 4
6
TITLE: Computing with a full memory: catalytic space. catalytic space
AUTHORS: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2014, SOURCE: 4th Annual ACM Symposium on Theory of Computing, STOC 2014 in Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014
INDEXED IN: Scopus DBLP CrossRef: 8
7
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLISHED: 2013, SOURCE: 2013 IEEE Conference on Computational Complexity, CCC 2013 in Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013
INDEXED IN: Scopus DBLP CrossRef: 10