{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:52Z","timestamp":1742912392945,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029264"},{"type":"electronic","value":"9783642029271"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02927-1_33","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"390-402","source":"Crossref","is-referenced-by-count":2,"title":["Partition Arguments in Multiparty Communication Complexity"],"prefix":"10.1007","author":[{"given":"Jan","family":"Draisma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: STOC, pp. 370\u2013379 (2002)","DOI":"10.1145\/509907.509964"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci.\u00a058(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols and logspace-hard pseudorandom sequences. In: Proc. of the 21st ACM Symp. on the Theory of Computing, pp. 1\u201311 (1989)","DOI":"10.1145\/73007.73008"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z. Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci.\u00a068(4), 702\u2013732 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In: IEEE Conference on Computational Complexity, pp. 107\u2013117 (2003)","DOI":"10.1109\/CCC.2003.1214414"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A., Furst, M., Lipton, R.: Multiparty protocols. In: Proc. of the 15th ACM Symp. on the Theory of Computing, pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(96)00062-X","volume":"168","author":"M. Dietzfelbinger","year":"1996","unstructured":"Dietzfelbinger, M., Hromkovic, J., Schnitger, G.: A comparison of two lower-bound methods for communication complexity. Theor. Comput. Sci.\u00a0168(1), 39\u201351 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feder, T.: Multiparty communication complexity. In: Proc. of the 30th IEEE Symp. on Foundations of Computer Science, pp. 428\u2013433 (1989)","DOI":"10.1109\/SFCS.1989.63514"},{"issue":"5","key":"33_CR9","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/0221052","volume":"21","author":"D. Dolev","year":"1992","unstructured":"Dolev, D., Feder, T.: Determinism vs. nondeterminism in multiparty communication complexity. SIAM J. Comput.\u00a021(5), 889\u2013895 (1992)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.03.002","volume":"192","author":"P. Duris","year":"2004","unstructured":"Duris, P.: Multiparty communication complexity and very hard functions. Inf. Comput.\u00a0192(1), 1\u201314 (2004)","journal-title":"Inf. Comput."},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jcss.1997.1547","volume":"56","author":"P. Duris","year":"1998","unstructured":"Duris, P., Rolim, J.D.P.: Lower bounds on the multiparty communication complexity. J. Comput. Syst. Sci.\u00a056(1), 90\u201395 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/S0097539792235864","volume":"24","author":"T. Feder","year":"1995","unstructured":"Feder, T., Kushilevitz, E., Naor, M., Nisan, N.: Amortized communication complexity. SIAM J. Comput.\u00a024(4), 736\u2013750 (1995)","journal-title":"SIAM J. Comput."},{"key":"33_CR13","unstructured":"Gronemeier, A.: Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness. In: STACS 2009, pp. 505\u2013516 (2009)"},{"issue":"4","key":"33_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J. H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. J. Algorithms\u00a011(4), 644\u2013654 (1990)","journal-title":"J. Algorithms"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require super-logarithmic depth. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 539\u2013550 (1988)","DOI":"10.1145\/62212.62265"},{"key":"33_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Sedgewick, R.: Lower bounds for VLSI. In: Proc. of the 13rd ACM Symp. on the Theory of Computing, pp. 300\u2013307 (1981)","DOI":"10.1145\/800076.802482"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E.M.: Las vegas is better than determinism in VLSI and distributed computing. In: Proc. of the 14th ACM Symp. on the Theory of Computing, pp. 330\u2013337 (1982)","DOI":"10.1145\/800070.802208"},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Inf. Process. Lett.\u00a039(2), 67\u201371 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"33_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: On rank vs. communication complexity. Combinatorica\u00a015(4), 557\u2013565 (1995)","journal-title":"Combinatorica"},{"issue":"4","key":"33_CR21","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/BF01192528","volume":"15","author":"R. Raz","year":"1995","unstructured":"Raz, R., Spieker, B.: On the \u201clog rank\u201d-conjecture in communication complexity. Combinatorica\u00a015(4), 567\u2013588 (1995)","journal-title":"Combinatorica"},{"key":"33_CR22","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributed computing. In: Proc. of the 11th ACM Symp. on the Theory of Computing, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:53:11Z","timestamp":1558407191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}