default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSean Hallgren
Person information
- affiliation: Pennsylvania State University, University Park, USA
- award (2008): Presidential Early Career Award for Scientists and Engineers
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, Jianqiang Li:
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems. Quantum 7: 1069 (2023)- 2022
- [i10]Lior Eldar, Sean Hallgren:
An efficient quantum algorithm for lattice problems achieving subexponential approximation factor. CoRR abs/2201.13450 (2022) - 2021
- [i9]Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, Jianqiang Li:
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems. CoRR abs/2111.00405 (2021) - 2020
- [j6]Nai-Hui Chia, Sean Hallgren, Fang Song
:
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions. Quantum 4: 312 (2020) - [c17]Sean Hallgren, Eunou Lee, Ojas Parekh:
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem. APPROX-RANDOM 2020: 59:1-59:18
2010 – 2019
- 2018
- [c16]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter, Travis Morrison, Christophe Petit:
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions. EUROCRYPT (3) 2018: 329-368 - [i8]Nai-Hui Chia, Sean Hallgren, Fang Song:
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions. CoRR abs/1804.10309 (2018) - [i7]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter, Travis Morrison, Christophe Petit:
Supersingular isogeny graphs and endomorphism rings: reductions and solutions. IACR Cryptol. ePrint Arch. 2018: 371 (2018) - 2017
- [i6]Kirsten Eisenträger, Sean Hallgren, Travis Morrison:
On the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves. IACR Cryptol. ePrint Arch. 2017: 986 (2017) - 2016
- [c15]Nai-Hui Chia, Sean Hallgren:
How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?. TQC 2016: 6:1-6:16 - [r6]Sean Hallgren:
Quantum Algorithm for Factoring. Encyclopedia of Algorithms 2016: 1651-1652 - [r5]Sean Hallgren:
Quantum Algorithm for Solving Pell's Equation. Encyclopedia of Algorithms 2016: 1660-1662 - [r4]Sean Hallgren:
Quantum Algorithms for Class Group of a Number Field. Encyclopedia of Algorithms 2016: 1669-1671 - [i5]Nai-Hui Chia, Sean Hallgren:
How hard is deciding trivial versus nontrivial in the dihedral coset problem? CoRR abs/1608.02003 (2016) - 2015
- [i4]Sean Hallgren, Adam D. Smith, Fang Song:
Classical Cryptographic Protocols in a Quantum World. CoRR abs/1507.01625 (2015) - [i3]Sean Hallgren, Adam D. Smith, Fang Song:
Classical Cryptographic Protocols in a Quantum World. IACR Cryptol. ePrint Arch. 2015: 687 (2015) - 2014
- [c14]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter:
Weak Instances of PLWE. Selected Areas in Cryptography 2014: 183-194 - [c13]Kirsten Eisenträger, Sean Hallgren, Alexei Y. Kitaev, Fang Song:
A quantum algorithm for computing the unit group of an arbitrary degree number field. STOC 2014: 293-302 - [i2]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter:
Weak Instances of PLWE. IACR Cryptol. ePrint Arch. 2014: 784 (2014) - 2013
- [j5]Sean Hallgren, Daniel Nagaj, Sandeep Narayanaswami:
The local Hamiltonian problem on a line with eight states is QMA-complete. Quantum Inf. Comput. 13(9-10): 721-750 (2013) - 2011
- [c12]Sean Hallgren, Adam D. Smith, Fang Song:
Classical Cryptographic Protocols in a Quantum World. CRYPTO 2011: 411-428 - 2010
- [j4]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. J. ACM 57(6): 34:1-34:33 (2010) - [c11]Kirsten Eisenträger, Sean Hallgren:
Algorithms for Ray Class Groups and Hilbert Class Fields. SODA 2010: 471-483
2000 – 2009
- 2008
- [c10]Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang:
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. ICALP (2) 2008: 592-603 - [c9]Sean Hallgren, Aram W. Harrow:
Superpolynomial Speedups Based on Almost Any Quantum Circuit. ICALP (1) 2008: 782-795 - [r3]Sean Hallgren:
Quantum Algorithm for Factoring. Encyclopedia of Algorithms 2008 - [r2]Sean Hallgren:
Quantum Algorithm for Solving the Pell's Equation. Encyclopedia of Algorithms 2008 - [r1]Sean Hallgren:
Quantum Algorithms for Class Group of a Number Field. Encyclopedia of Algorithms 2008 - 2007
- [j3]Sean Hallgren:
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. J. ACM 54(1): 4:1-4:19 (2007) - 2006
- [j2]Wim van Dam, Sean Hallgren, Lawrence Ip:
Quantum Algorithms for Some Hidden Shift Problems. SIAM J. Comput. 36(3): 763-778 (2006) - [c8]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617 - 2005
- [c7]Sean Hallgren, Alexander Russell, Igor E. Shparlinski:
Quantum Noisy Rational Function Reconstruction. COCOON 2005: 420-429 - [c6]Sean Hallgren:
Fast quantum algorithms for computing the unit group and class group of a number field. STOC 2005: 468-474 - 2003
- [j1]Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM J. Comput. 32(4): 916-934 (2003) - [c5]Wim van Dam, Sean Hallgren, Lawrence Ip:
Quantum algorithms for some hidden shift problems. SODA 2003: 489-498 - 2002
- [c4]Sean Hallgren:
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. STOC 2002: 653-658 - 2000
- [c3]Lisa Hales, Sean Hallgren:
An Improved Quantum Fourier Transform Algorithm and Applications. FOCS 2000: 515-525 - [c2]Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
Normal subgroup reconstruction and quantum computation using group representations. STOC 2000: 627-635 - [i1]Wim van Dam, Sean Hallgren:
Efficient Quantum Algorithms for Shifted Quadratic Character Problems. CoRR quant-ph/0011067 (2000)
1990 – 1999
- 1999
- [c1]Lisa Hales, Sean Hallgren:
Quantum Fourier Sampling Simplified. STOC 1999: 330-338
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-01-21 00:15 CET 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:
