{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:49:58Z","timestamp":1761292198548},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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":9451,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0885-064x(87)90013-6","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"231-243","source":"Crossref","is-referenced-by-count":28,"title":["Communication complexity of convex optimization"],"prefix":"10.1016","volume":"3","author":[{"given":"John N","family":"Tsitsiklis","sequence":"first","affiliation":[]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0885-064X(87)90013-6_BIB1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","article-title":"Lower bounds on information transfer in distributed computations","volume":"27","author":"Abelson","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(87)90013-6_BIB2","series-title":"Proceedings, 15th STOC","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0885-064X(87)90013-6_BIB3","doi-asserted-by":"crossref","DOI":"10.21236\/ADA156049","article-title":"Communication Complexity of Distributed Shortest Path Algorithms","author":"Awerbuch","year":"1985"},{"key":"10.1016\/0885-064X(87)90013-6_BIB4","series-title":"Proceedings, 14th STOC","first-page":"330","article-title":"Las Vegas is better than Determinism in VLSI and distributed computing","author":"Mehlhorn","year":"1982"},{"key":"10.1016\/0885-064X(87)90013-6_BIB5","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"issue":"No. 4","key":"10.1016\/0885-064X(87)90013-6_BIB6","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1137\/0215065","article-title":"Communication complexity of computing the Hamming distance","volume":"15","author":"Pang","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(87)90013-6_BIB7","series-title":"Proceedings, 14th STOC","first-page":"196","article-title":"Communication complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0885-064X(87)90013-6_BIB8","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"issue":"No. 3","key":"10.1016\/0885-064X(87)90013-6_BIB9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0019-9958(82)91034-8","article-title":"On the complexity of designing distributed protocols","volume":"53","author":"Papadimitriou","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(87)90013-6_BIB10","series-title":"A General Theory ofOptimal Algorithms","author":"Traub","year":"1980"},{"key":"10.1016\/0885-064X(87)90013-6_BIB11","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/0885-064X(87)90013-6_BIB12","series-title":"Proceedings, 11th STOC","first-page":"209","article-title":"Some complexity questions related to distributed computing","author":"Yao","year":"1979"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900136?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900136?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:15Z","timestamp":1549099395000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X87900136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0885064X87900136"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(87)90013-6","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}