Florian Speelman

Alagic, G, Dulek, Y, Schaffner, C, & Speelman, F. (2017). Quantum fully homomorphic encryption with verification. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 438–467). doi:10.1007/978-3-319-70694-8_16

Speelman, F. (2016, November 16). Position-based quantum cryptography and catalytic computation.

Brody, J, Buhrman, H, Koucky, M, Loff Barreto, B. S, Speelman, F, & Vereshchagin, N.K. (2016). Towards a Reverse Newman’s Theorem in interactive information complexity. Algorithmica, 76(3), 749–781. doi:10.1007/s00453-015-0112-9

Speelman, F. (2016). Instantaneous non-local computation of low T-depth quantum circuits. doi:10.4230/LIPIcs.TQC.2016.9

Buhrman, H, Czekaj, L, Grudka, A, Horodecki, M, Horodecki, P, Markiewicz, M, … Strelchuk, S. (2016). Correction for Buhrman et al., Quantum communication complexity advantage implies violation of a Bell inequality. Proceedings of the National Academy of Sciences of the United States of America, 113(21). doi:10.1073/pnas.1606259113

Buhrman, H, Czekaj, L, Grudka, A, Horodecki, M, Horodecki, P, Markiewicz, M, … Strelchuk, S. (2016). Quantum communication complexity advantage implies violation of a Bell inequality. Proceedings of the National Academy of Sciences of the United States of America, 113(12), 3191–3196. doi:10.1073/pnas.1507647113

Buhrman, H, Koucky, M, Loff Barreto, B. S, & Speelman, F. (2016). Catalytic space: non-determinism and hierarchy. doi:10.4230/LIPIcs.STACS.2016.24

Dulek, Y, Schaffner, C, & Speelman, F. (2016). Quantum homomorphic encryption for polynomial-sized circuits. Presented at the Annual Cryptology Conference. doi:10.1007/978-3-662-53015-3_1

Briët, J, Buhrman, H, Leung, D, Piovesan, T, & Speelman, F. (2015). Round Elimination in Exact Communication Complexity. In S Beigi & R Koenig (Eds.), 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) (pp. 206–225). Schloss Dagstuhl - Leibniz Center of Informatics. doi:10.4230/LIPIcs.TQC.2015.206

Buhrman, H, Cleve, R.E, Koucky, M, Loff Barreto, B. S, & Speelman, F. (2014). Computing with a full memory: catalytic space. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (pp. 857–866). ACM. doi:10.1145/2591796.2591874