iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/ISPAN.2000.900296
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:02:36Z","timestamp":1730275356676,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ispan.2000.900296","type":"proceedings-article","created":{"date-parts":[[2002,11,11]],"date-time":"2002-11-11T09:58:51Z","timestamp":1037008731000},"page":"274-281","source":"Crossref","is-referenced-by-count":1,"title":["Broadcasting multiple messages in hypercubes"],"prefix":"10.1109","author":[{"given":"A.L.","family":"Liestman","sequence":"first","affiliation":[]},{"given":"T.C.","family":"Shermer","sequence":"additional","affiliation":[]},{"given":"M.J.","family":"Suderman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Broadcasting in trees","year":"1995","author":"fraigniaud","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0139032"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)89163-9"},{"key":"ref5","first-page":"251","article-title":"Multiple-message broadcasting in complete graphs","author":"chinn","year":"1979","journal-title":"Proc 10th Southeastern Conf Comb Graph Theory and Computing"},{"journal-title":"6th Lakeview Conf on Computational Research and Materials","article-title":"Broadcasting multiple messages in grid graphs","year":"1996","author":"wojciechowska","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90194-5"},{"key":"ref2","first-page":"181","article-title":"Optimal multi-message broadcasting in complete graphs","volume":"18","author":"cockayne","year":"1980","journal-title":"Utilitas Mathematica"},{"journal-title":"J Combin Math Combin Comput","article-title":"Computation of broadcasting multiple messages in a positive weighted tree","year":"0","author":"averbuch","key":"ref1"}],"event":{"name":"International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000","acronym":"ISPAN-00","location":"Dallas, TX, USA"},"container-title":["Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7228\/19489\/00900296.pdf?arnumber=900296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T19:50:50Z","timestamp":1489175450000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/900296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":8,"URL":"http:\/\/dx.doi.org\/10.1109\/ispan.2000.900296","relation":{},"subject":[]}}