SIGN IN
SIGN UP
Routing without ordering
Full Text:
PDF
Buy this Article
Authors:
Bernadette Charron-Bost
CNRS / Ecole polytechnique, Palaiseau, France
Antoine Gaillard
Ecole polytechnique, Palaiseau, France
Jennifer Welch
Texas A&M University, College Station, TX, USA
Josef Widder
TU Wien, Vienna, Austria
2009 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 26
· Downloads (cumulative): 197
· Citation Count: 4
Published in:
· Proceeding
SPAA '09
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Pages 145-153
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-606-9
doi>
10.1145/1583991.1584034
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
distributed systems
graph algorithms
graph labeling
link reversal
routing
theory
work complexity
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