Michael A. Burr

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 15

Top Topics

Johnson Lindenstrauss

Subdivision Scheme

Approximation Error

Top Venues

J. Symb. Comput.

J. Mach. Learn. Res.

Publications

Michael A. Burr, Kisun Lee, Anton Leykin
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. CoRR (2023)
Michael A. Burr, Kisun Lee, Anton Leykin
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. ISSAC (2023)
Michael A. Burr, Michael Byrd
Certified simultaneous isotopic approximation of pairs of curves via subdivision. ISSAC (2023)
Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas
The complexity of subdivision for diameter-distance tests. J. Symb. Comput. 101 (2020)
Michael A. Burr, Anton Leykin
Inflation of poorly conditioned zeros of systems of analytic functions. CoRR (2020)
Michael A. Burr, Kisun Lee, Anton Leykin
Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. ISSAC (2019)
Michael A. Burr, Kisun Lee, Anton Leykin
Effective certification of approximate solutions to systems of equations involving analytic functions. CoRR (2019)
Michael A. Burr, Drew J. Lipman
Quadratic-monomial generated domains from mixed signed, directed graphs. Int. J. Algebra Comput. 29 (2) (2019)
Michael A. Burr, Shuhong Gao, Fiona Knoll
Optimal Bounds for Johnson-Lindenstrauss Transformations. J. Mach. Learn. Res. 19 (2018)
Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas
The Complexity of Subdivision for Diameter-Distance Tests. CoRR (2018)
Juan Xu, Michael A. Burr, Chee Yap
An Approach for Certifying Homotopy Continuation Paths: Univariate Case. ISSAC (2018)
Michael A. Burr, Shuhong Gao, Fiona Knoll
Optimal Bounds for Johnson-Lindenstrauss Transformations. CoRR (2018)
Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas
The Complexity of an Adaptive Subdivision Method for Approximating Real Curves. ISSAC (2017)
Michael A. Burr, Robert Fabrizio
Error Probabilities for Halfspace Depth. CoRR (2016)
Michael A. Burr
Continuous amortization and extensions: With applications to bisection-based root isolation. J. Symb. Comput. 77 (2016)
Michael A. Burr
Applications of Continuous Amortization to Bisection-based Root Isolation. CoRR (2013)
Michael A. Burr, Felix Krahmer
SqFreeEVAL: An (almost) optimal real-root isolation algorithm. J. Symb. Comput. 47 (2) (2012)
Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symb. Comput. 47 (2) (2012)
Michael A. Burr, Felix Krahmer
SqFreeEVAL: An (almost) optimal real-root isolation algorithm CoRR (2011)
Michael A. Burr, Eynat Rafalin, Diane L. Souvaine
Dynamic Maintenance of Half-Space Depth for Points and Contours CoRR (2011)
Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee Yap
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves CoRR (2011)
Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung
Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42 (5) (2009)
Michael A. Burr, Felix Krahmer, Chee Yap
Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. Electron. Colloquium Comput. Complex. 16 (2009)
Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC (2008)
Michael A. Burr, Alexandra Lauric, Katelyn Mann
Searching for the Center of an Ellipse. CCCG (2005)
Michael A. Burr, Alan C. Cheng, Ryan G. Coleman, Diane L. Souvaine
Transformations and algorithms for least sum of squares hypersphere fitting. CCCG (2004)
Michael A. Burr, Eynat Rafalin, Diane L. Souvaine
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. CCCG (2004)
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)