default search action
Michael A. Burr
Person information
- affiliation: Clemson University, Department of Mathematical Sciences
- affiliation: New York University, Courant Institute
- affiliation: Tufts University, Department of Computer Scienc
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]Michael A. Burr, Michael Byrd:
Certified simultaneous isotopic approximation of pairs of curves via subdivision. ISSAC 2023: 116-125 - [c9]Michael A. Burr
, Kisun Lee
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. ISSAC 2023: 126-134 - [i12]Michael A. Burr, Kisun Lee, Anton Leykin:
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. CoRR abs/2302.04776 (2023) - [i11]Michael A. Burr, Michael Byrd:
Certified simultaneous isotopic approximation of pairs of curves via subdivision. CoRR abs/2302.04908 (2023) - 2020
- [j7]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The complexity of subdivision for diameter-distance tests. J. Symb. Comput. 101: 1-27 (2020) - [i10]Michael A. Burr, Anton Leykin:
Inflation of poorly conditioned zeros of systems of analytic functions. CoRR abs/2009.05810 (2020)
2010 – 2019
- 2019
- [j6]Michael A. Burr, Drew J. Lipman:
Quadratic-monomial generated domains from mixed signed, directed graphs. Int. J. Algebra Comput. 29(2): 279-308 (2019) - [c8]Michael A. Burr, Kisun Lee, Anton Leykin:
Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. ISSAC 2019: 267-274 - [i9]Michael A. Burr, Kisun Lee, Anton Leykin:
Effective certification of approximate solutions to systems of equations involving analytic functions. CoRR abs/1901.10384 (2019) - 2018
- [j5]Michael A. Burr, Shuhong Gao, Fiona Knoll:
Optimal Bounds for Johnson-Lindenstrauss Transformations. J. Mach. Learn. Res. 19: 73:1-73:22 (2018) - [c7]Juan Xu, Michael A. Burr, Chee Yap:
An Approach for Certifying Homotopy Continuation Paths: Univariate Case. ISSAC 2018: 399-406 - [i8]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The Complexity of Subdivision for Diameter-Distance Tests. CoRR abs/1801.05864 (2018) - [i7]Michael A. Burr, Shuhong Gao, Fiona Knoll:
Optimal Bounds for Johnson-Lindenstrauss Transformations. CoRR abs/1803.05350 (2018) - 2017
- [c6]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The Complexity of an Adaptive Subdivision Method for Approximating Real Curves. ISSAC 2017: 61-68 - [e1]Michael A. Burr, Chee K. Yap, Mohab Safey El Din:
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. ACM 2017, ISBN 978-1-4503-5064-8 [contents] - 2016
- [j4]Michael A. Burr
Continuous amortization and extensions: With applications to bisection-based root isolation. J. Symb. Comput. 77: 78-126 (2016) - [i6]Michael A. Burr, Robert Fabrizio:
Error Probabilities for Halfspace Depth. CoRR abs/1605.04323 (2016) - 2013
- [i5]Michael A. Burr:
Applications of Continuous Amortization to Bisection-based Root Isolation. CoRR abs/1309.5991 (2013) - 2012
- [j3]Michael A. Burr
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symb. Comput. 47(2): 131-152 (2012) - [j2]Michael A. Burr
SqFreeEVAL: An (almost) optimal real-root isolation algorithm. J. Symb. Comput. 47(2): 153-166 (2012) - 2011
- [i4]Michael A. Burr, Felix Krahmer:
SqFreeEVAL: An (almost) optimal real-root isolation algorithm. CoRR abs/1102.5266 (2011) - [i3]Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee Yap:
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves. CoRR abs/1102.5463 (2011) - [i2]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Dynamic Maintenance of Half-Space Depth for Points and Contours. CoRR abs/1109.1517 (2011)
2000 – 2009
- 2009
- [j1]Timothy G. Abbott, Michael A. Burr
Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42(5): 419-428 (2009) - [i1]Michael A. Burr, Felix Krahmer, Chee Yap:
Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c5]Michael A. Burr, Sung Woo Choi
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC 2008: 87-94 - 2005
- [c4]Michael A. Burr, Alexandra Lauric, Katelyn Mann:
Searching for the Center of an Ellipse. CCCG 2005: 260-263 - 2004
- [c3]Michael A. Burr, Alan C. Cheng, Ryan G. Coleman, Diane L. Souvaine:
Transformations and algorithms for least sum of squares hypersphere fitting. CCCG 2004: 104-107 - [c2]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. CCCG 2004: 136-139 - 2003
- [c1]Michael A. Burr, Eynat Rafalin, Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 195-209
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-09-13 01:40 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: