{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:57:59Z","timestamp":1760061479507,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1423228"],"award-info":[{"award-number":["CCF-1423228"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["20150602005"],"award-info":[{"award-number":["20150602005"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2930889.2930939","type":"proceedings-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:59:33Z","timestamp":1468929573000},"page":"71-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Complexity Analysis of Root Clustering for a Complex Polynomial"],"prefix":"10.1145","author":[{"given":"Ruben","family":"Becker","sequence":"first","affiliation":[{"name":"Saarbr\\, Saarbr\\, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Sagraloff","sequence":"additional","affiliation":[{"name":"MPI for Informatics, Saarbr\\, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikram","family":"Sharma","sequence":"additional","affiliation":[{"name":"Institute of Mathematical Sciences, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Xu","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[{"name":"New York Univerisity, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2644288.2644291"},{"key":"e_1_3_2_1_2_1","volume-title":"Uni. Saarland","author":"Becker R.","year":"2012","unstructured":"R. Becker . The Bolzano Method to isolate the real roots of a bitstream polynomial. Bachelor Thesis , Uni. Saarland , Saarbruecken, Germany , May 2012 . R. Becker. The Bolzano Method to isolate the real roots of a bitstream polynomial. Bachelor Thesis, Uni. Saarland, Saarbruecken, Germany, May 2012."},{"key":"e_1_3_2_1_3_1","volume-title":"Sept.","author":"Becker R.","year":"2015","unstructured":"R. Becker , M. Sagraloff , V. Sharma , and C. Yap . A simple near-optimal subdivision algorithm for complex root isolation based on Pellet test and Newton iteration. arXiv:1509.06231v3 {cs.NA} , Sept. 2015 . 51 Pages. Submitted to Journal . R. Becker, M. Sagraloff, V. Sharma, and C. Yap. A simple near-optimal subdivision algorithm for complex root isolation based on Pellet test and Newton iteration. arXiv:1509.06231v3 {cs.NA}, Sept. 2015. 51 Pages. Submitted to Journal."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.022"},{"key":"e_1_3_2_1_5_1","volume-title":"TR09(136)","author":"Burr M.","year":"2009","unstructured":"M. Burr , F. Krahmer , and C. Yap . Continuous amortization: A non-probabilistic adaptive analysis technique. ECCC , TR09(136) , Dec 2009 . M. Burr, F. Krahmer, and C. Yap. Continuous amortization: A non-probabilistic adaptive analysis technique. ECCC, TR09(136), Dec 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.01.007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806346"},{"key":"e_1_3_2_1_9_1","first-page":"113","volume-title":"Amortized bounds for root isolation via Sturm sequences","author":"Du Z.","year":"2007","unstructured":"Z. Du , V. Sharma , and C. Yap . Amortized bounds for root isolation via Sturm sequences . In D. Wang and L. Zhi, eds., Symbolic-Numeric Computation, Trends in Mathematics, pp. 113 -- 130 . Birkhauser , 2007 . Z. Du, V. Sharma, and C. Yap. Amortized bounds for root isolation via Sturm sequences. In D. Wang and L. Zhi, eds., Symbolic-Numeric Computation, Trends in Mathematics, pp. 113--130. Birkhauser, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145786"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"Algebraic algorithms.% In T","author":"Emiris I. Z.","year":"2014","unstructured":"I. Z. Emiris , V. Y. Pan , and E. P. Tsigaridas . Algebraic algorithms.% In T . Gonzalez, J. Diaz-Herrera, and A. Tucker, editors, In Computing Handbook, 3 rd Edition: Computer Science and Software Engineering, pages 10: 1 -- 30 . Chapman and Hall\/CRC , 2014 . I. Z. Emiris, V. Y. Pan, and E. P. Tsigaridas. Algebraic algorithms.% In T. Gonzalez, J. Diaz-Herrera, and A. Tucker, editors, In Computing Handbook, 3rd Edition: Computer Science and Software Engineering, pages 10: 1--30. Chapman and Hall\/CRC, 2014.","edition":"3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331684.2331710"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0481"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934076"},{"key":"e_1_3_2_1_16_1","volume-title":"The Geometry of Zeros of a Polynomial in a Complex Variable.% Amer. Math. Soc","author":"Marden M.","year":"1949","unstructured":"M. Marden . The Geometry of Zeros of a Polynomial in a Complex Variable.% Amer. Math. Soc ., New York , 1949 . Amer. Math. Soc ., 1949. M. Marden. The Geometry of Zeros of a Polynomial in a Complex Variable.% Amer. Math. Soc., New York, 1949. Amer. Math. Soc., 1949."},{"key":"e_1_3_2_1_17_1","volume-title":"Numerical Methods for Roots of Polynomials, Part 2","author":"McNamee J.","year":"2013","unstructured":"J. McNamee and V. Pan . Numerical Methods for Roots of Polynomials, Part 2 . Elsevier , Amsterdam , 2013 . J. McNamee and V. Pan. Numerical Methods for Roots of Polynomials, Part 2. Elsevier, Amsterdam, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.02.001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1996.0008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595288554"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1999.0532"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0531"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(87)90022-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2003.08.015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442872"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.03.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993938"},{"key":"e_1_3_2_1_28_1","volume-title":"The fundamental theorem of algebra in terms of computational complexity","author":"Sch\u00f6nhage A.","year":"1982","unstructured":"A. Sch\u00f6nhage . The fundamental theorem of algebra in terms of computational complexity , 1982 . Manuscript, Department of Mathematics , University of T\u00fcbingen. 2004 Update with typo corrections and an appendix. %of related subsequent papers. A. Sch\u00f6nhage. The fundamental theorem of algebra in terms of computational complexity, 1982. Manuscript, Department of Mathematics, University of T\u00fcbingen. 2004 Update with typo corrections and an appendix. %of related subsequent papers."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442875"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2000.0555"},{"key":"e_1_3_2_1_31_1","first-page":"434","volume-title":"Computability In Computability in Europe (CiE2013), LNCS","author":"Yap C.","year":"2013","unstructured":"C. Yap , M. Sagraloff , and V. Sharma . Analytic root clustering: A complete algorithm using soft zero tests . In P. Bonizzoni, V. Brattka, and B. Lowe, eds., Computability In Computability in Europe (CiE2013), LNCS vol. 7921 , pages 434 -- 444 , Heidelberg, 2013 . Springer . C. Yap, M. Sagraloff, and V. Sharma. Analytic root clustering: A complete algorithm using soft zero tests. In P. Bonizzoni, V. Brattka, and B. Lowe, eds., Computability In Computability in Europe (CiE2013), LNCS vol. 7921, pages 434--444, Heidelberg, 2013. Springer."},{"key":"e_1_3_2_1_32_1","volume-title":"Fundamental Problems of Algorithmic Algebra","author":"Yap C. K.","year":"2000","unstructured":"C. K. Yap . Fundamental Problems of Algorithmic Algebra . Oxford University Press , 2000 . C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, 2000."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_26"}],"event":{"name":"ISSAC '16: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Waterloo ON Canada","acronym":"ISSAC '16"},"container-title":["Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930889.2930939","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930889.2930939","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930889.2930939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:49Z","timestamp":1750222549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930889.2930939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":31,"alternative-id":["10.1145\/2930889.2930939","10.1145\/2930889"],"URL":"https:\/\/doi.org\/10.1145\/2930889.2930939","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}