Nearly Tight Bounds for Wormhole Routing

Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson. Nearly Tight Bounds for Wormhole Routing. In 35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA. pages 347-355, IEEE, 1994.

@inproceedings{RanadeSW94,
  title = {Nearly Tight Bounds for Wormhole Routing},
  author = {Abhiram G. Ranade and Saul Schleimer and Daniel Shawcross Wilkerson},
  year = {1994},
  tags = {routing},
  researchr = {https://researchr.org/publication/RanadeSW94},
  cites = {0},
  citedby = {0},
  pages = {347-355},
  booktitle = {35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA},
  publisher = {IEEE},
}