SIGN IN
SIGN UP
Space-efficient routing in vertex-symmetric networks (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Friedhelm Meyer auf der Heide
Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany
Christian Scheideler
Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany
Published in:
· Proceeding
SPAA '95
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Pages 137-146
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-717-0
doi>
10.1145/215399.215433
1995 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 153
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
network problems
parallel processors
performance
probabilistic algorithms
routing and layout
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder