{"id":"https://openalex.org/W1502190774","doi":"https://doi.org/10.1007/3-540-40996-3_32","title":"Deterministic Broadcasting Time with Partial Knowledge of the Network","display_name":"Deterministic Broadcasting Time with Partial Knowledge of the Network","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1502190774","doi":"https://doi.org/10.1007/3-540-40996-3_32","mag":"1502190774"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-40996-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-40996-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://puma.isti.cnr.it/dfdownloadnew.php?ident=cnr.iit/cnr.iit/2003-A0-028","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087104329","display_name":"Gianluca De Marco","orcid":"https://orcid.org/0000-0002-1204-0646"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gianluca De Marco","raw_affiliation_strings":["Dipartimento di Informatica e Applicazioni, Universit\u00e1 di Salerno, 84081, Baronissi (SA), Italy","Universit\u00e1 di Salerno"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Applicazioni, Universit\u00e1 di Salerno, 84081, Baronissi (SA), Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Universit\u00e1 di Salerno","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102714160","display_name":"Andrzej Pelc","orcid":"https://orcid.org/0000-0003-0598-1218"},"institutions":[{"id":"https://openalex.org/I191240316","display_name":"University of Hull","ror":"https://ror.org/04nkhwh30","country_code":"GB","type":"education","lineage":["https://openalex.org/I191240316"]},{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA","GB"],"is_corresponding":false,"raw_author_name":"Andrzej Pelc","raw_affiliation_strings":["D\u00e9partement d\u2019Informatique, Universit\u00e1 du Qu\u00e9bec \u00e1 Hull, J8X 3X7, Qu\u00e9bec, Hull, Canada","D\u00e9partement d'Informatique, Universit\u00e9 du Qu\u00e9bec \u00e0 Hull, C.P. 1250, Succ. B, Hull, Qu\u00e9., Canada J8X 3X7"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019Informatique, Universit\u00e1 du Qu\u00e9bec \u00e1 Hull, J8X 3X7, Qu\u00e9bec, Hull, Canada","institution_ids":["https://openalex.org/I33217400","https://openalex.org/I191240316"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique, Universit\u00e9 du Qu\u00e9bec \u00e0 Hull, C.P. 1250, Succ. B, Hull, Qu\u00e9., Canada J8X 3X7","institution_ids":["https://openalex.org/I33217400"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087104329"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.08574939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"374","last_page":"385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.8521369099617004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7967482805252075},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6521362662315369},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.620498776435852},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5453634858131409},{"id":"https://openalex.org/keywords/point-to-point","display_name":"Point-to-point","score":0.5092455148696899},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4713413417339325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4656636714935303},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44828641414642334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42254164814949036},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4078490138053894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3227244019508362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18750593066215515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16614052653312683},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07477384805679321}],"concepts":[{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.8521369099617004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7967482805252075},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6521362662315369},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.620498776435852},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5453634858131409},{"id":"https://openalex.org/C174440990","wikidata":"https://www.wikidata.org/wiki/Q681349","display_name":"Point-to-point","level":2,"score":0.5092455148696899},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4713413417339325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4656636714935303},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44828641414642334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42254164814949036},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4078490138053894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3227244019508362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18750593066215515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16614052653312683},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07477384805679321},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-40996-3_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-40996-3_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pumaoai.isti.cnr.it:cnr.iit/cnr.iit/2003-A0-028","is_oa":true,"landing_page_url":"http://puma.isti.cnr.it/dfdownloadnew.php?ident=cnr.iit/cnr.iit/2003-A0-028","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: THEORETICAL COMPUTER SCIENCE (03116J0), vol. 290 pp. 2009 - 2020. Elsevier, 2003.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pumaoai.isti.cnr.it:cnr.iit/cnr.iit/2003-A0-028","is_oa":true,"landing_page_url":"http://puma.isti.cnr.it/dfdownloadnew.php?ident=cnr.iit/cnr.iit/2003-A0-028","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: THEORETICAL COMPUTER SCIENCE (03116J0), vol. 290 pp. 2009 - 2020. Elsevier, 2003.","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1495549954","https://openalex.org/W1596090737","https://openalex.org/W1817978457","https://openalex.org/W1966788533","https://openalex.org/W1967162979","https://openalex.org/W1972566871","https://openalex.org/W1976485065","https://openalex.org/W1990389251","https://openalex.org/W1995822603","https://openalex.org/W2015356474","https://openalex.org/W2017716370","https://openalex.org/W2043433566","https://openalex.org/W2047784567","https://openalex.org/W2054910423","https://openalex.org/W2058322021","https://openalex.org/W2068889991","https://openalex.org/W2080750094","https://openalex.org/W2080763277","https://openalex.org/W2098243917","https://openalex.org/W4298949291"],"related_works":["https://openalex.org/W2086397253","https://openalex.org/W2133122801","https://openalex.org/W600422426","https://openalex.org/W2007156430","https://openalex.org/W2170882281","https://openalex.org/W3081478936","https://openalex.org/W2785612136","https://openalex.org/W2241733113","https://openalex.org/W4297790793","https://openalex.org/W2393435941"],"abstract_inverted_index":{"We":[0,87,163,228,238,295],"consider":[1],"the":[2,22,25,36,56,61,64,72,75,89,95,130,138,160,202,207,278,284,287,292],"time":[3,170,196,270,318,356,371],"of":[4,14,24,60,67,71,116,140,171,185,204,280,286],"deterministic":[5,172],"broadcasting":[6,195,209,231,244,266,329,367],"in":[7,98,100,113,119,157,206,269,317,355,370],"networks":[8],"whose":[9],"nodes":[10,41,117,181],"have":[11],"limited":[12],"knowledge":[13,28,167,175,191,217,223,257,260,309,343,346,361],"network":[15,26,62],"topology.":[16],"Each":[17],"node":[18,53,70,104],"v":[19],"knows":[20,35,54],"only":[21,55,125,133,183],"part":[23],"within":[27],"radius":[29,168,176,192,261,310,347,362],"r":[30,46],"from":[31,47,50],"it,":[32],"i.e.,":[33,179],"it":[34],"graph":[37],"induced":[38],"by":[39],"all":[40,84,141],"at":[42,44,108,158],"distance":[43],"most":[45,109,159],"v.":[48],"Apart":[49],"that,":[51],"each":[52,103,114],"maximum":[57,293,300],"degree":[58,301],"\u0394":[59,290,302],"and":[63,112,147,169,226,233,289,322],"number":[65,203,279],"n":[66,276],"nodes.":[68,86],"One":[69],"network,":[73,208,288],"called":[74,94],"source,":[76],"has":[77,81],"a":[78,120,127,255,265,324,366],"message":[79,128],"which":[80],"to":[82,252,315,353],"reach":[83],"other":[85,131,153],"adopt":[88],"widely":[90],"studied":[91],"communication":[92],"model":[93,97],"one-way":[96],"which,":[99],"every":[101],"round,":[102,122],"can":[105,124,132,210],"communicate":[106],"with":[107],"one":[110,123],"neighbor,":[111],"pair":[115],"communicating":[118],"given":[121,256],"send":[126],"while":[129],"receive":[134],"it.":[135],"This":[136,335],"is":[137,177,197,201,277,283,291,305,338],"weakest":[139],"store-and-forward":[142],"models":[143,154],"for":[144,152,190,215,254,298,340,359],"point-to-point":[145],"networks,":[146],"hence":[148],"our":[149,248],"algorithms":[150,232,249],"work":[151],"as":[155],"well":[156],"same":[161],"time.":[162,237],"show":[164,296,313,351,365],"tradeoffs":[165],"between":[166],"broadcasting,":[173],"when":[174,180,331],"small,":[178],"are":[182,250],"aware":[184],"their":[186,235],"close":[187,251],"vicinity.":[188],"While":[189],"0,":[193],"minimum":[194],"\u03b8(e),":[198],"where":[199,275],"e":[200],"edges":[205],"be":[211],"usually":[212],"completed":[213],"faster":[214],"positive":[216],"radius.":[218,258,344],"Our":[219],"main":[220],"results":[221],"concern":[222],"radii":[224],"1":[225,262],"2.":[227],"develop":[229,264],"fast":[230],"analyze":[234],"execution":[236],"also":[239],"prove":[240,323],"lower":[241,325,336],"bounds":[242],"on":[243,328],"time,":[245,330],"showing":[246],"that":[247,297],"optimal,":[253],"For":[259,308,345],"we":[263,312,350,364],"algorithm":[267,304,368],"working":[268,369],"O(min(n,":[271],"D":[272,282],"2":[273,311,373],"\u0394)),":[274],"nodes,":[281],"diameter":[285],"degree.":[294],"bounded":[299],"this":[303],"asymptotically":[306],"optimal.":[307],"how":[314,352],"broadcast":[316,354],"O(D\u0394":[319],"log":[320],"n))":[321],"bound":[326,337],"\u03a9(D\u0394)":[327],"D\u0394":[332],"\u2208":[333],"O(n).":[334],"valid":[339],"any":[341,360],"constant":[342],"log*":[348],"n+3":[349],"O(D\u0394).":[357],"Finally,":[358],"r,":[363],"O(D":[372],"\u0394/r).":[374]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}