{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:42Z","timestamp":1766281002868},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":[[1989,9]]},"DOI":"10.1007\/bf02125896","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T15:39:55Z","timestamp":1126712395000},"page":"269-287","source":"Crossref","is-referenced-by-count":36,"title":["Some extremal problems arising from discrete control processes"],"prefix":"10.1007","volume":"9","author":[{"given":"D.","family":"Lichtenstein","sequence":"first","affiliation":[]},{"given":"N.","family":"Linial","sequence":"additional","affiliation":[]},{"given":"M.","family":"Saks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02125896_CR1","unstructured":"N.Alon and M. O.Rabin, On the random properties of a weakly random source, in Advances in Computing Research (Silvio Micali, ed.),to appear."},{"key":"BF02125896_CR2","doi-asserted-by":"crossref","unstructured":"M.Ben-Or and N.Linial, Collective Coin Flipping, robust voting schemes and minimal of Banzhaf values,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, 408\u2013416.","DOI":"10.1109\/SFCS.1985.15"},{"key":"BF02125896_CR3","unstructured":"M.Ben-Or, N.Linial and M.Saks, Collective collective coin flipping and other models of imperfect randomness, Proceedings of edi."},{"key":"BF02125896_CR4","doi-asserted-by":"crossref","unstructured":"B.Chor and O.Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, 429\u2013442.","DOI":"10.1109\/SFCS.1985.62"},{"key":"BF02125896_CR5","doi-asserted-by":"crossref","unstructured":"B.Chor, O.Goldreich, J.Hastad, J.Friedmann, S.Rudich and R.Smolensky, The bit extraction problem ort-resilient functions,Proc. 26th IEEE Symposium on Foundations of Computer Science (1985), 396\u2013407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"BF02125896_CR6","doi-asserted-by":"crossref","unstructured":"D. E.Daykin, Ordered ranked posets, representations of integers and inequalities from extremal ranked posets,in Graphs and Order (I. Rival, ed.). D. Reidel Publishing, 1985, 395\u2013412.","DOI":"10.1007\/978-94-009-5315-4_10"},{"key":"BF02125896_CR7","unstructured":"C.Greene and D. J.Kleitman, Proof techniques in the theory of finite sets,in Studies in Combinatorics (G.-C. Rota, ed.), MAA Studies in Mathematics,17 (1978), 22\u201379."},{"key":"BF02125896_CR8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. Harper","year":"1966","unstructured":"L. Harper, Optimal numberings and isoperimetric problems on graphs,J. Comb. Th.,1 (1966), 385\u2013393.","journal-title":"J. Comb. Th."},{"key":"BF02125896_CR9","first-page":"187","volume-title":"Theory of Graphs","author":"G. Katona","year":"1966","unstructured":"G. Katona, A theorem for finite sets, inTheory of Graphs (P. Erd\u0150s and G. Katona, eds.), Hungarian Academy of Science, Budapest, 1966, 187\u2013207."},{"key":"BF02125896_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"Mathematical Optimization Techniques","author":"J. B. Kruskal","year":"1963","unstructured":"J. B. Kruskal, The number of simplices in a complex, inMathematical Optimization Techniques (R. Bellman, ed.), University of California Press, Berkeley, 1963, 251\u2013278."},{"key":"BF02125896_CR11","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. V. Vazirani, Generating quasi random sequences from slightly random sources,J. Comp. Sys. Sci.,33 (1986), 75\u201387.","journal-title":"J. Comp. Sys. Sci."},{"key":"BF02125896_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579325","volume":"7","author":"U. V. Vazirani","year":"1987","unstructured":"U. V. Vazirani, Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources,Combinatorica,7 (1987), 375\u2013392.","journal-title":"Combinatorica"},{"key":"BF02125896_CR13","unstructured":"U. V.Vazirani, Randomness, Adversaries and Computation,Ph. D. dissertation, U. C. Berkeley, 1986."},{"key":"BF02125896_CR14","doi-asserted-by":"crossref","unstructured":"U. V.Vazirani and V. V.Vazirani, Random polynomial time is equal to semi-random polynomial time,Proc. 26th IEEE Symp. on Foundations of Computer Science (1985), 417\u2013428.","DOI":"10.1109\/SFCS.1985.45"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125896.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02125896\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T13:01:18Z","timestamp":1626526878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02125896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF02125896"],"URL":"https:\/\/doi.org\/10.1007\/bf02125896","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}