{"id":"https://openalex.org/W2161212768","doi":"https://doi.org/10.1142/s0129626499000505","title":"ALL-TO-ALL BROADCASTING ALGORITHMS ON HONEYCOMB NETWORKS AND APPLICATIONS","display_name":"ALL-TO-ALL BROADCASTING ALGORITHMS ON HONEYCOMB NETWORKS AND APPLICATIONS","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2161212768","doi":"https://doi.org/10.1142/s0129626499000505","mag":"2161212768"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000505","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000505","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046498663","display_name":"Jean Carle","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"JEAN CARLE","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013486678","display_name":"Jean\u2010Fr\u00e9d\u00e9ric Myoupo","orcid":"https://orcid.org/0000-0003-3657-2556"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"JEAN-FREDERIC MYOUPO","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112811055","display_name":"David Sem\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"DAVID SEME","raw_affiliation_strings":["Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":1.3432,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.86379603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"09","issue":"04","first_page":"539","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T11269","display_name":"Algorithms and Data Compression","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7028793096542358},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5157749652862549},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.513443112373352},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5061718821525574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4879431128501892},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.47829681634902954},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.45157212018966675},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.421808123588562},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40400195121765137},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3514380156993866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2748810350894928},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23674914240837097},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.233932226896286}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7028793096542358},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5157749652862549},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.513443112373352},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5061718821525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4879431128501892},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.47829681634902954},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.45157212018966675},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.421808123588562},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40400195121765137},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3514380156993866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2748810350894928},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23674914240837097},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.233932226896286}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626499000505","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000505","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03238076v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03238076","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Parallel Processing Letters, 2011, 09 (04), pp.539-550. ⟨10.1142/S0129626499000505⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1963620900","https://openalex.org/W2000768601","https://openalex.org/W2016910643","https://openalex.org/W2043359857","https://openalex.org/W2109573594","https://openalex.org/W2123301304","https://openalex.org/W2133595740","https://openalex.org/W2164966011"],"related_works":["https://openalex.org/W2920386017","https://openalex.org/W2795454383","https://openalex.org/W4317662907","https://openalex.org/W2054041134","https://openalex.org/W1965364641","https://openalex.org/W45522302","https://openalex.org/W2593735092","https://openalex.org/W2749663619","https://openalex.org/W1977529769","https://openalex.org/W1971148082"],"abstract_inverted_index":{"This":[0,33],"paper":[1],"presents":[2],"two":[3],"simple":[4],"all-to-all":[5,110],"broadcasting":[6],"algorithms":[7,112],"on":[8,60,87,120],"honeycomb":[9,88],"mesh.":[10],"Consider":[11],"a":[12,28,61,66,83,121],"network":[13],"with":[14],"n":[15,40],"processors,":[16],"one":[17],"has":[18,65],"personalized":[19],"routing":[20],"strategy":[21],"at":[22],"each":[23],"node":[24],"and":[25,64,104],"it":[26],"requires":[27],"3n":[29],"communication":[30,34,54,68],"time":[31,35,44,69],"complexity.":[32,70],"can":[36,75],"be":[37,49,76],"reduced":[38],"to":[39,48,78,82],"because":[41],"the":[42,53,114],"computation":[43],"is":[45,58],"always":[46],"assumed":[47],"much":[50],"lower":[51],"than":[52],"time.":[55],"The":[56],"other":[57],"based":[59],"Hamiltonian":[62],"path":[63],"2n":[67],"We":[71],"show":[72],"how":[73],"they":[74],"used":[77],"get":[79],"parallel":[80],"solutions":[81],"class":[84],"of":[85],"problems":[86],"networks,":[89],"among":[90],"others":[91],"Prefix":[92],"Sums,":[93],"Maximal":[94,96],"Vectors,":[95],"Sum":[97],"Subsegment,":[98],"Parenthesis":[99],"Matching,":[100],"Decoding":[101],"Binary":[102],"Tree,":[103],"Sorting.":[105],"In":[106],"our":[107],"knowledge,":[108],"these":[109],"broadcast":[111],"are":[113],"only":[115],"ones":[116],"so":[117],"far":[118],"exhibited":[119],"honeycomb.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}