{"id":"https://openalex.org/W2035360197","doi":"https://doi.org/10.1109/tit.1983.1056696","title":"An efficient distributed orientation algorithm (Corresp.)","display_name":"An efficient distributed orientation algorithm (Corresp.)","publication_year":1983,"publication_date":"1983-07-01","ids":{"openalex":"https://openalex.org/W2035360197","doi":"https://doi.org/10.1109/tit.1983.1056696","mag":"2035360197"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056696","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"U. Vishkin","raw_affiliation_strings":["Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, NY, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, NY, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013018127"],"corresponding_institution_ids":["https://openalex.org/I174306211","https://openalex.org/I36672615","https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":1.1859,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.81270837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"4","first_page":"624","last_page":"629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9968000054359436,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9968000054359436,"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.9901000261306763,"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/T12288","display_name":"Optimization and Search Problems","score":0.9876000285148621,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6702995300292969},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6166033148765564},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5583484172821045},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.508059024810791},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5060974955558777},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4985945224761963},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47728219628334045},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46540480852127075},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.44788146018981934},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.41490209102630615},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.40160784125328064},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36798375844955444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3011005222797394},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.29725295305252075},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2900890111923218},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1755315661430359},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1098681092262268},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08059051632881165}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6702995300292969},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6166033148765564},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5583484172821045},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.508059024810791},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5060974955558777},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4985945224761963},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47728219628334045},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46540480852127075},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.44788146018981934},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.41490209102630615},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.40160784125328064},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36798375844955444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3011005222797394},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29725295305252075},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2900890111923218},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1755315661430359},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1098681092262268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08059051632881165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056696","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W150315025","https://openalex.org/W645913295","https://openalex.org/W1483382787","https://openalex.org/W1986291222","https://openalex.org/W2005711636","https://openalex.org/W2024686158","https://openalex.org/W2028917576","https://openalex.org/W2071796031","https://openalex.org/W2081695179","https://openalex.org/W2189542612","https://openalex.org/W2278142862","https://openalex.org/W2316292522","https://openalex.org/W2497607697","https://openalex.org/W3147179697","https://openalex.org/W4249456708","https://openalex.org/W4250645922","https://openalex.org/W6606132542"],"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/W4287555172","https://openalex.org/W3112921827","https://openalex.org/W1577671630","https://openalex.org/W2059844260"],"abstract_inverted_index":{"An":[0],"algorithm":[1,18,66],"for":[2,67],"constructing":[3],"and":[4,58],"maintaining":[5],"full":[6],"information":[7],"on":[8],"the":[9,42,51,54,76,88,103],"structure":[10],"of":[11,50,53,78,99],"a":[12,96],"communication":[13],"network":[14,55,89],"is":[15,56,81,85],"presented.":[16],"The":[17,48],"uses":[19],"distributed":[20],"computation.":[21],"It":[22,84],"can":[23],"be":[24,31,39,61],"used":[25],"as":[26],"an":[27],"information-gathering":[28],"step,":[29],"to":[30,38,60],"followed":[32],"by":[33],"special-purpose":[34],"algorithms":[35],"which":[36],"are":[37,110],"executed":[40],"within":[41],"nodes,":[43],"without":[44],"any":[45,64],"additional":[46],"communication.":[47],"load":[49],"lines":[52],"measured":[57],"shown":[59,86],"better":[62],"than":[63],"known":[65],"determining":[68],"connectivity,":[69],"suggesting":[70],"shortest":[71],"path,":[72],"routing,":[73],"etc.,":[74],"when":[75],"number":[77,98],"topological":[79,100],"changes":[80,101],"big":[82],"enough.":[83],"that":[87],"will":[90],"recover":[91],"in":[92,102],"finite":[93,97],"time":[94],"from":[95],"network.":[104],"Other,":[105],"more":[106],"powerful,":[107],"recovery":[108],"criteria":[109],"also":[111],"given.":[112]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}