SIGN IN
SIGN UP
On space-stretch trade-offs: lower bounds
Full Text:
Pdf
Buy this Article
Authors:
Ittai Abraham
Hebrew University of Jerusalem, Jerusalem, Israel
Cyril Gavoille
University of Bordeaux, Bordeaux, France
Dahlia Malkhi
Hebrew University of Jerusalem and Microsoft Research, Silicon Valley Center
Published in:
· Proceeding
SPAA '06
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 207 - 216
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-452-9
doi>
10.1145/1148109.1148143
2006 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 206
· Citation Count: 15
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
compact routing
distributed networks
graph labeling
network problems
theory
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