{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:08:04Z","timestamp":1742994484520,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723393"},{"type":"electronic","value":"9789819723409"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-2340-9_12","type":"book-chapter","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:01:51Z","timestamp":1714690911000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Source-Oblivious Broadcast"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<183::AID-NET3>3.0.CO;2-E","volume":"27","author":"K Diks","year":"1996","unstructured":"Diks, K., Pelc, A.: Broadcasting with universal lists. Networks 27(3), 183\u2013196 (1996)","journal-title":"Networks"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","volume":"25","author":"AM Farley","year":"1979","unstructured":"Farley, A.M., Hedetniemi, S.T., Mitchell, S.M., Proskurowski, A.: Minimum broadcast graphs. Discret. Math. 25(2), 189\u2013193 (1979)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"12_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discret. Appl. Math. 53(1\u20133), 79\u2013133 (1994)","journal-title":"Discret. Appl. Math."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Gholami, M.S., Harutyunyan, H.A.: Broadcast graphs with nodes of limited memory. In: 13th International Conference on Complex Networks (CompleNet), pp. 29\u201342 (2022)","DOI":"10.1007\/978-3-031-17658-6_3"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Gholami, M.S., Harutyunyan, H.A.: Fully-adaptive model for broadcasting with universal lists. In: 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 92\u201399 (2022)","DOI":"10.1109\/SYNASC57785.2022.00024"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M Grigni","year":"1991","unstructured":"Grigni, M., Peleg, D.: Tight bounds on minimum broadcast networks. SIAM J. Discret. Math. 4(2), 207\u2013222 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/net.20396","volume":"57","author":"HA Harutyunyan","year":"2011","unstructured":"Harutyunyan, H.A., Liestman, A.L., Makino, K., Shermer, T.C.: Nonadaptive broadcasting in trees. Networks 57(2), 157\u2013168 (2011)","journal-title":"Networks"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319\u2013349 (1988)","journal-title":"Networks"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b137871","DOI":"10.1007\/b137871"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/net.20068","volume":"45","author":"J Kim","year":"2005","unstructured":"Kim, J., Chwa, K.: Optimal broadcasting with universal lists based on competitive analysis. Networks 45(4), 224\u2013231 (2005)","journal-title":"Networks"},{"key":"12_CR11","unstructured":"Rosenthal, A., Scheuermann, P.: Universal rankings for broadcasting in tree networks. In: 25th Allerton Conference on Communication, Control and Computing, pp. 641\u2013649 (1987)"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692\u2013701 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2340-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:02:57Z","timestamp":1714690977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2340-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723393","9789819723409"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2340-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tamc2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}