{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:40Z","timestamp":1725574120003},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_33","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:32:30Z","timestamp":1294439550000},"page":"396-408","source":"Crossref","is-referenced-by-count":2,"title":["A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries"],"prefix":"10.1007","author":[{"given":"Jun","family":"Tarui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshinori","family":"Takei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_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. J. of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"J. of Algorithms"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A.: On the Resemblance and Containment of Documents. In: Proc. of Compression and Complexity of Sequences, pp. 21\u201329 (1998)","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-Wise Independent Permutations. In: Proc. of the 30th Annual ACM Symposium on Theory of Computing, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-49543-6_2","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"A. Broder","year":"1998","unstructured":"Broder, A., Charikar, M., Mitzenmacher, M.: A Derandomization Using Min-Wise Independent Permutations. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 15\u201324. Springer, Heidelberg (1998)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/1098-2418(200101)18:1<18::AID-RSA2>3.0.CO;2-M","volume":"18","author":"A. Broder","year":"2001","unstructured":"Broder, A., Mitzenmacher, M.: Completeness and Robustness Properties of Min-Wise Independent Permutations. Random Structures and Algorithms\u00a018, 18\u201330 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"33_CR6","unstructured":"Itoh, T., Takei, Y., Tarui, J.: On Permutations with Limited Independence. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 137\u2013146 (2000)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Itoh, T., Takei, Y., Tarui, J.: On the Sample Size k-Restricted Min-Wise Independent Permutations and Other k-Wise Distributions. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing, pp. 710\u2013719 (2003)","DOI":"10.1145\/780542.780645"},{"key":"33_CR8","volume-title":"Handbook of Combinatorics","author":"R. Graham","year":"1995","unstructured":"Graham, R., Gr\u00f6tschel, M., Lov\u00e1sz, L.: Handbook of Combinatorics. North-Holland, Amsterdam (1995)"},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/BF01940875","volume":"16","author":"K. Mulmuley","year":"1996","unstructured":"Mulmuley, K.: Randomized Geometric Algorithms and Pseudorandom Generators. Algorithmica\u00a016, 450\u2013463 (1996)","journal-title":"Algorithmica"},{"key":"33_CR10","unstructured":"Matou\u0161ek, J., Stojakovi\u0107, M.: On Restricted Min-Wise Independence of Permutations (preprint) (2002), http:\/\/kam.mff.cuni.cz\/~matousek\/preprints.html\/"},{"key":"33_CR11","unstructured":"Norin, S.: A Polynomial Lower Bound for the Size of any k-Min-Wise Independent Set of Permutation. Zapiski Nauchnyh Seminarov POMI, 277,104\u2013116 (2001) (in Russian), http:\/\/www.pdmi.ras.ru\/znsl\/"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:05:20Z","timestamp":1559916320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}