default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Speelman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Llorenç Escolà-Farràs, Florian Speelman:
Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography. Quantum 9: 1712 (2025)- [c14]Marten Folkertsma, Ian Mertz
, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. ITCS 2025: 50:1-50:13 - 2024
- [j8]Yfke Dulek, Garazi Muguruza, Florian Speelman:
An efficient combination of quantum error correction and authentication. IACR Commun. Cryptol. 1(4): 35 (2024) - [j7]Ziyan Zhang, Chrysa Papagianni, Florian Speelman, Paola Grosso:
Toward Complete Quantum Network Stacks: A Survey. IEEE Netw. 38(5): 153-159 (2024) - [j6]Rene Allerstorfer, Harry Buhrman, Alex May, Florian Speelman, Philip Verduyn Lunel:
Relating non-local quantum computation to information theoretic cryptography. Quantum 8: 1387 (2024) - [j5]Garazi Muguruza, Florian Speelman:
Port-Based State Preparation and Applications. Quantum 8: 1573 (2024) - [i22]Poojith U. Rao, Florian Speelman, Balwinder Sodhi, Sachin Kinge:
A Quantum Computing Approach for Multi-robot Coverage Path Planning. CoRR abs/2407.08767 (2024) - [i21]Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. CoRR abs/2409.05046 (2024) - [i20]Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c13]Léo Colisson, Garazi Muguruza, Florian Speelman:
Oblivious Transfer from Zero-Knowledge Proofs - Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. ASIACRYPT (8) 2023: 3-38 - [i19]Léo Colisson, Garazi Muguruza, Florian Speelman:
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. CoRR abs/2303.01476 (2023) - [i18]Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman:
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. CoRR abs/2309.16431 (2023) - [i17]Léo Colisson, Garazi Muguruza, Florian Speelman:
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. IACR Cryptol. ePrint Arch. 2023: 311 (2023) - 2022
- [j4]Jordi R. Weggemans, Alexander Urech, Alexander Rausch, Robert J. C. Spreeuw, Richard J. Boucherie, Florian Schreck, Kareljan Schoutens, Jirí Minár, Florian Speelman:
Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum 6: 687 (2022) - [c12]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. ITCS 2022: 31:1-31:12 - [c11]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Memory Compression with Quantum Random-Access Gates. TQC 2022: 10:1-10:19 - [i16]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Memory Compression with Quantum Random-Access Gates. CoRR abs/2203.05599 (2022) - [i15]Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman:
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture. CoRR abs/2207.11068 (2022) - [i14]Yfke Dulek, Garazi Muguruza, Florian Speelman:
An efficient combination of quantum error correction and authentication. CoRR abs/2211.09686 (2022) - 2021
- [c10]Harry Buhrman, Subhasree Patro, Florian Speelman:
A Framework of Quantum Strong Exponential-Time Hypotheses. STACS 2021: 19:1-19:19 - [i13]Andreas Bluhm, Matthias Christandl, Florian Speelman:
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. CoRR abs/2104.06301 (2021) - [i12]Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf:
A Guide for New Program Committee Members at Theoretical Computer Science Conferences. CoRR abs/2105.02773 (2021) - [i11]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. CoRR abs/2106.02005 (2021)
2010 – 2019
- 2019
- [i10]Harry Buhrman, Subhasree Patro, Florian Speelman:
The Quantum Strong Exponential-Time Hypothesis. CoRR abs/1911.05686 (2019) - 2018
- [j3]Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. 62(1): 116-135 (2018) - [j2]Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum Homomorphic Encryption for Polynomial-Size Circuits. Theory Comput. 14(1): 1-45 (2018) - [c9]Yfke Dulek, Florian Speelman:
Quantum Ciphertext Authentication and Key Recycling with the Trap Code. TQC 2018: 1:1-1:17 - [i9]Yfke Dulek, Florian Speelman:
Quantum ciphertext authentication and key recycling with the trap code. CoRR abs/1804.02237 (2018) - [i8]Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman:
Round elimination in exact communication complexity. CoRR abs/1812.09290 (2018) - 2017
- [c8]Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum Fully Homomorphic Encryption with Verification. ASIACRYPT (1) 2017: 438-467 - [i7]Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum Fully Homomorphic Encryption With Verification. CoRR abs/1708.09156 (2017) - 2016
- [j1]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76(3): 749-781 (2016) - [c7]Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum Homomorphic Encryption for Polynomial-Sized Circuits. CRYPTO (3) 2016: 3-32 - [c6]Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. STACS 2016: 24:1-24:13 - [c5]Florian Speelman:
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. TQC 2016: 9:1-9:24 - [i6]Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum homomorphic encryption for polynomial-sized circuits. CoRR abs/1603.09717 (2016) - [i5]Yfke Dulek, Christian Schaffner, Florian Speelman:
Quantum homomorphic encryption for polynomial-sized circuits. IACR Cryptol. ePrint Arch. 2016: 559 (2016) - 2015
- [c4]Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman:
Round Elimination in Exact Communication Complexity. TQC 2015: 206-225 - 2014
- [c3]Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman:
Computing with a full memory: catalytic space. STOC 2014: 857-866 - [i4]Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman:
Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c2]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC 2013: 24-33 - [c1]Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The garden-hose model. ITCS 2013: 145-158 - 2012
- [i3]Florian Speelman:
Position-Based Quantum Cryptography and the Garden-Hose Game. CoRR abs/1210.4353 (2012) - [i2]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i1]Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography. CoRR abs/1109.2563 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-08 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
