{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:43:17Z","timestamp":1648680197385},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0890-5401(90)90002-y","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"1-17","source":"Crossref","is-referenced-by-count":1,"title":["Rounds versus time for the two person pebble game"],"prefix":"10.1016","volume":"88","author":[{"given":"Bala","family":"Kalyanasundaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90002-Y_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0022-0000(85)90011-X","article-title":"Speedups of deterministic machines by synchronous parallel machines","volume":"30","author":"Dymond","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0898-1221(75)90037-1","article-title":"On sparse graphs with dense long paths","volume":"1","author":"Erd\u00f6s","year":"1975","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","article-title":"On time versus space","volume":"24","author":"Hopcroft","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB4","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1145\/322344.322354","article-title":"Asymptotically tight bounds on time-space trade-offs in a pebble game","volume":"29","author":"Lengauer","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0304-3975(76)90090-6","article-title":"Circuit size is nonlinear in depth","volume":"2","author":"Paterson","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB6","series-title":"Proceedings, 24th IEEE Symposium on Foundations of Computer Science","first-page":"429","article-title":"On determinism versus non-determinism and related problems","author":"Paul","year":"1983"},{"key":"10.1016\/0890-5401(90)90002-Y_BIB7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01683275","article-title":"Space bounds for a game on graphs","volume":"10","author":"Paul","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90002-Y_BIB8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0206022","article-title":"Superconcentrators","volume":"6","author":"Pippenger","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","article-title":"A universal prio to integers and estimation by minimum description length","volume":"11","author":"Rissanen","year":"1983","journal-title":"Ann. Statist."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90002-Y_BIB11","series-title":"24th IEEE Symposium on Foundations of Computer Science","first-page":"323","article-title":"On depth reduction and grates","author":"Schnitger","year":"1983"},{"key":"10.1016\/0890-5401(90)90002-Y_BIB12","series-title":"A pebble game that models alternation","author":"Tompa","year":"1980"},{"key":"10.1016\/0890-5401(90)90002-Y_BIB13","series-title":"Proceedings, Symposium on Mathematical Foundations of Computer Science","first-page":"101","article-title":"Graph-theoretic arguments in low-level complexity","volume":"Vol. 67","author":"Valiant","year":"1979"},{"key":"10.1016\/0890-5401(90)90002-Y_BIB14","series-title":"Proceedings, 7th ACM Symposium on Theory of Computing","first-page":"45","article-title":"On nonlinear lower bounds in computational complexity","author":"Valiant","year":"1975"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090002Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090002Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:54Z","timestamp":1548879954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090002Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["089054019090002Y"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90002-y","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}