{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T13:42:50Z","timestamp":1747143770111},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424994"},{"type":"electronic","value":"9783540446873"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44687-7_73","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T20:46:00Z","timestamp":1180212360000},"page":"653-657","source":"Crossref","is-referenced-by-count":20,"title":["Dijkstra\u2019s Shortest Path Routing Algorithm in Reconfigurable Hardware"],"prefix":"10.1007","author":[{"given":"Matti","family":"Tommiska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Skytt\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"12","key":"73_CR1","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1109\/5.476080","volume":"83","author":"N. Tredennick","year":"1995","unstructured":"N. Tredennick: \u201dTechnology and Business: Forces Driving Microprocessor Evolution\u201d, Proceedings of the IEEE, Vol. 83, No. 12, December 1995, pp. 1641\u20131652.","journal-title":"Proceedings of the IEEE"},{"key":"73_CR2","unstructured":"A. Alles: ATM Internetworking. Cisco Systems, Inc. 1995."},{"key":"73_CR3","unstructured":"W. Stallings: Data and Computer Communications. Prentice-Hall, 1999."},{"key":"73_CR4","unstructured":"A. Tanenbaum: Computer Networks. Prentice-Hall, 1996."},{"key":"73_CR5","unstructured":"M. Tommiska: \u201dReconfigurable Computing in Communications Systems\u201d, Licentiate of Sciences Thesis, Helsinki University of Technology, 1998, pp. 46\u201350."},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra: \u201dA Note on Two Problems in Connexion with Graphs\u201d, Numerische Mathematik, Vol. 1, 1959, pp. 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"J. Moy: \u201dOSPF Version 2, RFC 2328\u201d, May 1998.","DOI":"10.17487\/rfc2328"},{"key":"73_CR8","unstructured":"D. Bertsekas, R. Gallager: Data Networks. Prentice-Hall, 1987, pp. 297\u2013421"},{"key":"73_CR9","unstructured":"M.A. Weiss: Data Structures and Algorithm Analysis in C. The Benjamin\/Cummings Publishing Company, Inc. 1993, pp. 281\u2013343"},{"key":"73_CR10","unstructured":"M. Zwolinks: \u201dDigital System Design and VHDL\u201d, Prentice-Hall 2000."},{"key":"73_CR11","unstructured":"FPGA Express User\u2019s Manual, 2000, Synopsys Corporation."},{"key":"73_CR12","unstructured":"FLEX 10K Embedded Programmable Logic Family Data Sheet, ver. 4.02, May 2000, Altera Corporation."},{"key":"73_CR13","unstructured":"Quartus Programmable Logic Development System & Software, ver. 1.01, May 1999, Altera Corporation."}],"container-title":["Lecture Notes in Computer Science","Field-Programmable Logic and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44687-7_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:04:53Z","timestamp":1556435093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44687-7_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424994","9783540446873"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44687-7_73","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}