Skip to content

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

Ted H. Szymanski

VenueBICPP
Year1991
ProceedingsICPP (1)

Browse the full ICPP paper archive.