SIGN IN
SIGN UP
Improved compact routing schemes for dynamic trees
Full Text:
PDF
Buy this Article
Author:
Amos Korman
CNRS and Université Paris Diderot - Paris 7, Paris, France
Published in:
· Proceeding
PODC '08
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Pages 185-194
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-989-0
doi>
10.1145/1400751.1400777
2008 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 19
· Downloads (cumulative): 183
· Citation Count: 8
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:
algorithms
combinatorial algorithms
distributed algorithms
distributed data structures
distributed networks
dynamic trees
graphs and networks
network communications
network topology
routing protocols
routing schemes
theory
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