{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T20:40:37Z","timestamp":1735418437617,"version":"3.32.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1007\/bf01300124","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T06:09:49Z","timestamp":1111730989000},"page":"1-18","source":"Crossref","is-referenced-by-count":15,"title":["Biased random walks"],"prefix":"10.1007","volume":"16","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei Z.","family":"Broder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna R.","family":"Karlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Linial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\ufffds, andE. Szemer\ufffddi: Deterministic Simulation in LOGSPACE,19th Annual ACM STOC, 1987, 132?140.","DOI":"10.1145\/28395.28410"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01303199","volume":"13","author":"M. Ajtai","year":"1993","unstructured":"M. Ajtai, andN. Linial: The influence of large coalitions,Combinatorica,13 (1993) 129?145.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0222030","volume":"22","author":"N. Alon","year":"1993","unstructured":"N. Alon, andM. Naor: Coin-flipping Games Immune Against Linear-sized Coalitions,SIAM J. Comput. 22 (1993), 403?417.","journal-title":"SIAM J. Comput."},{"key":"CR4","unstructured":"N. Alon, andM. O. Rabin: Biased Coins and Randomized Algorithms, inRandomness and Computation (S. Micali ed.) Advances in Computing Research, Vol. 5, 499?507."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Z. Broder, A. R. Karlin, N. Linial, andS. J. Phillips: Biased Random Walks, in24th Annual ACM STOC, 1992, 1?9.","DOI":"10.1145\/129712.129713"},{"key":"CR6","first-page":"91","volume-title":"Randomness and Computation","author":"M. Ben-Or","year":"1990","unstructured":"M. Ben-Or, andN. Linial: Collective coin flipping, inRandomness and Computation (S. Micali ed.) Academic Press, New York, 1990, 91?115."},{"key":"CR7","unstructured":"M. Ben-Or, N. Linial, andM. Saks: Collective coin flipping and other models of imperfect randomness, inColloq. Math. Soc. J\ufffdnos Bolyai no. 52, Combinatorics Eger, 1987, 75?112."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. Cohen, andA. Wigderson: Dispersers, Deterministic Amplification, and Weak Random Sources,30th Annual IEEE FOCS, 1989, 14?19.","DOI":"10.1109\/SFCS.1989.63449"},{"key":"CR9","volume-title":"Finite State Markov Decision Processes","author":"C. Derman","year":"1970","unstructured":"C. Derman:Finite State Markov Decision Processes, Academic Press, New York, 1970."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, andN. Linial: Fault-tolerant Computation in the Full Information Model,32nd Annual IEEE FOCS, 1991, 447?457.","DOI":"10.1109\/SFCS.1991.185405"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"E. J. Hinch:Perturbation methods, Cambridge University Press, 1991.","DOI":"10.1017\/CBO9781139172189"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, andD. Zuckerman: How to Recycle Random Bits,30th Annual IEEE FOCS, 1989, 248?253.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5700-4","volume-title":"Perturbation theory for linear operators","author":"T. Kato","year":"1982","unstructured":"T. Kato:Perturbation theory for linear operators, New York, Springer Verlag, 1982."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D. Lichtenstein","year":"1989","unstructured":"D. Lichtenstein, N. Linial, andM. Saks: Some extremal problems arising from discrete control processes,Combinatorica,9 (1989), 269?287.","journal-title":"Combinatorica"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"M. Metropolis","year":"1953","unstructured":"M. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, andM. Teller: Equation of state calculations by fast computing machines,Journal of Chemical Physics 21 (1953), 1087?1092.","journal-title":"Journal of Chemical Physics"},{"key":"CR16","volume-title":"Perturbation theory of eigenvalue problems","author":"F. Rellich","year":"1969","unstructured":"F. Rellich:Perturbation theory of eigenvalue problems, New York, Gordon and Breach, 1969."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M. Santha","year":"1986","unstructured":"M. Santha, andU. Vazirani: Generating Quasi-Random Sequences from Semirandom Sources,J. Comput. System Sci. 33 (1986), 75?87.","journal-title":"J. Comput. System Sci."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"U. Vazirani: Efficiency Considerations in Using Slightly-Random Sources,19th Annual ACM STOC, 1987, 160?168.","DOI":"10.1145\/28395.28413"},{"key":"CR19","volume-title":"Randomness, Adversaries and Computation","author":"U. Vazirani","year":"1986","unstructured":"U. Vazirani: Randomness, Adversaries and Computation, Ph.D. Thesis, University of California, Berkeley, 1986."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300124.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300124\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T20:21:25Z","timestamp":1735417285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01300124"],"URL":"https:\/\/doi.org\/10.1007\/bf01300124","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}