{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:10Z","timestamp":1726410070031},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663294"},{"type":"electronic","value":"9783540484134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_2","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T12:52:41Z","timestamp":1295009561000},"page":"11-15","source":"Crossref","is-referenced-by-count":0,"title":["Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families"],"prefix":"10.1007","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":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"Journal of Algorithms"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations. In: Proc. ACM Symposium on Theory of Computing, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/blms\/13.1.1","volume":"13","author":"P.J. Cameron","year":"1981","unstructured":"Cameron, P.J.: Finite permutation groups and finite simple groups. Bull. London Math. Soc.\u00a013, 1\u201322 (1981)","journal-title":"Bull. London Math. Soc."},{"key":"2_CR4","unstructured":"Indyk, P.: A small approximately min-wise independent family of hash functions. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 454\u2013456 (1999)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1214\/aop\/1176996762","volume":"2","author":"A. Joffe","year":"1974","unstructured":"Joffe, A.: On a set of almost deterministic k-independent random variables. Annals of Probability\u00a02, 161\u2013162 (1974)","journal-title":"Annals of Probability"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"R.M. Karp","year":"1985","unstructured":"Karp, R.M., Wigderson, A.: A fast parallel algorithm for the maximal independent set problem. Journal of the ACM\u00a032, 762\u2013773 (1985)","journal-title":"Journal of the ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Lu, C.-J.: Improved pseudorandom generators for combinatorial rectangles. In: Proc. International Conference on Automata, Languages and Programming, pp. 223\u2013234 (1998)","DOI":"10.1007\/BFb0055056"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput.\u00a015, 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology\u00a012, 29\u201366 (1999)","journal-title":"J. of Cryptology"},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61777-5","volume-title":"Notes on Geometry","author":"E.G. Rees","year":"1983","unstructured":"Rees, E.G.: Notes on Geometry. Springer, Heidelberg (1983)"},{"key":"2_CR11","unstructured":"Takei, Y., Itoh, T., Shinozaki, T.: An optimal construction of exactly min-wise independent permutations. Technical Report COMP98-62, IEICE (1998)"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:19:18Z","timestamp":1559942358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}