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.

Authors

Abhiram G. Ranade

This author has not been identified. Look up 'Abhiram G. Ranade' in Google

Saul Schleimer

This author has not been identified. Look up 'Saul Schleimer' in Google

Daniel Shawcross Wilkerson

This author has not been identified. Look up 'Daniel Shawcross Wilkerson' in Google