{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:10:22Z","timestamp":1725790222846},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,7,29]]},"DOI":"10.1145\/1277548.1277554","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T14:19:41Z","timestamp":1197037181000},"page":"33-40","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving toeplitz- and vandermonde-like linear systems with large displacement rank"],"prefix":"10.1145","author":[{"given":"Alin","family":"Bostan","sequence":"first","affiliation":[{"name":"Algorithms Project, INRIA, Le Chesnay Cedex, France"}]},{"given":"Claude-Pierre","family":"Jeannerod","sequence":"additional","affiliation":[{"name":"Ar\u00e9naire Project, INRIA, Lyon, France"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"University of Western Ontario, London, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(92)90039-Z"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897326912"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"e_1_3_2_1_5_1","volume-title":"Fundamental Algorithms","author":"Bini D.","year":"1994","unstructured":"D. Bini and V. Y. Pan . Polynomial and Matrix Computations , volume 1 : Fundamental Algorithms . Birkh\u00e4user , 1994 . D. Bini and V. Y. Pan. Polynomial and Matrix Computations, volume 1: Fundamental Algorithms.Birkh\u00e4user, 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90161-5"},{"key":"e_1_3_2_1_7_1","unstructured":"A. Bostan C.-P. Jeannerod and \u00c9. Schost. Solving structured linear systems with large displacement rank. Technical report. A. Bostan C.-P. Jeannerod and \u00c9. Schost. Solving structured linear systems with large displacement rank. Technical report."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74556"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780515"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145785"},{"key":"e_1_3_2_1_14_1","volume-title":"Gr\u00f6bner basis structure of finite sets of points, preprint","author":"Gao S.","year":"2003","unstructured":"S. Gao , V. M. Rodrigues , and J. Stroomer . Gr\u00f6bner basis structure of finite sets of points, preprint , 2003 . S. Gao, V. M. Rodrigues, and J. Stroomer. Gr\u00f6bner basis structure of finite sets of points, preprint, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018981505752"},{"key":"e_1_3_2_1_16_1","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2003","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra . Cambridge University Press , second edition, 2003 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, second edition, 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272074"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860889"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90189-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(79)90124-0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190431"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/2153451"},{"volume-title":"ISSAC'88,volume358","author":"Kaltofen E.","key":"e_1_3_2_1_24_1","unstructured":"E. Kaltofen and Y. Lakshman . Improved sparse multivariate polynomial interpolation algorithms . In ISSAC'88,volume358 of LNCS. Springer Verlag , 467--474. E. Kaltofen and Y. Lakshman. Improved sparse multivariate polynomial interpolation algorithms. In ISSAC'88,volume358 of LNCS. Springer Verlag, 467--474."},{"key":"e_1_3_2_1_25_1","series-title":"LNCS","first-page":"29","volume-title":"AAECC-9","author":"Kaltofen E.","year":"1991","unstructured":"E. Kaltofen and D. Saunders . On Wiedemann's method of solving sparse linear systems . In AAECC-9 , volume 539 of LNCS , pages 29 -- 38 . Springer Verlag , 1991 . E. Kaltofen and D. Saunders. On Wiedemann's method of solving sparse linear systems. In AAECC-9, volume 539 of LNCS, pages 29--38. Springer Verlag, 1991."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.01.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219006"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90393-O"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(85)80035-3"},{"key":"e_1_3_2_1_30_1","volume-title":"Stanford University","author":"Morf M.","year":"1974","unstructured":"M. Morf . Fast algorithms for multivariable systems.PhD thesis , Stanford University , 1974 . M. Morf. Fast algorithms for multivariable systems.PhD thesis, Stanford University, 1974."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1980.1171074"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000000037"},{"key":"e_1_3_2_1_33_1","first-page":"544","volume-title":"ESA","author":"N\u00fcsken M.","year":"2004","unstructured":"M. N\u00fcsken and M. Ziegler . Fast multipoint evaluation of bivariate polynomials . In ESA 2004 , number 3222 in LNCS, pages 544 -- 555 . Springer , 2004. M. N\u00fcsken and M. Ziegler. Fast multipoint evaluation of bivariate polynomials. In ESA 2004, number 3222 in LNCS, pages 544--555. Springer, 2004."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1990-1023051-7"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(92)90215-4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/500845"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00041-0"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_41_1","volume-title":"Notes on computing minimal approximant bases. Technical report","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann . Notes on computing minimal approximant bases. Technical report , Symbolic Computation Group , University of Waterloo, 2006 . A. Storjohann. Notes on computing minimal approximant bases. Technical report, Symbolic Computation Group, University of Waterloo, 2006."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02141952"},{"key":"e_1_3_2_1_44_1","volume-title":"EUROSAM' 79,volume 72ofLNCS","author":"Zippel R.","year":"1979","unstructured":"R. Zippel . Probabilistic algorithms for sparse polynomials. In EUROSAM' 79,volume 72ofLNCS . Springer Verlag , 1979 . R. Zippel. Probabilistic algorithms for sparse polynomials. In EUROSAM' 79,volume 72ofLNCS. Springer Verlag, 1979."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80018-1"}],"event":{"name":"ISSAC07: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Waterloo Ontario Canada","acronym":"ISSAC07"},"container-title":["Proceedings of the 2007 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1277548.1277554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T05:48:20Z","timestamp":1673329700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":44,"alternative-id":["10.1145\/1277548.1277554","10.1145\/1277548"],"URL":"https:\/\/doi.org\/10.1145\/1277548.1277554","relation":{},"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}