{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:54Z","timestamp":1760061594768,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2930889.2930928","type":"proceedings-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:59:33Z","timestamp":1468929573000},"page":"295-302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts"],"prefix":"10.1145","author":[{"given":"Claude-Pierre","family":"Jeannerod","sequence":"first","affiliation":[{"name":"Inria, Universite de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[{"name":"ENS de Lyon, Universite de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Villard","sequence":"additional","affiliation":[{"name":"CNRS, Universite de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1137\/S0895479892230031"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/S0895479897326912"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/j.jsc.2006.02.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/j.jsc.2010.03.010"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1016\/j.tcs.2008.05.014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/BF01178683"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TIT.2015.2416068"},{"key":"e_1_3_2_1_10_1","first-page":"271","volume-title":"Tenth Algorithmic Number Theory Symposium","author":"Cohn H.","year":"2012","unstructured":"H. Cohn and N. Heninger . Approximate common divisors via lattices . In Tenth Algorithmic Number Theory Symposium , pages 271 -- 293 . Mathematical Sciences Publishers (MSP) , 2012 --2013. H. Cohn and N. Heninger. Approximate common divisors via lattices. In Tenth Algorithmic Number Theory Symposium, pages 271--293. Mathematical Sciences Publishers (MSP), 2012--2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_12_1","first-page":"269","volume-title":"USENIX Security 12","author":"Devet C.","year":"2012","unstructured":"C. Devet , I. Goldberg , and N. Heninger . Optimally robust private information retrieval . In USENIX Security 12 , pages 269 -- 283 . USENIX, 2012 . C. Devet, I. Goldberg, and N. Heninger. Optimally robust private information retrieval. In USENIX Security 12, pages 269--283. USENIX, 2012."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2013","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra ( third edition). Cambridge University Press , 2013 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra (third edition). Cambridge University Press, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/860854.860889"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1993886.1993913"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/TIT.2007.911222"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_1_18_1","volume-title":"Computing minimal interpolation bases. HAL Open archive - https:\/\/hal.inria.fr\/hal-01241781","author":"Jeannerod C.-P.","year":"2015","unstructured":"C.-P. Jeannerod , V. Neiger , \u00c9. Schost, and G. Villard . Computing minimal interpolation bases. HAL Open archive - https:\/\/hal.inria.fr\/hal-01241781 , 2015 . C.-P. Jeannerod, V. Neiger, \u00c9. Schost, and G. Villard. Computing minimal interpolation bases. HAL Open archive - https:\/\/hal.inria.fr\/hal-01241781, 2015."},{"key":"e_1_3_2_1_19_1","volume-title":"Linear Systems","author":"Kailath T.","year":"1980","unstructured":"T. Kailath . Linear Systems . Prentice-Hall , 1980 . T. Kailath. Linear Systems. Prentice-Hall, 1980."},{"key":"e_1_3_2_1_20_1","first-page":"269","volume-title":"Congr\u00e8s int. Math.","volume":"3","author":"Knuth D. E.","year":"1970","unstructured":"D. E. Knuth . The analysis of algorithms . In Congr\u00e8s int. Math. , Nice, France , volume 3 , pages 269 -- 274 , 1970 . D. E. Knuth. The analysis of algorithms. In Congr\u00e8s int. Math., Nice, France, volume 3, pages 269--274, 1970."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/TIT.2003.819332"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/2608628.2608664"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/800125.804045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/S0747-7171(02)00139-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/301250.301311"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/SFCS.2005.29"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1109\/18.817522"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1993886.1993931"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/BF00289520"},{"key":"e_1_3_2_1_30_1","volume-title":"Dagstuhl Seminar Proceedings","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann . Notes on computing minimal approximant bases . In Dagstuhl Seminar Proceedings , 2006 . A. Storjohann. Notes on computing minimal approximant bases. In Dagstuhl Seminar Proceedings, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/BF02141952"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1109\/TIT.2011.2162160"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1016\/j.jsc.2011.12.009"}],"event":{"sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC '16","name":"ISSAC '16: International Symposium on Symbolic and Algebraic Computation","location":"Waterloo ON Canada"},"container-title":["Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930889.2930928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930889.2930928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:48Z","timestamp":1750222548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930889.2930928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":31,"alternative-id":["10.1145\/2930889.2930928","10.1145\/2930889"],"URL":"https:\/\/doi.org\/10.1145\/2930889.2930928","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}