{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T18:33:07Z","timestamp":1697221987880},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf01196134","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:51:37Z","timestamp":1108738297000},"page":"91-107","source":"Crossref","is-referenced-by-count":8,"title":["On construction ofk-wise independent random variables"],"prefix":"10.1007","volume":"17","author":[{"given":"Howard","family":"Karloff","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"N. Alon, L. Babai, andA. Itai: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem,Journal of Algorithms,7 (1986), 567?583.","journal-title":"Journal of Algorithms"},{"key":"CR2","unstructured":"N. Alon, andJ. Spencer:The Probabilistic Method, Wiley, 1992."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"B. Berger, andJ. Rompel: Simulating (log c n)-wise Independence in NC,Proc. 30 th IEEE Symposium on Foundations of Computer Science, 1989, 2?7.","DOI":"10.1109\/SFCS.1989.63447"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. H\ufffdstad, J. Friedman, S. Rudich, andR. Smolensky: The Bit Extraction Problem ort-Resilient Functions,Proc. 26 th IEEE Symposium on Foundations of Computer Science, 1985, 396?407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J. Friedman: On the Bit Extraction Problem,Proc. 33rd IEEE Symposium on Foundations of Computer Science, 1992, 314?319.","DOI":"10.1109\/SFCS.1992.267760"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1214\/aop\/1176996762","volume":"2","author":"A. Joffe","year":"1974","unstructured":"A. Joffe: On a Set of Almost Deterministick-Independent Random Variables,Annals of Probability,2 (1974), 161?162.","journal-title":"Annals of Probability"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"D. Koller, andN. Megiddo: Constructing Small Sample Spaces Satisfying Given Constraints,Proc. 25 th ACM Symposium on Theory of Computing, 1993, 268?277.","DOI":"10.1145\/167088.167168"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"M. Luby: A Simple Parallel Algorithm for the Maximal Independent Set Problem,SIAM Journal on Computing,15 (1986), 1036?1053.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"M. Luby: Removing Randomness in Parallel Computation Without a Processor Penalty,Proc. 29 th IEEE Symposium on Foundations of Computer Science, 1988, 162?173.","DOI":"10.1109\/SFCS.1988.21934"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"R. Motwani, J. Naor, andJ. Naor: The Probabilistic Method Yields Deterministic Parallel Algorithms,Proc. 30 th IEEE Symposium on Foundations of Computer Science, 1989, 8?13.","DOI":"10.1109\/SFCS.1989.63448"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"L. Schulman: Sample Spaces Uniform on Neighborhoods,Proc. 24 th ACM Symposium on Theory of Computing, 1992, 17?25.","DOI":"10.1145\/129712.129715"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196134.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01196134\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:09:11Z","timestamp":1586120951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01196134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF01196134"],"URL":"https:\/\/doi.org\/10.1007\/bf01196134","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}