SIGN IN
SIGN UP
Compact roundtrip routing with topology-independent node names
Full Text:
PDF
Buy this Article
Authors:
Marta Arias
Tufts University, Medford, MA
Lenore J. Cowen
Tufts University, Medford, MA
Kofi A. Laing
Tufts University, Medford, MA
Published in:
· Proceeding
PODC '03
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Pages 43-52
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-708-7
doi>
10.1145/872035.872042
2003 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 13
· Downloads (cumulative): 285
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
compact routing
digraphs
distributed lookup tables
graph labeling
network communications
network problems
path and circuit problems
store and forward networks
stretch
trees
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