{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:29Z","timestamp":1742617109858,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_175","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:39:24Z","timestamp":1330209564000},"page":"697-706","source":"Crossref","is-referenced-by-count":0,"title":["On the power of multiple reads in a chip"],"prefix":"10.1007","author":[{"given":"Pavol","family":"\u010euri\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Galil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"55_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"P. \u010euri\u0161","year":"1987","unstructured":"P. \u010euri\u0161, Z. Galil and G. Schnitger, Lower bounds on communication complexity, Inf. and Comput. 73, 1987, pp. 1\u201322.","journal-title":"Inf. and Comput."},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"K. Karchmar and A. Wigderson, Monotone circuits for connectivity require superlogarithmic depth, in \u201cProc. 20th Ann. ACM Sympos. on Theory of Computing,\u201d May 1988, pp. 539\u2013550.","DOI":"10.1145\/62212.62265"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem and A. Zorat, Replication of inputs may save computational resources in VLSI, \u201cVLSI Systems and Computations\u201d (H.T. Kung, B. Sproull and G. Steele, Eds) Computer Sci. Rockville, Md. 1981.","DOI":"10.1007\/978-3-642-68402-9_7"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem and A. Zorat, On relations between input and communication\/computation in VLSI, in \u201cProc. 22nd Ann. IEEE Sympos. on Found. Comput. Sci.,\u201d October 1981, pp. 37\u201341.","DOI":"10.1109\/SFCS.1981.26"},{"key":"55_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0022-0000(84)90033-3","volume":"29","author":"J.E. Savage","year":"1984","unstructured":"J.E. Savage, Multilective VLSI algorithms, J. Comput. Sys. Sci. 29, 1984, pp. 243\u2013273.","journal-title":"J. Comput. Sys. Sci."},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"A.C.C. Yao, The entropic limitations on VLSI, in \u201cProc. 13th Ann. ACM Sympos. on Theory of Computing,\u201d May 1981, pp. 308\u2013311.","DOI":"10.1145\/800076.802483"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_175.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:15:55Z","timestamp":1742591755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_175","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}