{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:11Z","timestamp":1742913491908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_39","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T11:12:06Z","timestamp":1460718726000},"page":"451-465","source":"Crossref","is-referenced-by-count":2,"title":["Precision-Driven Computation in the Evaluation of Expression-Dags with Common Subexpressions: Problems and Solutions"],"prefix":"10.1007","author":[{"given":"Marc","family":"M\u00f6rig","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"key":"39_CR1","unstructured":"Burnikel, C., Fleischer, R., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: The LEDA class real number - extended version. Technical report, ECG-TR-363110-01, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (2005)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Efficient exact geometric computation made easy. In: Proceedings of the 15th Symposium on Computational Geometry (SoCG 1999), pp. 341\u2013350. ACM (1999)","DOI":"10.1145\/304893.304988"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00453-007-9132-4","volume":"55","author":"C Burnikel","year":"2009","unstructured":"Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A separation bound for real algebraic expressions. Algorithmica 55(1), 14\u201328 (2009)","journal-title":"Algorithmica"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.K.: A core library for robust numeric and geometric computation. In: Proceedings of the 15th Symposium on Computational Geometry (SoCG 1999), pp. 351\u2013359. ACM (1999)","DOI":"10.1145\/304893.304989"},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.comgeo.2007.06.003","volume":"40","author":"L Kettner","year":"2008","unstructured":"Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.K.: Classroom examples of robustness problems in geometric computation. Comput. Geom.: Theory Appl. 40(1), 61\u201378 (2008)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"39_CR6","unstructured":"Li, C., Yap, C.K.: A new constructive root bound for algebraic expressions. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 496\u2013505. SIAM (2001)"},{"key":"39_CR7","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"39_CR8","series-title":"Springer Mathematics","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-7091-6280-4_16","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Schirra, S.: Exact computation with leda_real - theory and geometric applications. In: Alefeld, G., Rohn, J., Rump, S.M., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods. Springer Mathematics, pp. 163\u2013172. Springer, Wien, Austria (2001)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0196-6774(82)90019-0","volume":"3","author":"M Mignotte","year":"1982","unstructured":"Mignotte, M.: Identification of algebraic numbers. J. Algorithms 3, 197\u2013204 (1982)","journal-title":"J. Algorithms"},{"key":"39_CR10","unstructured":"M\u00f6rig, M.: Algorithm Engineering for Expression Dag Based Number Types. Ph.D. thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2015)"},{"issue":"4","key":"39_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11786-011-0086-1","volume":"4","author":"M M\u00f6rig","year":"2010","unstructured":"M\u00f6rig, M., R\u00f6ssling, I., Schirra, S.: On the design and implementation of a generic number type for real algebraic number computations based on expression dags. Math. Comput. Sci. 4(4), 539\u2013556 (2010)","journal-title":"Math. Comput. Sci."},{"issue":"1\u20133","key":"39_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2006.09.010","volume":"369","author":"S Pion","year":"2006","unstructured":"Pion, S., Yap, C.K.: Constructive root bound for \n                      \n                        \n                      \n                      $$k$$\n                    -ary rational input numbers. Theor. Comput. Sci. 369(1\u20133), 361\u2013376 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR13","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Monographs in Computer Science, 1st edn. Springer, New York (1985)","edition":"1"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, chap. 14, pp. 597\u2013632. Elsevier, Amsterdam, The Netherlands (2000)","DOI":"10.1016\/B978-044482537-7\/50015-2"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03456-5_27","volume-title":"Efficient Algorithms","author":"S Schirra","year":"2009","unstructured":"Schirra, S.: Much ado about zero. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 408\u2013421. Springer, Heidelberg (2009)"},{"key":"39_CR16","unstructured":"Schirra, S.: On the use of adaptive, exact decisions number types based on expression-dags in geometric computing. In: 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)"},{"issue":"1\u20132","key":"39_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","volume":"7","author":"CK Yap","year":"1997","unstructured":"Yap, C.K.: Towards exact geometric computation. Comput. Geom.: Theory Appl. 7(1\u20132), 3\u201323 (1997)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Yap, C.K.: On guaranteed accuracy computation. In: Geometric Computation, pp. 322\u2013373. World Scientific (2004)","DOI":"10.1142\/9789812794833_0012"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Yap, C.K.: Robust geometric computation. In: Handbook of Discrete and Computational Geometry, 2nd edn., chap. 41, pp. 927\u2013952. CRC (2004)","DOI":"10.1201\/9781420035315.ch41"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Yap, C.K., Dub\u00e9, T.: The exact computation paradigm. In: Computing in Euclidean Geometry, 2nd edn., pp. 452\u2013486. World Scientific (1995)","DOI":"10.1142\/9789812831699_0011"},{"key":"39_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15582-6_24","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"J Yu","year":"2010","unstructured":"Yu, J., Yap, C., Du, Z., Pion, S., Br\u00f6nnimann, H.: The design of Core 2: a library for exact numeric computation in geometry and algebra. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 121\u2013141. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:33:58Z","timestamp":1559421238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}