{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:45Z","timestamp":1761611205364,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_21","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:43:15Z","timestamp":1179506595000},"page":"254-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A Separation Bound for Real Algebraic Expressions"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Burnikel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Exact efficient computational geometry made easy. In Proceedings of the 15th Annual Symposium on Computational Geometry (SCG\u201999), pages 341\u2013350, 1999. http:\/\/www.mpi-sb.mpg.de\/~mehlhorn\/ftp\/egcme.ps .","DOI":"10.1145\/304893.304988"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004530010005","volume":"27","author":"C. Burnikel","year":"2000","unstructured":"C. Burnikel, R. Fleischer, K. Mehlhorn, S. Schirra. A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica, 27:87\u201399, 2000.","journal-title":"Algorithmica"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BFb0049411","volume-title":"Proceedings of the 2nd Annual European Symposium on Algorithms-ESA\u2019 94","author":"C. Burnikel","year":"1994","unstructured":"C. Burnikel, K. Mehlhorn, and S. Schirra. How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In Springer, editor, Proceedings of the 2nd Annual European Symposium on Algorithms-ESA\u2019 94, volume 855 of Lecture Notes in Computer Science, pages 227\u2013239, 1994."},{"key":"21_CR4","volume-title":"Technical Report MPI-I-96-1-001","author":"C. Burnikel","year":"1996","unstructured":"C. Burnikel, K. Mehlhorn, and S. Schirra. The LEDA class real number. Technical Report MPI-I-96-1-001, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1996."},{"key":"21_CR5","unstructured":"J.F. Canny. The Complexity of Robot Motion Planning. The MIT Press, 1987."},{"key":"21_CR6","volume-title":"Vorlesungen \u00fcber die Theorie der algebraischen Zahlen","author":"E. Hecke","year":"1970","unstructured":"E. Hecke. Vorlesungen \u00fcber die Theorie der algebraischen Zahlen. Chelsea, New York, 1970."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"V. Karamcheti, C. Li, I. Pechtchanski, and Chee Yap. A core library for robust numeric and geometric computation. In Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pages 351\u2013359, Miami, Florida, 1999.","DOI":"10.1145\/304893.304989"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"R. Loos. Computing in algebraic extensions. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra. Symbolic and Algebraic Computation, volume 4 of Computing Supplementum, pages 173\u2013188. Springer-Verlag, 1982.","DOI":"10.1007\/978-3-7091-3406-1_12"},{"key":"21_CR9","unstructured":"C. Li and C. Yap. A new constructive root bound for algebraic expressions. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 496\u2013505, 2001."},{"issue":"3","key":"21_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0196-6774(82)90019-0","volume":"3","author":"M. Mignotte","year":"1982","unstructured":"M. Mignotte. Identification of Algebraic Numbers. Journal of Algorithms, 3(3):197\u2013204, September 1982.","journal-title":"Journal of Algorithms"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"M. Mignotte. Mathematics for Computer Algebra. Springer, 1992.","DOI":"10.1007\/978-1-4613-9171-5"},{"key":"21_CR12","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platformfor Combinatorial and Geometric Computing. Cambridge University Press, 1999. http:\/\/www.mpi-sb.mpg.de\/LEDA\/leda.html ."},{"key":"21_CR13","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"K. Mehlhorn","year":"2001","unstructured":"K. Mehlhorn and St. Schirra. Exact computation with ledareal-theory and geometric applications. In G. Alefeld, J. Rohn, S. Rumpf, and T. Yamamoto, editors, Symbolic Algebraic Methods and Verification Methods. Springer Verlag, Vienna, 2001."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. Neukirch. Algebraische Zahlentheorie. Springer-Verlag, 1990.","DOI":"10.1007\/978-3-322-80265-1_13"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.2307\/2589344","volume":"107","author":"E. R. Scheinerman","year":"2000","unstructured":"E. R. Scheinerman. When close enough is close enough. American Mathematical Monthly, 107:489\u2013499, 2000.","journal-title":"American Mathematical Monthly"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"C.K. Yap. Towards exact geometric computation. CGTA: Computational Geometry: Theory and Applications, 7, 1997.","DOI":"10.1016\/0925-7721(95)00040-2"},{"key":"21_CR17","unstructured":"C.K. Yap. Fundamental Problems in Algorithmic Algebra. Oxford University Press, 1999."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"C.K. Yap and T. Dube. The exact computation paradigm. In Computing in Euclidean Geometry II. World Scientific Press, 1995.","DOI":"10.1142\/9789812831699_0011"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T12:18:46Z","timestamp":1737029926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}