default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShelby Kimmel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. ESA 2023: 36:1-36:19- [c9]Stacey Jeffery
, Shelby Kimmel, Alvaro Piedrafita:
Quantum Algorithm for Path-Edge Sampling. TQC 2023: 5:1-5:28 - [i16]Noel T. Anderson, Jay-U. Chung, Shelby Kimmel, Da-Yeon Koh, Xiaohan Ye:
Improved Quantum Query Complexity on Easier Inputs. CoRR abs/2303.00217 (2023) - [i15]Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita:
Quantum Algorithm for Path-Edge Sampling. CoRR abs/2303.03319 (2023) - [i14]Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. CoRR abs/2306.15040 (2023) - 2021
- [c8]Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. WADS 2021: 543-555 - 2020
- [i13]Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. CoRR abs/2010.02324 (2020) - [i12]Noel T. Anderson, Jay-U. Chung, Shelby Kimmel:
Leveraging Unknown Structure in Quantum Query Algorithms. CoRR abs/2012.01276 (2020)
2010 – 2019
- 2019
- [c7]Kai DeLorenzo, Shelby Kimmel, R. Teal Witter:
Applications of the Quantum Algorithm for st-Connectivity. TQC 2019: 6:1-6:14 - [i11]Kai DeLorenzo, Shelby Kimmel, R. Teal Witter:
Applications of the quantum algorithm for st-connectivity. CoRR abs/1904.05995 (2019) - 2018
- [c6]Michael Jarret, Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita:
Quantum Algorithms for Connectivity and Related Problems. ESA 2018: 49:1-49:13 - [c5]Bill Fefferman, Shelby Kimmel:
Quantum vs. Classical Proofs and Subset Verification. MFCS 2018: 22:1-22:23 - [i10]Shelby Kimmel, Shimon Kolkowitz:
No-go for quantum seals. CoRR abs/1802.10007 (2018) - [i9]Ingo Roth, Richard Kueng, Shelby Kimmel, Yi-Kai Liu, David Gross, Jens Eisert, Martin Kliesch:
Recovering quantum gates from few average gate fidelities. CoRR abs/1803.00572 (2018) - [i8]Michael Jarret, Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita:
Quantum Algorithms for Connectivity and Related Problems. CoRR abs/1804.10591 (2018) - 2017
- [i7]Stacey Jeffery, Shelby Kimmel:
Quantum Algorithms for Graph Connectivity and Formula Evaluation. CoRR abs/1704.00765 (2017) - 2016
- [j2]Edward Farhi, Shelby Kimmel, Kristan Temme:
A quantum version of Schoning's algorithm applied to quantum 2-SAT. Quantum Inf. Comput. 16(13&14): 1212-1227 (2016) - [i6]Edward Farhi, Shelby Kimmel, Kristan Temme:
A Quantum Version of Schöning's Algorithm Applied to Quantum 2-SAT. CoRR abs/1603.06985 (2016) - 2015
- [c4]Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin:
Oracles with Costs. TQC 2015: 1-26 - [i5]Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin:
Oracles with Costs. CoRR abs/1502.02174 (2015) - [i4]Bill Fefferman, Shelby Kimmel:
Quantum vs Classical Proofs and Subset Verification. CoRR abs/1510.06750 (2015) - [i3]Shelby Kimmel, Yi-Kai Liu:
Phase Retrieval Using Unitary 2-Designs. CoRR abs/1510.08887 (2015) - [i2]Stacey Jeffery, Shelby Kimmel:
NAND-Trees, Average Choice Complexity, and Effective Resistance. CoRR abs/1511.02235 (2015) - 2013
- [j1]Shelby Kimmel:
Quantum Adversary (Upper) Bound. Chic. J. Theor. Comput. Sci. 2013 (2013) - 2012
- [c3]Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The Quantum Query Complexity of Read-Many Formulas. ESA 2012: 337-348 - [c2]Shelby Kimmel:
Quantum Adversary (Upper) Bound. ICALP (1) 2012: 557-568 - [c1]Bohua Zhan, Shelby Kimmel, Avinatan Hassidim:
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure. ITCS 2012: 249-265 - 2011
- [i1]Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The quantum query complexity of read-many formulas. CoRR abs/1112.0548 (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-05-08 21:46 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:
