{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:25:58Z","timestamp":1742991958265,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_19","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"206-217","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Vicari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0304-3975(78)90004-X","volume":"6","author":"H. Abelson","year":"1978","unstructured":"Abelson, H.: Towards a theory of local and global in computation. Theoret. Comput. Sci.\u00a06(1), 41\u201367 (1978)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1145\/322186.322200","volume":"27","author":"H. Abelson","year":"1980","unstructured":"Abelson, H.: Lower bounds on information transfer in distributed computations. J. Assoc. Comput. Mach.\u00a027(2), 384\u2013392 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05647-9","volume-title":"Algebra","author":"S. Bosch","year":"1999","unstructured":"Bosch, S.: Algebra, 3rd edn. Springer, Heidelberg (1999)","edition":"3"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. ACM Symp. on Theory of Computing (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"19_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Amin Shokrollahi, M.: Algebraic Complexity Theory. Springer, Heidelberg (1997)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0885-064X(92)90022-4","volume":"8","author":"P. B\u00fcrgisser","year":"1992","unstructured":"B\u00fcrgisser, P., Lickteig, T.: Test complexity of generic polynomials. J. Complexity\u00a08, 203\u2013215 (1992)","journal-title":"J. Complexity"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0304-3975(94)90260-7","volume":"125","author":"P. Chen","year":"1994","unstructured":"Chen, P.: The communication complexity of computing differentiable functions in a multicomputer network. Theoret. Comput. Sci.\u00a0125(2), 373\u2013383 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-36206-1_13","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for Multicast Cost Sharing. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 133\u2013144. Springer, Heidelberg (2002)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of a multicast transmission. J. Comput. Sys. Sci.\u00a063, 21\u201341 (2001)","journal-title":"J. Comput. Sys. Sci."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. 6th Int. Workshop on Discr. Alg. and Methods for Mobile Comput. and Communic., pp. 1\u201313 (2002)","DOI":"10.1145\/570810.570812"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Grigoriev, D.: Probabilistic communication complexity over the reals (preprint, 2007)","DOI":"10.1007\/s00037-008-0255-z"},{"key":"19_CR12","unstructured":"Hromkovic\u0306, J.: Communication Complexity and Parallel Computation. Springer, Heidelberg (1998)"},{"key":"19_CR13","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Lehmann, D., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: Proc. ACM Conference on Electronic Commerce (2003)","DOI":"10.1145\/585265.585266"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0885-064X(87)90013-6","volume":"3","author":"Z.-Q. Luo","year":"1987","unstructured":"Luo, Z.-Q., Tsitsiklis, J.N.: Communication complexity of convex optimization. J. Complexity\u00a03, 231\u2013243 (1987)","journal-title":"J. Complexity"},{"issue":"5","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1145\/174147.174149","volume":"40","author":"Z.-Q. Luo","year":"1993","unstructured":"Luo, Z.-Q., Tsitsiklis, J.N.: On the communication complexity of distributed algebraic computation. J. Assoc. Comput. Mach.\u00a040(5), 1019\u20131047 (1993)","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57908-0","volume-title":"Basic algebraic geometry 1 \u2013 Varieties in projective space","author":"I.R. Shafarevich","year":"1994","unstructured":"Shafarevich, I.R.: Basic algebraic geometry 1 \u2013 Varieties in projective space, 2nd edn. Springer, Heidelberg (1994)","edition":"2"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributed computing. In: Proc. of 11th ACM Symp. on Theory of Comput., pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:50:41Z","timestamp":1657561841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}