{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T23:36:28Z","timestamp":1725406588672},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/iwsda.2015.7458408","type":"proceedings-article","created":{"date-parts":[[2016,4,25]],"date-time":"2016-04-25T21:45:12Z","timestamp":1461620712000},"page":"33-37","source":"Crossref","is-referenced-by-count":0,"title":["Computationally-efficient sparse polynomial interpolation"],"prefix":"10.1109","author":[{"given":"Sameer","family":"Pawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesan","family":"Nallampatti Ekambaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Efficient Computation with Sparse and Dense Polynomials","year":"2011","author":"roche","key":"ref10"},{"key":"ref11","first-page":"160","article-title":"Parallel sparse polynomial interpolation over finite fields","author":"mohammad","year":"2010","journal-title":"Proceedings of the international workshop on Parallel symbolic computation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792239291"},{"journal-title":"Fast Algorithms for Digital Signal Processing","year":"1985","author":"blahut","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055817"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620269"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1984-0744931-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51084-2_44"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2165952"},{"key":"ref1","first-page":"883","article-title":"Predicting execution time of computer programs using sparse polynomial regression","author":"huang","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.030"}],"event":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","start":{"date-parts":[[2015,9,14]]},"location":"Bengaluru, India","end":{"date-parts":[[2015,9,18]]}},"container-title":["2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7452893\/7458374\/07458408.pdf?arnumber=7458408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T16:46:33Z","timestamp":1489769193000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7458408\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iwsda.2015.7458408","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}