{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:12:30Z","timestamp":1768029150451,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0304-3975(90)90188-n","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"3-28","source":"Crossref","is-referenced-by-count":129,"title":["Communication complexity of PRAMs"],"prefix":"10.1016","volume":"71","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashok K.","family":"Chandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90188-N_BIB1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","article-title":"Lowerbounds on information transfer in distributed systems","volume":"27","author":"Abelson","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90188-N_BIB2","first-page":"11","article-title":"On communication latency in PRAM computations","author":"Aggarwal","year":"1989","journal-title":"Proc. ACM Symp. on Parallel Algorithms and Architectures"},{"key":"10.1016\/0304-3975(90)90188-N_BIB3","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(90)90188-N_BIB4","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90188-N_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90188-N_BIB6","first-page":"133","article-title":"Lower bounds on communication complexity","author":"Duris","year":"1983","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"issue":"1","key":"10.1016\/0304-3975(90)90188-N_BIB7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1177\/109434208800200103","article-title":"Impact of hierarchical memory systems on linear algebra algorithm design","volume":"2","author":"Gallivan","year":"1988","journal-title":"Internat. J. Supercomputer Appl."},{"key":"10.1016\/0304-3975(90)90188-N_BIB8","first-page":"326","article-title":"I\/O complexity: the red-blue pebble game","author":"Hong","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90188-N_BIB9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/2422.322421","article-title":"Information transfer in distributed computing with applications to VLSI","volume":"31","author":"Ja'Ja'","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90188-N_BIB10","first-page":"160","article-title":"Parallel hashing\u2014an efficient implementation of shared memory","author":"Karlin","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90188-N_BIB11","series-title":"Ph.D. Thesis","article-title":"The effect of algebraic structure on the computational complexity of matrix multiplications","author":"Kert","year":"1970"},{"key":"10.1016\/0304-3975(90)90188-N_BIB12","first-page":"333","article-title":"A complexity theory of efficient parallel algorithms","author":"Kruskal","year":"1988","journal-title":"Proc. 15th Internat. Coll. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(90)90188-N_BIB13","first-page":"967","article-title":"Parallel supercomputing today and the Cedar approach","volume":"231","author":"Kuck","year":"1986","journal-title":"Science Magazine"},{"key":"10.1016\/0304-3975(90)90188-N_BIB14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/17356.17362","article-title":"Memory requirements for balanced computer architectures","author":"Kung","year":"1986","journal-title":"Proc. 13th Ann. Symp. on Computer Architectures"},{"issue":"2","key":"10.1016\/0304-3975(90)90188-N_BIB15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TSE.1981.230833","article-title":"Communication issues in the design and analysis of parallel algorithms","volume":"7","author":"Lint","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0304-3975(90)90188-N_BIB16","first-page":"260","article-title":"Communication complexity","volume":"28","author":"Papadimitriou","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90188-N_BIB17","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0216044","article-title":"A communication-time trade-off","volume":"16","author":"Papadimitriou","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90188-N_BIB18","first-page":"510","article-title":"Towards an architecture-independent analysis of parallel algorithms","author":"Papadimitriou","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90188-N_BIB19","first-page":"764","article-title":"The IBM Research Parallel Prototype (RP3): introduction and architecture","author":"Pfister","year":"1985","journal-title":"Proc. 1985 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(90)90188-N_BIB20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/SFCS.1987.32","article-title":"How to emulate shared memory","author":"Ranade","year":"1987","journal-title":"Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90188-N_BIB21","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"},{"issue":"4","key":"10.1016\/0304-3975(90)90188-N_BIB22","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/31846.32978","article-title":"Lower bounds on communication complexity in distributed computer networks","volume":"34","author":"Tiwari","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90188-N_BIB23","first-page":"171","article-title":"How to share memory in a distributed system","author":"Upfal","year":"1984","journal-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science"},{"issue":"5","key":"10.1016\/0304-3975(90)90188-N_BIB24","first-page":"324","article-title":"The universality of the shuffle-exchange network","volume":"30","author":"Wu","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90188-N_BIB25","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090188N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090188N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:20:47Z","timestamp":1555194047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090188N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["030439759090188N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90188-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}