{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:58:48Z","timestamp":1726041528972},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268305"},{"type":"electronic","value":"9783030268312"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26831-2_26","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:07:07Z","timestamp":1565809627000},"page":"393-411","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Old and New Nearly Optimal Polynomial Root-Finders"],"prefix":"10.1007","author":[{"given":"Victor Y.","family":"Pan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"26_CR1","volume-title":"The Development of Mathematics","author":"ET Bell","year":"1940","unstructured":"Bell, E.T.: The Development of Mathematics. McGraw-Hill, New York (1940)"},{"key":"26_CR2","volume-title":"A History of Mathematics","author":"CA Boyer","year":"1968","unstructured":"Boyer, C.A.: A History of Mathematics. Wiley, New York (1968)"},{"key":"26_CR3","volume-title":"Polynomial and Linear Control Systems","author":"S Barnett","year":"1983","unstructured":"Barnett, S.: Polynomial and Linear Control Systems. Marcel Dekker, New York (1983)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0213019","volume":"13","author":"DA Bini","year":"1984","unstructured":"Bini, D.A.: Parallel solution of certain Toeplitz linear systems. SIAM J. Comput. 13(2), 268\u2013279 (1984)","journal-title":"SIAM J. Comput."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1019199917103","volume":"23","author":"DA Bini","year":"2000","unstructured":"Bini, D.A., Fiorentino, G.: Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder. Numer. Algorithms 23, 127\u2013173 (2000)","journal-title":"Numer. Algorithms"},{"issue":"2\/3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0898-1221(04)90037-5","volume":"47","author":"DA Bini","year":"2004","unstructured":"Bini, D.A., Gemignani, L., Pan, V.Y.: Inverse power and Durand\/Kerner iteration for univariate polynomial root-finding. Comput. Math. Appl. 47(2\/3), 447\u2013459 (2004)","journal-title":"Comput. Math. Appl."},{"key":"26_CR7","volume-title":"Time Series Analysis: Forecasting and Control","author":"GEP Box","year":"1976","unstructured":"Box, G.E.P., Jenkins, G.M.: Time Series Analysis: Forecasting and Control. Holden-Day, San Francisco (1976)"},{"key":"26_CR8","unstructured":"Bini, D., Pan, V.Y.: Computing matrix eigenvalues and polynomial zeros where the output is real. SIAM J. Comput. 27(4), 1099\u20131115 (1998). Proc. version. In: SODA 1991, pp. 384\u2013393. ACM Press, NY, and SIAM Publ., Philadelphia (1991)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1006\/jcom.1996.0030","volume":"12","author":"D Bini","year":"1996","unstructured":"Bini, D., Pan, V.Y.: Graeffe\u2019s, Chebyshev, and Cardinal\u2019s processes for splitting a polynomial into factors. J. Complex. 12, 492\u2013511 (1996)","journal-title":"J. Complex."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.cam.2013.04.037","volume":"272","author":"DA Bini","year":"2014","unstructured":"Bini, D.A., Robol, L.: Solving secular and polynomial equations: a multiprecision algorithm. J. Comput. Appl. Math. 272, 276\u2013292 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), pp. 71\u201378. ACM Press, New York (2016)","DOI":"10.1145\/2930889.2930939"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2017.03.009","volume":"86","author":"R Becker","year":"2018","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86, 51\u201396 (2018)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"26_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0885-064X(90)90032-9","volume":"6","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., Tiwari, P.: Simple algorithms for approximating all roots of a polynomial with real roots. J. Complex. 6(4), 417\u2013442 (1990)","journal-title":"J. Complex."},{"issue":"217","key":"26_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1090\/S0025-5718-97-00786-2","volume":"66","author":"Q Du","year":"1997","unstructured":"Du, Q., Jin, M., Li, T.Y., Zeng, Z.: The quasi-Laguerre iteration. Math. Comput. 66(217), 345\u2013361 (1997)","journal-title":"Math. Comput."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1090\/S0025-5718-1967-0228165-4","volume":"21","author":"LM Delves","year":"1967","unstructured":"Delves, L.M., Lyness, J.N.: A numerical method for locating the zeros of an analytic function. Math. Comput. 21, 543\u2013560 (1967)","journal-title":"Math. Comput."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/29.17535","volume":"37","author":"CJ Demeure","year":"1989","unstructured":"Demeure, C.J., Mullis, C.T.: The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences. IEEE Trans. Acoust. Speech Signal Process. 37, 545\u2013552 (1989)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1109\/29.60101","volume":"38","author":"CJ Demeure","year":"1990","unstructured":"Demeure, C.J., Mullis, C.T.: A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm. IEEE Trans. Acoust. Speech Signal Process. 38, 1697\u20131709 (1990)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/363067.363115","volume":"10","author":"LW Ehrlich","year":"1967","unstructured":"Ehrlich, L.W.: A modified Newton method for polynomials. Commun. ACM 10, 107\u2013108 (1967)","journal-title":"Commun. ACM"},{"key":"26_CR19","unstructured":"Emiris, I.Z., Pan, V.Y., Tsigaridas, E.: Algebraic algorithms. In: Tucker, A.B., Gonzales, T., Diaz-Herrera, J.L. (eds.) Computing Handbook. Computer Science and Software Engineering, 3rd edn., vol. I, Chap. 10, pp. 10-1\u201310-40. Taylor and Francis Group (2014)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Fortune, S.: J. Symbol. Comput. 33(5), 627\u2013646 (2002). Proc. version in Proc. Intern. Symp. on Symbolic and Algebraic Computation An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials, (ISSAC 2001), 121\u2013128, ACM Press, New York (2001)","DOI":"10.1006\/jsco.2002.0526"},{"key":"26_CR21","first-page":"464","volume":"66","author":"AS Householder","year":"1959","unstructured":"Householder, A.S.: Dandelin, Lobachevskii, or Graeffe? Amer. Math. Mon. 66, 464\u2013466 (1959)","journal-title":"Amer. Math. Mon."},{"key":"26_CR22","unstructured":"Henrici, P.: Applied and computational complex analysis. In: Power Series, Integration, Conformal Mapping, Location of Zeros, vol. 1. Wiley, New York (1974)"},{"key":"26_CR23","volume-title":"Constructive Aspects of the Fundamental Theorem of Algebra","author":"P Henrici","year":"1969","unstructured":"Henrici, P., Gargantini, I.: Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial. In: Dejon, B., Henrici, P. (eds.) Constructive Aspects of the Fundamental Theorem of Algebra. Wiley, New York (1969)"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-96418-8_28","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"R Imbach","year":"2018","unstructured":"Imbach, R., Pan, V.Y., Yap, C.: Implementation of a near-optimal complex root clustering algorithm. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 235\u2013244. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-96418-8_28"},{"key":"26_CR25","unstructured":"Inbach, R., Pan, V.Y., Yap, C., Kotsireas, I.S., Zaderman, V.: Root-finding with implicit deflation. In: Proceedings CASC 2019. \n                    arxiv:1606.01396\n                    \n                  . Accepted 21 May 2019"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1006\/jcom.1998.0481","volume":"14","author":"P Kirrinnis","year":"1998","unstructured":"Kirrinnis, P.: Polynomial factorization and partial fraction decomposition by simultaneous Newton\u2019s iteration. J. Complex. 14, 378\u2013444 (1998)","journal-title":"J. Complex."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Kobel, A., Rouillier, F., Sagraloff, M.: Computing real roots of real polynomials ... and now for real! In: The International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), pp. 301\u2013310. ACM Press, New York (2016)","DOI":"10.1145\/2930889.2930937"},{"key":"26_CR28","first-page":"XIX+354","volume-title":"Numerical Methods for Roots of Polynomials, Part I","author":"JM McNamee","year":"2007","unstructured":"McNamee, J.M.: Numerical Methods for Roots of Polynomials, Part I, p. XIX+354. Elsevier, Amsterdam (2007)"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Moenck, R., Borodin, A.: Fast modular transforms via division., In: Proceedings of 13th Annual Symposium on Switching and Automata Theory (SWAT 1972), pp. 90\u201396. IEEE Computer Society Press (1972)","DOI":"10.1109\/SWAT.1972.5"},{"key":"26_CR30","first-page":"XXI+728","volume-title":"Numerical Methods for Roots of Polynomials, Part II","author":"JM McNamee","year":"2013","unstructured":"McNamee, J.M., Pan, V.Y.: Numerical Methods for Roots of Polynomials, Part II, p. XXI+728. Elsevier, Amsterdam (2013)"},{"key":"26_CR31","unstructured":"Neff, C.A., Reif, J.H.: An \n                    \n                      \n                    \n                    $$o(n^{1 +\\epsilon })$$\n                   algorithm for the complex root problem. In: Proceedings 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 540\u2013547. IEEE Computer Society Press (1994)"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. In: Proceedings of 27th Annual ACM Symposium on Theory of Computing (STOC 1995), pp. 741\u2013750. ACM Press, New York (1995)","DOI":"10.1145\/225058.225292"},{"issue":"2","key":"26_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/S0036144595288554","volume":"39","author":"VY Pan","year":"1997","unstructured":"Pan, V.Y.: Solving a polynomial equation: some history and recent progress. SIAM Rev. 39(2), 187\u2013220 (1997)","journal-title":"SIAM Rev."},{"key":"26_CR34","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1511\/1998.17.915","volume":"86","author":"VY Pan","year":"1998","unstructured":"Pan, V.Y.: Solving polynomials with computers. Am. Sci. 86, 62\u201369 (1998)","journal-title":"Am. Sci."},{"issue":"1","key":"26_CR35","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jcom.1999.0532","volume":"16","author":"VY Pan","year":"2000","unstructured":"Pan, V.Y.: Approximation of complex polynomial zeros: modified quadtree (Weyl\u2019s) construction and improved Newton\u2019s iteration. J. Complex. 16(1), 213\u2013264 (2000)","journal-title":"J. Complex."},{"key":"26_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0129-8","volume-title":"Structured Matrices and Polynomials: Unified Superfast Algorithms","author":"VY Pan","year":"2001","unstructured":"Pan, V.Y.: Structured Matrices and Polynomials: Unified Superfast Algorithms. Birkh\u00e4user\/Springer, Boston\/New York (2001). \n                    https:\/\/doi.org\/10.1007\/978-1-4612-0129-8"},{"issue":"5","key":"26_CR37","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1006\/jsco.2002.0531","volume":"33","author":"VY Pan","year":"2002","unstructured":"Pan, V.Y.: Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. J. Symb. Comput. 33(5), 701\u2013733 (2002)","journal-title":"J. Symb. Comput."},{"key":"26_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2014.09.004","volume":"465","author":"VY Pan","year":"2015","unstructured":"Pan, V.Y.: Transformations of matrix structures work again. Linear Algebra Appl. 465, 1\u201332 (2015)","journal-title":"Linear Algebra Appl."},{"key":"26_CR39","unstructured":"Pan, V.Y.: Root-finding with Implicit Deflation. \n                    arXiv:1606.01396\n                    \n                  , Accepted 4 June 2016"},{"key":"26_CR40","series-title":"Springer Proceedings in Mathematics & Statistics,","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-56932-1_23","volume-title":"Applications of Computer Algebra","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y.: Simple and nearly optimal polynomial root-finding by means of root radii approximation. In: Kotsireas, I., Martinez-Moro, E. (eds.) ACA 2015. SPMS, vol. 198, pp. 329\u2013340. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-56932-1_23"},{"key":"26_CR41","doi-asserted-by":"publisher","first-page":"2799","DOI":"10.1090\/mcom\/3204","volume":"86","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y.: Fast approximate computations with Cauchy matrices and polynomials. Math. Comput. 86, 2799\u20132826 (2017)","journal-title":"Math. Comput."},{"key":"26_CR42","unstructured":"Pan, V.Y.: Old and new nearly optimal polynomial root-finders, In: Proceedings of CASC (2019). Also \n                    arxiv: 1805.12042\n                    \n                   May 2019"},{"key":"26_CR43","unstructured":"Pan, V.Y., Sadikou, A., Landowne, E.: Univariate polynomial division with a remainder by means of evaluation and interpolation. In: Proceedings of 3rd IEEE Symposium on Parallel and Distributed Processing, pp. 212\u2013217. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"26_CR44","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(92)90055-Z","volume":"44","author":"VY Pan","year":"1992","unstructured":"Pan, V.Y., Sadikou, A., Landowne, E.: Polynomial division with a remainder by means of evaluation and interpolation. Inform. Process. Lett. 44, 149\u2013153 (1992)","journal-title":"Inform. Process. Lett."},{"key":"26_CR45","unstructured":"Pan, V.Y., Tsigaridas, E.P.: Nearly optimal refinement of real roots of a univariate polynomial. J. Symb. Comput. 74, 181\u2013204 (2016). Proceedings version. In: Kauers, M. (ed.) Proc. ISSAC 2013, pp. 299\u2013306. ACM Press, New York (2013)"},{"key":"26_CR46","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2017.03.031","volume":"681","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y., Tsigaridas, E.P.: Nearly optimal computations with structured matrices. Theor. Comput. Sci. 681, 117\u2013137 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-24021-3_26","volume-title":"CASC 2015","author":"VY Pan","year":"2015","unstructured":"Pan, V.Y., Zhao, L.: Real root isolation by means of root radii approximation. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2015. LNCS, vol. 9301, pp. 349\u2013360. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-24021-3_26"},{"key":"26_CR48","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2017.03.032","volume":"681","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y., Zhao, L.: Real polynomial root-finding by means of matrix and polynomial iterations. Theor. Comput. Sci. 681, 101\u2013116 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR49","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","volume":"3","author":"J Renegar","year":"1987","unstructured":"Renegar, J.: On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complex. 3(2), 90\u2013113 (1987)","journal-title":"J. Complex."},{"key":"26_CR50","unstructured":"Sch\u00f6nhage, A.: The Fundamental Theorem of Algebra in Terms of Computational Complexity. Department of Mathematics. University of T\u00fcbingen, T\u00fcbingen, Germany (1982)"},{"key":"26_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-11607-9_1","volume-title":"Computer Algebra","author":"A Sch\u00f6nhage","year":"1982","unstructured":"Sch\u00f6nhage, A.: Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients. In: Calmet, J. (ed.) EUROCAM 1982. LNCS, vol. 144, pp. 3\u201315. Springer, Heidelberg (1982). \n                    https:\/\/doi.org\/10.1007\/3-540-11607-9_1"},{"key":"26_CR52","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0885-064X(85)90024-X","volume":"1","author":"A Sch\u00f6nhage","year":"1985","unstructured":"Sch\u00f6nhage, A.: Quasi GCD computations. J. Complex. 1, 118\u2013137 (1985)","journal-title":"J. Complex."},{"key":"26_CR53","unstructured":"Schleicher, D.: Private communication (2018)"},{"key":"26_CR54","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2017.03.025","volume":"681","author":"D Schleicher","year":"2017","unstructured":"Schleicher, D., Stoll, R.: Newton\u2019s method in practice: finding all roots of polynomials of degree one million efficiently. Theor. Comput. Sci. 681, 146\u2013166 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR55","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s100920050005","volume":"35","author":"P Tilli","year":"1998","unstructured":"Tilli, P.: Convergence conditions of some methods for the simultaneous computation of polynomial zeros. Calcolo 35, 3\u201315 (1998)","journal-title":"Calcolo"},{"key":"26_CR56","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8419-9_12","volume-title":"Linear Algebra for Control Theory","author":"P Dooren Van","year":"1994","unstructured":"Van Dooren, P.: Some numerical challenges in control theory. In: Van Dooren, P., Wyman, B. (eds.) Linear Algebra for Control Theory. The IMA Volumes in Mathematics and its Applications, vol. 62. Springer, New York (1994). \n                    https:\/\/doi.org\/10.1007\/978-1-4613-8419-9_12"},{"key":"26_CR57","unstructured":"Weierstrass, K.: Neuer Beweis des Fundamentalsatzes der Algebra. Mathematische Werke, Bd, vol. III, pp. 251\u2013269. Mayer und Mueller, Berlin (1903)"},{"key":"26_CR58","doi-asserted-by":"crossref","unstructured":"Weyl, H.: Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik. Math. Z. 20, 131\u2013151 (1924)","DOI":"10.1007\/BF01188076"},{"key":"26_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0706001","volume":"6","author":"GT Wilson","year":"1969","unstructured":"Wilson, G.T.: Factorization of the covariance generating function of a pure moving-average. SIAM J. Numer. Anal. 6, 1\u20137 (1969)","journal-title":"SIAM J. Numer. Anal."},{"key":"26_CR60","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0090691","volume-title":"Numerical Solution of Nonlinear Equations","author":"W Werner","year":"1981","unstructured":"Werner, W.: Some improvements of classical iterative methods for the solution of nonlinear equations. In: Allgower, E.L., Glashoff, K., Peitgen, H.-O. (eds.) Numerical Solution of Nonlinear Equations. LNM, vol. 878, pp. 426\u2013440. Springer, Heidelberg (1981). \n                    https:\/\/doi.org\/10.1007\/BFb0090691"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26831-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:08:56Z","timestamp":1565809736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26831-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268305","9783030268312"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26831-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc.cs.uni-bonn.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}