"O (log N / log log N) Randomized Routing in Degree-log N "Hypermeshes"."

Ted H. Szymanski (1991)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2014-07-28

- no documents available
- export record
  dblp key:
  - conf/icpp/Szymanski91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpp/Szymanski91
Ted H. Szymanski:
O (log N / log log N) Randomized Routing in Degree-log N "Hypermeshes". ICPP (1) 1991: 443-450

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.