{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:24Z","timestamp":1742600424184,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:05:08Z","timestamp":1330290308000},"page":"631-642","source":"Crossref","is-referenced-by-count":5,"title":["Upper bounds on multiparty communication complexity of shifts"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"51_CR1","unstructured":"J. Edmonds and R. Impagliazzo, Towards time-space lower bounds on branching programs, manuscript"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"A. Chandra, M. Furst and R. Lipton, Multiparty protocols, Proceedings of 15-th ACM STOC, 1983, pp.94\u201399","DOI":"10.1145\/800061.808737"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad and M. Goldmann, On the power of small depth threshold circuits, Proceedings of 31-th FOCS, 1990, pp. 610\u2013618","DOI":"10.1109\/FSCS.1990.89582"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"N. Nisan, A. Wigderson, Rounds in communication complexity revisited, Proceedings of 23-th ACM STOC, 1991, pp. 419\u2013429","DOI":"10.1145\/103418.103463"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"P. Pudlak, Unexpected upper bounds on the complexity of some communication games, Proceedings of ICALP'94, Lecture Notes in Computer Science, pp.1\u201311.","DOI":"10.1007\/3-540-58201-0_53"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"P. Pudlak, V. R\u00f6dl, Modified ranks of tensors and the size of circuits, Proceedings of 25-th ACM STOC, 1993, pp. 523\u2013531. (preliminary version of [7])","DOI":"10.1145\/167088.167228"},{"key":"51_CR7","unstructured":"P. Pudlak, V. R\u00f6dl, J. Sgall, Boolean circuits, ranks of tensors and communication complexity, submitted."},{"key":"51_CR8","unstructured":"P. Pudlak, J. Sgall, An upper bound for a communication game related to space-time tradeoffs, preprint."},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao, Some complexity questions related to distributive computing, Proceedings of 11-th ACM STOC, 1979, pp.209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"51_CR10","unstructured":"Andrew C. Yao, On ACC and threshold circuits, Proceedings of 31-th FOCS, 1990, pp. 619\u2013627."}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:11:01Z","timestamp":1742598661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}