{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:48:40Z","timestamp":1750913320989},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000,1]]},"DOI":"10.1016\/s0020-0190(99)00163-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:19:59Z","timestamp":1027603199000},"page":"29-32","source":"Crossref","is-referenced-by-count":11,"title":["Low discrepancy sets yield approximate min-wise independent permutation families"],"prefix":"10.1016","volume":"73","author":[{"given":"Michael","family":"Saks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Zuckerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00163-5_ID011","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","volume":"Vol. 7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(99)00163-5_ID012","series-title":"Proc. IEEE Symposium on Foundations of Computer Science","first-page":"412","article-title":"Discrepancy sets and pseudorandom generators for combinatorial rectangles","author":"Armoni","year":"1996"},{"key":"10.1016\/S0020-0190(99)00163-5_ID013","series-title":"Proc. ACM Symposium on Theory of Computing","first-page":"327","article-title":"Min-wise independent permutations","author":"Broder","year":"1998"},{"key":"10.1016\/S0020-0190(99)00163-5_ID014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/blms\/13.1.1","article-title":"Finite permutation groups and finite simple groups","volume":"Vol. 13","author":"Cameron","year":"1981","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/S0020-0190(99)00163-5_ID015","series-title":"Proc. ACM Symposium on Theory of Computing","first-page":"10","article-title":"Approximations of general independent distributions","author":"Even","year":"1992"},{"key":"10.1016\/S0020-0190(99)00163-5_ID016","series-title":"Proc. ACM Symposium on Theory of Computing","first-page":"356","article-title":"Pseudorandomness for network algorithms","author":"Impagliazzo","year":"1994"},{"key":"10.1016\/S0020-0190(99)00163-5_ID017","series-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","first-page":"454","article-title":"A small approximately min-wise independent family of hash functions","author":"Indyk","year":"1999"},{"issue":"1","key":"10.1016\/S0020-0190(99)00163-5_ID018","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1214\/aop\/1176996762","article-title":"On a set of almost deterministic k-independent random variables","volume":"Vol. 2","author":"Joffe","year":"1974","journal-title":"Ann. Probab."},{"key":"10.1016\/S0020-0190(99)00163-5_ID019","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","article-title":"A fast parallel algorithm for the maximal independent set problem","volume":"Vol. 32","author":"Karp","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00163-5_ID020","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200907","article-title":"Efficient construction of a small hitting set for combinatorial rectangles in high dimension","volume":"Vol. 17","author":"Linial","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(99)00163-5_ID021","series-title":"Proc. International Conference on Automata, Languages and Programming","first-page":"223","article-title":"Improved pseudorandom generators for combinatorial rectangles","author":"Lu","year":"1998"},{"issue":"4","key":"10.1016\/S0020-0190(99)00163-5_ID022","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"Vol. 15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(99)00163-5_ID023","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/PL00003817","article-title":"On the construction of pseudo-random permutations: Luby\u2013Rackoff revisited","volume":"Vol. 12","author":"Naor","year":"1999","journal-title":"J. Cryptology"},{"key":"10.1016\/S0020-0190(99)00163-5_ID024","series-title":"Notes on Geometry","author":"Rees","year":"1983"},{"key":"10.1016\/S0020-0190(99)00163-5_ID025","series-title":"An optimal construction of exactly min-wise independent permutations","author":"Takei","year":"1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001635?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001635?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:21:40Z","timestamp":1556144500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0020019099001635"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00163-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}