Space-efficient routing in vertex-symmetric networks (extended abstract)

Authors:
Friedhelm Meyer auf der Heide;Christian Scheideler
Affiliations:
Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany;Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany
Venue:
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Year:
1995

Citing 10
Cited 0

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Space-efficient message routing in c-decomposable networks

SIAM Journal on Computing
Improved routing strategies with succinct tables

Journal of Algorithms
The spatial complexity of oblivious k-probe Hash functions

SIAM Journal on Computing
How to emulate shared memory

Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized routing and sorting on fixed-connection networks

Journal of Algorithms
Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q

Journal of Combinatorial Theory Series B
Chernoff-Hoeffding bounds for applications with limited independence

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Boolean Routing

WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract