The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography - Harry Buhrman; Serge Fehr; Christian Schaffner; Florian Speelman (CoRR, 2011)

Position-Based Quantum Cryptography and the Garden-Hose Game - Florian Speelman (CoRR, 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)

The garden-hose model. - Harry Buhrman; Serge Fehr; Christian Schaffner; Florian Speelman (ITCS, 2013)

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

Round Elimination in Exact Communication Complexity. - Jop Briët; Harry Buhrman; Debbie W. Leung; Teresa Piovesan; Florian Speelman (TQC, 2015)

Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. - Florian Speelman (TQC, 2016)

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)

Quantum homomorphic encryption for polynomial-sized circuits. - Yfke Dulek; Christian Schaffner; Florian Speelman (IACR Cryptol. ePrint Arch., 2016)

Quantum Fully Homomorphic Encryption with Verification. - Gorjan Alagic; Yfke Dulek; Christian Schaffner; Florian Speelman (ASIACRYPT (1), 2017)

Quantum Ciphertext Authentication and Key Recycling with the Trap Code. - Yfke Dulek; Florian Speelman (TQC, 2018)

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

Quantum Homomorphic Encryption for Polynomial-Size Circuits. - Yfke Dulek; Christian Schaffner; Florian Speelman (Theory Comput., 2018)

The Quantum Strong Exponential-Time Hypothesis. - Harry Buhrman; Subhasree Patro; Florian Speelman (CoRR, 2019)

A Framework of Quantum Strong Exponential-Time Hypotheses. - Harry Buhrman; Subhasree Patro; Florian Speelman (STACS, 2021)

Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. - Andreas Bluhm; Matthias Christandl; Florian Speelman (CoRR, 2021)

A Guide for New Program Committee Members at Theoretical Computer Science Conferences. - Yfke Dulek; Stacey Jeffery; Christian Majenz; Christian Schaffner; Florian Speelman; Ronald de Wolf (CoRR, 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)

Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture. - Andris Ambainis; Harry Buhrman; Koen Leijnse; Subhasree Patro; Florian Speelman (CoRR, 2022)

Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. - Jordi R. Weggemans; Alexander Urech; Alexander Rausch; Robert J. C. Spreeuw; Richard J. Boucherie; Florian Schreck; Kareljan Schoutens; Jirí Minár; Florian Speelman (Quantum, 2022)

Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. - Léo Colisson; Garazi Muguruza; Florian Speelman (IACR Cryptol. ePrint Arch., 2023)

An efficient combination of quantum error correction and authentication. - Yfke Dulek; Garazi Muguruza; Florian Speelman (IACR Commun. Cryptol., 2024)

A Quantum Computing Approach for Multi-robot Coverage Path Planning. - Poojith U. Rao; Florian Speelman; Balwinder Sodhi; Sachin Kinge (CoRR, 2024)

Fully Characterizing Lossy Catalytic Computation. - Marten Folkertsma; Ian Mertz; Florian Speelman; Quinten Tupker (Electron. Colloquium Comput. Complex., 2024)

Relating non-local quantum computation to information theoretic cryptography. - Rene Allerstorfer; Harry Buhrman; Alex May 003; Florian Speelman; Philip Verduyn Lunel (Quantum, 2024)

Port-Based State Preparation and Applications. - Garazi Muguruza; Florian Speelman (Quantum, 2024)

Toward Complete Quantum Network Stacks: A Survey. - Ziyan Zhang; Chrysa Papagianni; Florian Speelman; Paola Grosso (IEEE Netw., 2024)

QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (APPROX/RANDOM, 2025)

Enhancing Position Verification in Multi-Node Quantum Networks. - Ziyan Zhang; Florian Speelman; Paola Grosso (INFOCOM, 2025)

Quantum Catalytic Space. - Harry Buhrman; Marten Folkertsma; Ian Mertz; Florian Speelman; Sergii Strelchuk; Sathyawageeswar Subramanian; Quinten Tupker (TQC, 2025)

A Quantum Cloning Game with Applications to Quantum Position Verification. - Léo Colisson Palais; Llorenç Escolà-Farràs; Florian Speelman (TQC, 2025)

Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography. - Llorenç Escolà-Farràs; Florian Speelman (Quantum, 2025)

Fine-Grained Complexity via Quantum Natural Proofs. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (CoRR, 2025)