{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:03:28Z","timestamp":1775282608771,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0020-0190(95)00032-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:50:09Z","timestamp":1027605009000},"page":"337-342","source":"Crossref","is-referenced-by-count":21,"title":["\u03f5-discrepancy sets and their application for interpolation of sparse polynomials"],"prefix":"10.1016","volume":"54","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00032-8_BIB1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1112\/blms\/22.6.583","article-title":"Construction of a thin set with small Fourier coefficients","volume":"22","author":"Ajtai","year":"1990","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0020-0190(95)00032-8_BIB2_1","series-title":"Proc. 31th Ann. Symp. on Foundations of Computer Science","first-page":"544","article-title":"Simple constructions of almost k-wise independent random variables","author":"Alon","year":"1990"},{"key":"10.1016\/0020-0190(95)00032-8_BIB2_2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"Alon","year":"1992","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0020-0190(95)00032-8_BIB3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/rsa.3240050203","article-title":"Random cayley graphs and expanders","volume":"5","author":"Alon","year":"1994","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0020-0190(95)00032-8_BIB4","series-title":"Approximating arbitrary probability distributions using small sample spaces","author":"Azar","year":"1990"},{"key":"10.1016\/0020-0190(95)00032-8_BIB5","series-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing","first-page":"301","article-title":"A deterministic algorithm for sparse multivariate polynomial interpolation","author":"Ben-Or","year":"1988"},{"key":"10.1016\/0020-0190(95)00032-8_BIB6","series-title":"Proc. 26th Ann. ACM Symp. on Theory of Computing","first-page":"584","article-title":"Improved algorithms via approximations of probability distributions","author":"Chari","year":"1994"},{"key":"10.1016\/0020-0190(95)00032-8_BIB7","series-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing","first-page":"10","article-title":"Approximations of general independent distributions","author":"Even","year":"1992"},{"key":"10.1016\/0020-0190(95)00032-8_BIB8","series-title":"Proc. 28th Ann. Symp. on Foundations of Computer Science","first-page":"166","article-title":"The matching problem for bipartite graphs with polynomially bounded permanents in NC","author":"Grigoriev","year":"1987"},{"key":"10.1016\/0020-0190(95)00032-8_BIB9","first-page":"197","article-title":"An estimate for character sums","volume":"2","author":"Katz","year":"1989","journal-title":"J. AMS"},{"key":"10.1016\/0020-0190(95)00032-8_BIB10","series-title":"Proc. ICALP","first-page":"261","article-title":"Randomized approximation and interpolation of sparse polynomials","author":"Mansour","year":"1992"},{"key":"10.1016\/0020-0190(95)00032-8_BIB11","series-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing","first-page":"213","article-title":"Small bias probability spaces: Efficient construction and applications","author":"Naor","year":"1990"},{"key":"10.1016\/0020-0190(95)00032-8_BIB12","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1017\/S0963548300000870","article-title":"Constructing small sets that are uniform in arithmetic progressions","volume":"2","author":"Razborov","year":"1993","journal-title":"Combinatorics, Probability and Computing"},{"key":"10.1016\/0020-0190(95)00032-8_BIB13","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","volume":"72","author":"Zippel","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095000328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095000328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:55:54Z","timestamp":1556502954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095000328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0020019095000328"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00032-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}