Florian Speelman
AuthID: R-00H-CS8
1
TÃTULO: Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks
AUTORES: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLICAÇÃO: 2022, FONTE: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., VOLUME: 215
AUTORES: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLICAÇÃO: 2022, FONTE: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., VOLUME: 215
INDEXADO EM: 
Scopus 
DBLP
Scopus DBLP2
TÃTULO: Memory Compression with Quantum Random-Access Gates
AUTORES: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLICAÇÃO: 2022, FONTE: 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
AUTORES: Harry Buhrman; Bruno Loff ; Subhasree Patro; Florian Speelman;
PUBLICAÇÃO: 2022, FONTE: 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
INDEXADO EM: Scopus DBLP
Scopus DBLP3
TÃTULO: Catalytic Space: Non-determinism and Hierarchy
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2018, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, NÚMERO: 1
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2018, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, NÚMERO: 1
INDEXADO EM: Scopus DBLP
Scopus DBLP4
TÃTULO: Catalytic Space: Non-determinism and Hierarchy Full Text
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2016, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, NÚMERO: 1
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2016, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, NÚMERO: 1
5
TÃTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity Full Text
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLICAÇÃO: 2016, FONTE: Algorithmica, VOLUME: 76, NÚMERO: 3
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLICAÇÃO: 2016, FONTE: Algorithmica, VOLUME: 76, NÚMERO: 3
6
TÃTULO: Computing with a full memory: catalytic space. catalytic space
AUTORES: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2014, FONTE: 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
AUTORES: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2014, FONTE: 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
7
TÃTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLICAÇÃO: 2013, FONTE: 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
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLICAÇÃO: 2013, FONTE: 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
