{"id":"https://openalex.org/W2406650525","doi":"https://doi.org/10.1090/dimacs/021/08","title":"Highly adaptive wormhole routing algorithms for n-dimensional torus","display_name":"Highly adaptive wormhole routing algorithms for n-dimensional torus","publication_year":1995,"publication_date":"1995-07-12","ids":{"openalex":"https://openalex.org/W2406650525","doi":"https://doi.org/10.1090/dimacs/021/08","mag":"2406650525"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/021/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/021/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5040384183","display_name":"J. Duato","orcid":"https://orcid.org/0000-0002-7785-0607"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jose Duato","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100969146","display_name":"Pedero Lopez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pedero Lopez","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.31713344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"87","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.972100019454956,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.972100019454956,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9713000059127808,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9624999761581421,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/wormhole","display_name":"Wormhole","score":0.7826100587844849},{"id":"https://openalex.org/keywords/torus","display_name":"Torus","score":0.7151039242744446},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5379621982574463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5290549993515015},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.5178146958351135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45007872581481934},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40093329548835754},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36277100443840027},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.25792384147644043},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.19289320707321167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1877569854259491},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18695521354675293},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14433282613754272},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10624966025352478},{"id":"https://openalex.org/keywords/theoretical-physics","display_name":"Theoretical physics","score":0.09875854849815369},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.09697052836418152}],"concepts":[{"id":"https://openalex.org/C29013271","wikidata":"https://www.wikidata.org/wiki/Q7544","display_name":"Wormhole","level":2,"score":0.7826100587844849},{"id":"https://openalex.org/C9767117","wikidata":"https://www.wikidata.org/wiki/Q12510","display_name":"Torus","level":2,"score":0.7151039242744446},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5379621982574463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5290549993515015},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.5178146958351135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45007872581481934},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40093329548835754},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36277100443840027},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.25792384147644043},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.19289320707321167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1877569854259491},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18695521354675293},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14433282613754272},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10624966025352478},{"id":"https://openalex.org/C33332235","wikidata":"https://www.wikidata.org/wiki/Q18362","display_name":"Theoretical physics","level":1,"score":0.09875854849815369},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.09697052836418152}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/021/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/021/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2065657464","https://openalex.org/W2355445727","https://openalex.org/W2149224531","https://openalex.org/W1515583773","https://openalex.org/W2160885658","https://openalex.org/W4247716783","https://openalex.org/W2098791961","https://openalex.org/W2483530712","https://openalex.org/W2144164383","https://openalex.org/W4230539218"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}