default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuke Schaeffer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. Log. Methods Comput. Sci. 20(3) (2024)- [j9]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. Quantum 8: 1251 (2024) - [c14]Daniel Grier, Hakop Pashayan, Luke Schaeffer:
Principal eigenstate classical shadows. COLT 2024: 2122-2165 - [i29]Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic:
Beatty Sequences for a Quadratic Irrational: Decidability and Applications. CoRR abs/2402.08331 (2024) - [i28]Daniel Grier, Hakop Pashayan, Luke Schaeffer:
Principal eigenstate classical shadows. CoRR abs/2405.13939 (2024) - 2023
- [i27]Vishnu Iyer, Siddhartha Jain, Matt Kovacs-Deak, Vinayak M. Kumar, Luke Schaeffer, Daochen Wang, Michael Whitmeyer:
On the Rational Degree of Boolean Functions and Applications. CoRR abs/2310.08004 (2023) - [i26]Vishnu Iyer, Siddhartha Jain, Matt Kovacs-Deak, Vinayak M. Kumar, Luke Schaeffer, Daochen Wang, Michael Whitmeyer:
On the Rational Degree of Boolean Functions and Applications. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j8]Daniel Grier, Luke Schaeffer:
The Classification of Clifford Gates over Qubits. Quantum 6: 734 (2022) - [c13]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian Words. CSL 2022: 24:1-24:23 - [i25]Luke Schaeffer, Jeffrey O. Shallit:
The First-Order Theory of Binary Overlap-Free Words is Decidable. CoRR abs/2209.03266 (2022) - [i24]Daniel Grier, Hakop Pashayan
, Luke Schaeffer:
Sample-optimal classical shadows for pure states. CoRR abs/2211.11810 (2022) - 2021
- [j7]Aseem R. Baranwal, Luke Schaeffer, Jeffrey O. Shallit:
Ostrowski-automatic sequences: Theory and applications. Theor. Comput. Sci. 858: 122-142 (2021) - [i23]Daniel Grier, Nathan Ju, Luke Schaeffer:
Interactive quantum advantage with noisy, shallow Clifford circuits. CoRR abs/2102.06833 (2021) - [i22]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. CoRR abs/2102.08207 (2021) - 2020
- [c12]Daniel Grier, Luke Schaeffer:
Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond. STOC 2020: 875-888 - [i21]David Gosset, Daniel Grier, Alex Kerzner, Luke Schaeffer:
Fast simulation of planar Clifford circuits. CoRR abs/2009.03218 (2020)
2010 – 2019
- 2019
- [c11]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. FOCS 2019: 942-965 - [c10]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. STOC 2019: 515-526 - [i20]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. CoRR abs/1906.08890 (2019) - [i19]Daniel Grier, Luke Schaeffer:
Interactive shallow Clifford circuits: quantum advantage against NC1 and beyond. CoRR abs/1911.02555 (2019) - [i18]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. Electron. Colloquium Comput. Complex. TR19 (2019) - [i17]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i16]Alex Lombardi, Luke Schaeffer:
A Note on Key Agreement and Non-Interactive Commitments. IACR Cryptol. ePrint Arch. 2019: 279 (2019) - 2018
- [c9]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. CCC 2018: 19:1-19:29 - [i15]Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. CoRR abs/1812.04219 (2018) - 2017
- [j6]Chen Fei Du, Hamoon Mousavi, Eric Rowland, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theor. Comput. Sci. 657: 146-162 (2017) - [c8]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. ITCS 2017: 23:1-23:34 - 2016
- [j5]Luke Schaeffer, Jeffrey O. Shallit:
Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. Electron. J. Comb. 23(1): 1 (2016) - [j4]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. Int. J. Found. Comput. Sci. 27(8): 943-964 (2016) - [j3]Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic Words, I: Basic results. RAIRO Theor. Informatics Appl. 50(1): 39-66 (2016) - [i14]Daniel Grier, Luke Schaeffer:
The Classification of Stabilizer Operations over Qubits. CoRR abs/1603.03999 (2016) - [i13]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. CoRR abs/1610.04670 (2016) - [i12]Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c7]Luke Schaeffer:
A Physically Universal Quantum Cellular Automaton. Automata 2015: 46-58 - [c6]Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
A New Approach to the Paperfolding Sequences. CiE 2015: 34-43 - [c5]Luke Schaeffer:
A Physically Universal Cellular Automaton. ITCS 2015: 237-246 - [c4]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. ISAAC 2015: 689-699 - [i11]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. CoRR abs/1504.05155 (2015) - [i10]Luke Schaeffer, Jeffrey O. Shallit:
Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. CoRR abs/1508.02074 (2015) - [i9]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. Electron. Colloquium Comput. Complex. TR15 (2015) - [i8]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61(2): 10:1-10:17 (2014) - [i7]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. CoRR abs/1406.0670 (2014) - [i6]Luke Schaeffer:
A Physically Universal Cellular Automaton. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c3]Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit:
Subword Complexity and k-Synchronization. Developments in Language Theory 2013: 252-263 - [c2]Luke Schaeffer:
Ostrowski Numeration and the Local Period of Sturmian Words. LATA 2013: 493-503 - 2012
- [j1]Luke Schaeffer, Jeffrey O. Shallit:
The Critical Exponent is Computable for Automatic Sequences. Int. J. Found. Comput. Sci. 23(8): 1611-1626 (2012) - [i5]Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit:
The Subword Complexity of k-Automatic Sequences is k-Synchronized. CoRR abs/1206.5352 (2012) - [i4]Luke Schaeffer:
Ostrowski Numeration and the Local Period of Sturmian Words. CoRR abs/1210.2343 (2012) - [i3]Luke Schaeffer:
An Improved Lower Bound for Stack Sorting. CoRR abs/1212.0836 (2012) - 2011
- [c1]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit:
Decidability and Shortest Strings in Formal Languages. DCFS 2011: 55-67 - [i2]Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit:
Decidability and Shortest Strings in Formal Languages. CoRR abs/1103.1622 (2011) - [i1]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (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 2024-08-29 21:01 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:
