BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:dblp

The blue social bookmark and publication sharing system.

entry of dblp:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.

by: Mostafa Rezazad, M. Hoseiny Farahabady, and Hamid Sarbazi-Azad

In: ICDCN, Vol. 4904Springer (2008) , p. 280-285.

Resources (URL, PDF, PS...)

URL:	http://dblp.uni-trier.de/db/conf/icdcn/icdcn2008.html#RezazadFS08

@inproceedings{conf/icdcn/RezazadFS08,
  added-at = {2007-12-22T00:00:00.000+0100},
  author = {Rezazad, Mostafa and Farahabady, M. Hoseiny and Sarbazi-Azad, Hamid},
  biburl = {http://www.bibsonomy.org/bibtex/2d5f3fe22e1d1d9d91776fdf8fa1e979a/dblp},
  booktitle = {ICDCN},
  crossref = {conf/icdcn/2008},
  date = {2007-12-22},
  description = {dblp},
  editor = {Rao, Shrisha and Chatterjee, Mainak and Jayanti, Prasad and Murthy, C. Siva Ram and Saha, Sanjoy Kumar},
  ee = {http://dx.doi.org/10.1007/978-3-540-77444-0_27},
  interhash = {4fabaa48d465ca4a2d7ac577e6fa0741},
  intrahash = {d5f3fe22e1d1d9d91776fdf8fa1e979a},
  isbn = {978-3-540-77443-3},
  keywords = {dblp},
  pages = {280-285},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2007-12-22T00:00:00.000+0100},
  title = {A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.},
  url = {http://dblp.uni-trier.de/db/conf/icdcn/icdcn2008.html#RezazadFS08},
  volume = 4904,
  year = 2008
}

Endnote record

BibSonomy :: publication ::

A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.

Resources (URL, PDF, PS...)

Description

BibTeX record

Endnote record