乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T20:34:38Z","timestamp":1719088478931},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0166-218x(03)00257-9","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:32:50Z","timestamp":1063737170000},"page":"127-153","source":"Crossref","is-referenced-by-count":10,"title":["Gossiping and broadcasting versus computing functions in networks"],"prefix":"10.1016","volume":"137","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00257-9_BIB1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539790192672","article-title":"Parallel information dissemination by packets","volume":"23","author":"Bagchi","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1142\/S0129626493000046","article-title":"An optimal algorithm for computing census functions in message-passing systems","volume":"3","author":"Bar-Noy","year":"1993","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1142\/S012962649400017X","article-title":"Information broadcasting by exclusive\u2013read PRAMs","volume":"1 & 2","author":"Beame","year":"1994","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB4","series-title":"Untere Schranken f\u00fcr die Berechnung von Booleschen Funktionen in vollst\u00e4ndigen Prozessornetzwerken im Telefon- und Telegraf-Modus","author":"Belting","year":"1994"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1142\/S012962649300037X","article-title":"Efficient global combine operations in multi-port message-passing systems","volume":"3","author":"Bruck","year":"1993","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(86)90083-6","article-title":"Properties of complexity measures for PRAMs and WRAMs","volume":"48","author":"Bublitz","year":"1986","journal-title":"Theoret. Comput. Science"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB8","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/S0022-0000(05)80003-0","article-title":"Exact lower bounds for computing Boolean functions on CREW PRAMs","volume":"48","author":"Dietzfelbinger","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB9","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S0097539791224285","article-title":"Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines","volume":"25","author":"Dietzfelbinger","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB10","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide, Simple, efficient shared memory simulations, in: Proceedings of the Fifth ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, 1993, pp. 110\u2013118.","DOI":"10.1145\/165231.165246"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB11","doi-asserted-by":"crossref","unstructured":"S. Even, B. Monien, On the number of rounds necessary to disseminate information, in: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, New Mexico, USA, 1989, pp. 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB12","series-title":"Synthesis of Parallel Computation","first-page":"843","article-title":"The complexity of computation on the parallel random access machine","author":"Fich","year":"1994"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB14","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S0097539793259483","article-title":"Doubly logarithmic communication algorithms for optical-communication parallel computers","volume":"26","author":"Goldberg","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB15","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1137\/S0097539795290507","article-title":"An optical simulation of shared memory","volume":"28","author":"Goldberg","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB17","series-title":"Broadcast und Gossip in parallelen Netzwerken","author":"H\u00f6ltring","year":"1994"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB18","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01908630","article-title":"Optimal algorithms for dissemination of information in some interconnection networks","volume":"10","author":"Hromkovi\u010d","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB19","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting & gossiping)","author":"Hromkovi\u010d","year":"1996"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB20","doi-asserted-by":"crossref","unstructured":"R.M. Karp, V. Ramachandran, Parallel algorithms for shared-memory machines, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 869\u2013941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(94)90184-8","article-title":"Broadcasting in butterfly and deBruijn networks","volume":"53","author":"Klasing","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB23","series-title":"Topics in Combinatorics and Graph Theory","first-page":"451","article-title":"Quick gossiping by multi-telegraphs","author":"Labahn","year":"1990"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB24","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0304-3975(97)00199-0","article-title":"ERCW PRAMs and optical communication","volume":"196","author":"MacKenzie","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(96)00032-1","article-title":"Exploiting storage redundancy to speed up randomized shared memory simulations","volume":"162","author":"Meyer auf der Heide","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB26","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","article-title":"CREW PRAMs and decision trees","volume":"20","author":"Nisan","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","article-title":"Generalizations of broadcasting and gossiping","volume":"18","author":"Richards","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","article-title":"Fast information sharing in a complete network","volume":"42","author":"Sunderam","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00257-9_BIB29","article-title":"Topics in distributed algorithms","volume":"Vol. 1","author":"Tel","year":"1991"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB30","series-title":"Introduction to Distributed Algorithms","author":"Tel","year":"1994"},{"key":"10.1016\/S0166-218X(03)00257-9_BIB31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","article-title":"Trade-offs between depth and width in parallel computation","volume":"14","author":"Vishkin","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002579?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:59:55Z","timestamp":1550980795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03002579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0166218X03002579"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00257-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}