{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:02:24Z","timestamp":1743008544795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417238"},{"type":"electronic","value":"9783031417245"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41724-5_13","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:02:38Z","timestamp":1692774158000},"page":"233-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Parametric Linear Systems Using Sparse Rational Function Interpolation"],"prefix":"10.1007","author":[{"given":"Ayoola","family":"Jinadu","sequence":"first","affiliation":[]},{"given":"Michael","family":"Monagan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00200-005-0190-z","volume":"17","author":"NB Atti","year":"2006","unstructured":"Atti, N.B., Lombardi, H., Diaz-Toca, G.M.: The Berlekamp-Massey algorithm revisited. AAECC 17(4), 75\u201382 (2006)","journal-title":"AAECC"},{"issue":"103","key":"13_CR2","first-page":"565","volume":"22","author":"E Bareiss","year":"1968","unstructured":"Bareiss, E.: Sylvester\u2019s identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22(103), 565\u2013578 (1968)","journal-title":"Math. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings of STOC 2020, pp. 301\u2013309. ACM (1988)","DOI":"10.1145\/62212.62241"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1016\/j.tcs.2010.11.050","volume":"412","author":"A Cuyt","year":"2011","unstructured":"Cuyt, A., Lee, W.-S.: Sparse interpolation of multivariate rational functions. J. Theor. Comput. Sci. 412, 1445\u20131456 (2011)","journal-title":"J. Theor. Comput. Sci."},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"718","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Natl. Bureau Stand. 718(4), 241\u2013245 (1967)","journal-title":"J. Res. Natl. Bureau Stand."},{"key":"13_CR6","unstructured":"Gelfond, A.: Transcendental and Algebraic Numbers. GITTL, Moscow (1952). English translation by Leo, F., Boron, Dover, New York (1960)"},{"issue":"126","key":"13_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1090\/S0025-5718-1974-0373369-7","volume":"28","author":"WM Gentleman","year":"1974","unstructured":"Gentleman, W.M., Johnson, S.C.: The evaluation of determinants by expansion by minors and the general problem of substitution. Math. Comput. 28(126), 543\u2013548 (1974)","journal-title":"Math. Comput."},{"key":"13_CR8","unstructured":"Lipson, J.: Symbolic methods for the computer solution of linear equations with applications to flow graphs. In: Proceedings of SISMC 1968, pp. 233\u2013303. IBM (1969)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Hu, J., Monagan, M.: A fast parallel sparse polynomial GCD algorithm. In: Proceedings of ISSAC 2016, pp. 271\u2013278. ACM (2016)","DOI":"10.1145\/2930889.2930903"},{"key":"13_CR10","unstructured":"Hu, J.: Computing polynomial greatest common divisors using sparse interpolation. Ph.D. thesis, Simon Fraser University (2018)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-031-14788-3_11","volume-title":"Computer Algebra in Scientific Computing","author":"A Jinadu","year":"2022","unstructured":"Jinadu, A., Monagan, M.: An interpolation algorithm for computing Dixon resultants. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2022. LNCS, vol. 13366, pp. 185\u2013205. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14788-3_11"},{"issue":"2","key":"13_CR12","first-page":"88","volume":"56","author":"A Jinadu","year":"2022","unstructured":"Jinadu, A., Monagan, M.: A new interpolation algorithm for computing Dixon Resultants. ACM 56(2), 88\u201391 (2022)","journal-title":"ACM"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Lee, W., Lobo, A.: Early termination in Ben-Or\/Tiwari sparse interpolation and a hybrid of Zippel\u2019s algorithm. In: Proceedings of ISSAC 2000, pp. 192\u2013201. ACM (2000)","DOI":"10.1145\/345542.345629"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Monagan, M.: Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. In: Proceedings of ISSAC 2004, pp. 243\u2013249. ACM (2004)","DOI":"10.1145\/1005285.1005321"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-04103-7_20","volume-title":"Computer Algebra in Scientific Computing","author":"M Monagan","year":"2009","unstructured":"Monagan, M., Vrbik, P.: Lazy and forgetful polynomial arithmetic and applications. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2009. LNCS, vol. 5743, pp. 226\u2013239. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04103-7_20"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41724-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:05:44Z","timestamp":1692774344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41724-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417238","9783031417245"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41724-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","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":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.17","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.41","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}