Projects per year
Fingerprint
Dive into the research topics where Sean Hallgren is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Exponential Speedups and Limitations of Quantum Computation
Hallgren, S. (PI)
9/1/18 → …
Project: Research project
-
NSF Convergence Accelerator - Track C: SQAI: Scalable Quantum Artificial Intelligence for Discovery
Samarth, N. (CoPI), Ghosh, S. (PI), Hallgren, S. (CoPI) & Kandemir, M. (CoPI)
9/15/20 → 5/31/23
Project: Research project
-
SaTC: CORE: Small: Classical and quantum algorithms for number-theoretic problems arising in cryptography
Eisentraeger, A. K. (PI) & Hallgren, S. (CoPI)
5/1/20 → 4/30/23
Project: Research project
-
TWC: Small: Algorithms for Number-Theoretic Problems Arising in Cryptography
Eisentraeger, A. K. (PI) & Hallgren, S. (CoPI)
8/1/16 → 7/31/20
Project: Research project
-
AF: Small: Quantum Algorithms and Complexity
Hallgren, S. (PI)
7/1/16 → 6/30/20
Project: Research project
-
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems
Ding, J., Gheorghiu, V., Gilyén, A., Hallgren, S. & Li, J., 2023, In: Quantum. 7Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations -
An approximation algorithm for the MAX-2-local hamiltonian problem
Hallgren, S., Lee, E. & Parekh, O., Aug 1 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX59. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
7 Scopus citations -
On basing one-way permutations on np-hard problems under quantum reductions
Chia, N. H., Hallgren, S. & Song, F., Aug 27 2020, In: Quantum. 4Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
Supersingular isogeny graphs and endomorphism rings: reductions and solutions
Eisenträger, K., Hallgren, S., Lauter, K., Morrison, T. & Petit, C., 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 329-368 40 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10822 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
49 Scopus citations -
How hard is deciding trivial versus nontrivial in the dihedral coset problem
Chia, N. H. & Hallgren, S., Sep 1 2016, 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016. Broadbent, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 61).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution