Deadlock-Free Interval Routing Schemes. Flammini, M. In STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pages 351–362, 1997.
Deadlock-Free Interval Routing Schemes [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/stacs/Flammini97,
  author       = {Michele Flammini},
  title        = {Deadlock-Free Interval Routing Schemes},
  booktitle    = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
                  Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997, Proceedings},
  pages        = {351--362},
  year         = {1997},
  crossref     = {DBLP:conf/stacs/1997},
  url          = {https://doi.org/10.1007/BFb0023472},
  doi          = {10.1007/BFB0023472},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Flammini97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0