{"id":"https://openalex.org/W1490507553","doi":"https://doi.org/10.1007/3-540-44687-7_73","title":"Dijkstra\u2019s Shortest Path Routing Algorithm in Reconfigurable Hardware","display_name":"Dijkstra\u2019s Shortest Path Routing Algorithm in Reconfigurable Hardware","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1490507553","doi":"https://doi.org/10.1007/3-540-44687-7_73","mag":"1490507553"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44687-7_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44687-7_73","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":"conference-paper","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/A5018518872","display_name":"Matti Tommiska","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matti Tommiska","raw_affiliation_strings":["Signal Processing Laboratory, Helsinki University of Technology, Otakaari 5A, FIN-02150, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory, Helsinki University of Technology, Otakaari 5A, FIN-02150, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071452633","display_name":"Jorma Skytt\u00e4","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jorma Skytt\u00e4","raw_affiliation_strings":["Signal Processing Laboratory, Helsinki University of Technology, Otakaari 5A, FIN-02150, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory, Helsinki University of Technology, Otakaari 5A, FIN-02150, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5384,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.59822647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"653","last_page":"657"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8958640098571777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8185595273971558},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7520838975906372},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6806460618972778},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6770741939544678},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5983493328094482},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5787227749824524},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5190580487251282},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4744892120361328},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4641175866127014},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4566788077354431},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4462840259075165},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.437957763671875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3874979317188263},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3095242977142334},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.2590346336364746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2428922951221466},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16441071033477783},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16133767366409302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05426591634750366}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8958640098571777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8185595273971558},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7520838975906372},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6806460618972778},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6770741939544678},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5983493328094482},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5787227749824524},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5190580487251282},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4744892120361328},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4641175866127014},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4566788077354431},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4462840259075165},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.437957763671875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3874979317188263},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3095242977142334},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.2590346336364746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2428922951221466},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16441071033477783},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16133767366409302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05426591634750366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44687-7_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44687-7_73","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1593234504","https://openalex.org/W2150580621","https://openalex.org/W2152134162","https://openalex.org/W2169528473","https://openalex.org/W2613173048","https://openalex.org/W2750964270","https://openalex.org/W4247255165"],"related_works":["https://openalex.org/W7992011","https://openalex.org/W49154","https://openalex.org/W6846552","https://openalex.org/W8175827","https://openalex.org/W499851","https://openalex.org/W2037876","https://openalex.org/W12958437","https://openalex.org/W9080967","https://openalex.org/W9296126","https://openalex.org/W212752"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}