default search action
John C. Urschel
Person information
- affiliation: Harvard University, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Enrico Colón
, John Urschel:
Hamilton Powers of Eulerian Digraphs. Electron. J. Comb. 31(2) (2024) - [j5]Alan Edelman, John Urschel:
Some New Results on the Maximum Growth Factor in Gaussian Elimination. SIAM J. Matrix Anal. Appl. 45(2): 967-991 (2024) - [i7]Alan Edelman, John Urschel, Bowen Zhu:
On a perturbation analysis of Higham squared maximum Gaussian elimination growth matrices. CoRR abs/2406.00737 (2024) - 2023
- [i6]Alan Edelman, John Urschel:
Some New Results on the Maximum Growth Factor in Gaussian Elimination. CoRR abs/2303.04892 (2023) - [i5]John Urschel:
Representing the Special Linear Group with Block Unitriangular Matrices. CoRR abs/2305.00485 (2023) - [i4]Larry Guth, Dominique Maldague, John Urschel:
Estimating the matrix p → q norm. CoRR abs/2311.07677 (2023) - [i3]Ankit Bisain, Alan Edelman, John Urschel:
A New Upper Bound For the Growth Factor in Gaussian Elimination with Complete Pivoting. CoRR abs/2312.00994 (2023) - 2021
- [j4]Dhruv Rohatgi, John C. Urschel, Jake Wellens:
Regarding Two Conjectures on Clique and Biclique Partitions. Electron. J. Comb. 28(4) (2021) - [j3]John C. Urschel
Testing gap k-planarity is NP-complete. Inf. Process. Lett. 169: 106083 (2021) - [j2]John C. Urschel:
Uniform Error Estimates for the Lanczos Method. SIAM J. Matrix Anal. Appl. 42(3): 1423-1450 (2021) - [c3]Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel:
Multidimensional Scaling: Approximation and Complexity. ICML 2021: 2568-2578 - [i2]Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel:
Multidimensional Scaling: Approximation and Complexity. CoRR abs/2109.11505 (2021) - 2020
- [i1]John C. Urschel:
Uniform Error Estimates for the Lanczos Method. CoRR abs/2003.09362 (2020)
2010 – 2019
- 2017
- [j1]John C. Urschel:
On The Characterization and Uniqueness of Centroidal Voronoi Tessellations. SIAM J. Numer. Anal. 55(3): 1525-1547 (2017) - [c2]Victor-Emmanuel Brunel, Ankur Moitra, Philippe Rigollet, John C. Urschel:
Rates of estimation for determinantal point processes. COLT 2017: 343-345 - [c1]John C. Urschel, Victor-Emmanuel Brunel, Ankur Moitra, Philippe Rigollet:
Learning Determinantal Point Processes with Moments and Cycles. ICML 2017: 3511-3520
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-10-07 21:23 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: