A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Sami Taktak, Emmanuelle Encrenaz, Jean Lou Desbarbieux
A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks
PDP, 2010.

PDP 2010
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{PDP-2010-TaktakED,
	author        = "Sami Taktak and Emmanuelle Encrenaz and Jean Lou Desbarbieux",
	booktitle     = "{Proceedings of the 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, PDP 2010, Pisa, Italy, February 17-19, 2010}",
	doi           = "10.1109/PDP.2010.19",
	isbn          = "978-0-7695-3939-3",
	pages         = "121--128",
	publisher     = "{IEEE Computer Society}",
	title         = "{A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks}",
	year          = 2010,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.