{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:11:50Z","timestamp":1780474310810,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540651420","type":"print"},{"value":"9783540495437","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_2","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"15-24","source":"Crossref","is-referenced-by-count":11,"title":["A Derandomization Using Min-Wise Independent Permutations"],"prefix":"10.1007","author":[{"given":"Andrei Z.","family":"Broder","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. H\u00e4stad, and R. Peralta. Simple constructions of almost kwise independent random variables. Random Structures and Algorithms, 3(3):289\u2013304, 1992.","journal-title":"Random Structures and Algorithms"},{"key":"2_CR2","unstructured":"A. Z. Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences 1997, pages 21\u201329. IEEE Computer Society, 1988."},{"key":"2_CR3","unstructured":"A. Z. Broder. Filtering near-duplicate documents. In Proceedings of FUN 98, 1998. To appear."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 327\u2013336, 1998.","DOI":"10.1145\/276698.276781"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proceedings of the Sixth International World Wide Web Conference, pages 391\u2013404, 1997.","DOI":"10.1016\/S0169-7552(97)00031-7"},{"issue":"2","key":"2_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143\u2013154, Apr. 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"U. Feige. A threshold of ln n for approximating set cover (preliminary version). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 314\u2013318, Philadelphia, Pennsylvania, 22\u201324 May 1996.","DOI":"10.1145\/237814.237977"},{"key":"2_CR8","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"2_CR9","unstructured":"P. Indyk, A small approximately min-wise independent family of hash functions. manuscript, 1998."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013104. Plenum Press, New York, 1972."},{"key":"2_CR11","volume-title":"Technical Report TR-95-035","author":"M. Luby","year":"1995","unstructured":"M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, Berkeley, California, 1995."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"S. Rajagopalan and V. V. Vazirani. Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In 34th Annual Symposium on Foundations of Computer Science, pages 322\u2013331, Palo Alto, California, 3-5 Nov. 1993. IEEE. Journal version to appear in SIAM Journal of Computing.","DOI":"10.1109\/SFCS.1993.366855"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:46:02Z","timestamp":1556466362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}