Shelby Kimmel

Orcid: 0000-0003-0726-4167

According to our database1, Shelby Kimmel authored at least 18 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Improved Quantum Query Complexity on Easier Inputs.
CoRR, 2023

Quantum Algorithm for Path-Edge Sampling.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

Robust and Space-Efficient Dual Adversary Quantum Query Algorithms.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020
Leveraging Unknown Structure in Quantum Query Algorithms.
CoRR, 2020

2019
Applications of the Quantum Algorithm for st-Connectivity.
Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019

2018
Recovering quantum gates from few average gate fidelities.
CoRR, 2018

No-go for quantum seals.
CoRR, 2018

Quantum vs. Classical Proofs and Subset Verification.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Quantum Algorithms for Connectivity and Related Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Quantum Algorithms for Graph Connectivity and Formula Evaluation.
CoRR, 2017

2016
A quantum version of Schoning's algorithm applied to quantum 2-SAT.
Quantum Inf. Comput., 2016

2015
Phase Retrieval Using Unitary 2-Designs.
CoRR, 2015

NAND-Trees, Average Choice Complexity, and Effective Resistance.
CoRR, 2015

Oracles with Costs.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2013
Quantum Adversary (Upper) Bound.
Chic. J. Theor. Comput. Sci., 2013

2012
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

The Quantum Query Complexity of Read-Many Formulas.
Proceedings of the Algorithms - ESA 2012, 2012


  Loading...