{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:33Z","timestamp":1781077713327,"version":"3.54.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0022-0000(92)90047-m","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"204-232","source":"Crossref","is-referenced-by-count":139,"title":["Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs"],"prefix":"10.1016","volume":"45","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noam","family":"Nisant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u00e1ri\u00f3","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90047-M_BIB1","series-title":"20th FOCS","first-page":"218","article-title":"Random walks, universal traversing sequences and the complexity of maze problems","author":"Aleliunas","year":"1979"},{"key":"10.1016\/0022-0000(92)90047-M_BIB2","series-title":"27th FOCS","first-page":"410","article-title":"Meanders, Ramsey theory and lower bounds for branching programs","author":"Alon","year":"1986"},{"key":"10.1016\/0022-0000(92)90047-M_BIB3","series-title":"15th STOC","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0022-0000(92)90047-M_BIB4","series-title":"26th FOCS","first-page":"11","article-title":"Deterministic simulation of probabilistic constant depth circuits]","author":"Ajtai","year":"1985"},{"key":"10.1016\/0022-0000(92)90047-M_BIB5","series-title":"Proceedings, 3rd IEEE Symposium on Structure in Complexity Theory","first-page":"116","article-title":"Two applications of complementation via inductive counting","author":"Borodin","year":"1988"},{"key":"10.1016\/0022-0000(92)90047-M_BIB6","series-title":"27th FOCS","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986"},{"key":"10.1016\/0022-0000(92)90047-M_BIB7","series-title":"23rd FOCS","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0022-0000(92)90047-M_BIB8","series-title":"15th STOC","first-page":"94","article-title":"Multiparty protocols","author":"Chandra","year":"1983"},{"key":"10.1016\/0022-0000(92)90047-M_BIB9","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1966.30","article-title":"The Recognition Problem for the Set of Perfect Squares","author":"Cobham","year":"1966"},{"key":"10.1016\/0022-0000(92)90047-M_BIB10","series-title":"26th FOCS","first-page":"429","article-title":"Unbiased bits from sources of weak randomness and probabilistic communication complexity","author":"Chor","year":"1985"},{"key":"10.1016\/0022-0000(92)90047-M_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01744430","article-title":"A time-space tradeoff for language recognition","volume":"17","author":"Duris","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(92)90047-M_BIB12","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0022-0000(92)90047-M_BIB13","unstructured":"V. Grolmusz, The BNS lower bound for multi-party protocols is nearly optimal, Inform. and Comput., to appear."},{"key":"10.1016\/0022-0000(92)90047-M_BIB14","series-title":"20th STOC","first-page":"281","article-title":"Nondeterministic linear time tasks may require substantially nonlinear deterministic time in the case of sublinear work space","author":"Gurevich","year":"1988"},{"key":"10.1016\/0022-0000(92)90047-M_BIB15","series-title":"31st FOCS","first-page":"610","article-title":"On the power of small depth threshold circuits","author":"H\u00e5stad","year":"1990"},{"key":"10.1016\/0022-0000(92)90047-M_BIB16","series-title":"21st STOC","first-page":"12","article-title":"Pseudorandom generation from one-way functions","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/0022-0000(92)90047-M_BIB17","series-title":"20th STOC","first-page":"491","article-title":"Polynomial universal traversing sequences for cycles are constructible","author":"Istrail","year":"1988"},{"key":"10.1016\/0022-0000(92)90047-M_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(86)90150-7","article-title":"Two time-space tradeoffs for element distinctness","volume":"47","author":"Karchmer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90047-M_BIB19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01048274","article-title":"On the cover time of random walks in graphs","volume":"2","author":"Kahn","year":"1989","journal-title":"J. Theoret. Probab."},{"key":"10.1016\/0022-0000(92)90047-M_BIB20","author":"Knuth","year":"1981"},{"key":"10.1016\/0022-0000(92)90047-M_BIB21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(88)90197-4","article-title":"Universal traversal sequences of length nO(logn) for cliques","volume":"28","author":"Karloff","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(92)90047-M_BIB22","unstructured":"M. Luby, B. Veli\u010dkovi\u0107, and A. Wigderson, Deterministic approximate counting for multivariate polynomials over GF[2], in preparation."},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90047-M_BIB23","first-page":"999","article-title":"A boolean function","volume":"7","author":"Ne\u010diporuk","year":"1966","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/0022-0000(92)90047-M_BIB24","series-title":"Proceedings, 5th IEEE Structure in Complexity Theory Conference Barcelona","first-page":"179","article-title":"On read-once vs. multiple access to randomness in Logspace","author":"Nisan","year":"1990"},{"key":"10.1016\/0022-0000(92)90047-M_BIB25","series-title":"22nd STOC","first-page":"204","article-title":"Pseudorandom generators for space-bounded computation","author":"Nisan","year":"1990"},{"key":"10.1016\/0022-0000(92)90047-M_BIB26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01375474","article-title":"Pseudorandom bits for constant depth circuits","volume":"11","author":"Nisan","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(92)90047-M_BIB27","series-title":"29th FOCS","first-page":"2","article-title":"Hardness vs. randomness","author":"Nisan","year":"1988"},{"key":"10.1016\/0022-0000(92)90047-M_BIB28","article-title":"Towards a Theory of Parallel Randomized Computation","author":"Reif","year":"1984"},{"key":"10.1016\/0022-0000(92)90047-M_BIB29","article-title":"Equations over Finite Fields, An Elementary Approach","volume":"Vol. 536","author":"Schmidt","year":"1976"},{"key":"10.1016\/0022-0000(92)90047-M_BIB30","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579325","article-title":"Strong communication complexity or generating quasi-random sequences from two communicating semirandom sources","volume":"7","author":"Vazirani","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(92)90047-M_BIB31","series-title":"11th STOC","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/0022-0000(92)90047-M_BIB32","series-title":"23rd FOCS","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"},{"key":"10.1016\/0022-0000(92)90047-M_BIB33","series-title":"24th FOCS","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1984"},{"key":"10.1016\/0022-0000(92)90047-M_BIB34","series-title":"31th FOCS","first-page":"619","article-title":"On ACC and threshold circuits","author":"Yao","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290047M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290047M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:23Z","timestamp":1550325443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290047M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002200009290047M"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90047-m","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}