{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:30:10Z","timestamp":1768926610706,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":[[1986,6]]},"DOI":"10.1007\/bf02579167","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:15:33Z","timestamp":1174598133000},"page":"97-108","source":"Crossref","is-referenced-by-count":95,"title":["Independent unbiased coin flips from a correlated biased source\u2014A finite state markov chain"],"prefix":"10.1007","volume":"6","author":[{"given":"Manuel","family":"Blum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579167_CR1","doi-asserted-by":"crossref","unstructured":"Josh D. Cohen, Fairing of biased Coins in Bounded Time,Yale Computer Science Technical Report 372 (1985).","DOI":"10.1109\/SFCS.1985.2"},{"key":"BF02579167_CR2","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"Peter Elias","year":"1972","unstructured":"Peter Elias, The Efficient Construction of an Unbiased Random Sequence, Ann. Math. Statist.43 (1972), 865\u2013870.","journal-title":"Ann. Math. Statist."},{"key":"BF02579167_CR3","doi-asserted-by":"crossref","unstructured":"Benny Chor andOded Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity,Proc. 26 th IEEE FOCS (1985), 429\u2013442.","DOI":"10.1109\/SFCS.1985.62"},{"key":"BF02579167_CR4","volume-title":"Information Theory and Reliable Communication","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager,Information Theory and Reliable Communication, Wiley, New York (1968)."},{"key":"BF02579167_CR5","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s S\u00e1ntha andUmesh V. Vazirani, Generating Quasi-Random Sequences from Slightly-Random Sources,Proc. 25 th IEEE FOCS (1985), 434\u2013440. The following paper has a comprehensive bibliography:","DOI":"10.1109\/SFCS.1984.715945"},{"key":"BF02579167_CR6","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1214\/aop\/1176993384","volume":"12","author":"Quentin F. Stout","year":"1984","unstructured":"Quentin F. Stout andBette Warren, Tree Algorithms for Unbiased Coin Tossing with a Baised Coin,Ann Prob. 12 (1984), 212\u2013222.","journal-title":"Ann Prob."},{"key":"BF02579167_CR7","doi-asserted-by":"crossref","unstructured":"Umesh V. Vazirani, Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-Random Sources,Proc. 17 th ACM STOC (1985), 366\u2013378.","DOI":"10.1145\/22145.22186"},{"key":"BF02579167_CR8","first-page":"36","volume":"12","author":"John Neumann Von","year":"1951","unstructured":"John Von Neumann, Various Techniques Used in Connection with Random Digits, Notes by G. E. Forsythe, National Bureau of Standards,Applied Math Series, Vol.12 (1951), 36\u201338.Reprinted in: von Neumann\u2019s Collected Works, Vol.5, Pergamon Press (1963), 768\u2013770.","journal-title":"Applied Math Series"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579167\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T05:05:40Z","timestamp":1736917540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF02579167"],"URL":"https:\/\/doi.org\/10.1007\/bf02579167","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}