Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

SPAA
2005
ACM

103views Distributed And Parallel Com...» more SPAA 2005»

A space lower bound for name-independent compact routing in trees

15 years 8 months ago

A space lower bound for name-independent compact routing in trees

Download www.cs.tufts.edu

Kofi A. Laing, Rajmohan Rajaraman

Real-time Traffic

Distributed And Parallel Computing | SPAA 2005 |

claim paper

Related Content

» Approximate distance queries and compact routing in sparse graphs

» On spacestretch tradeoffs lower bounds

» Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

» Greedy Routing with Bounded Stretch

» Routing in Networks with Low Doubling Dimension

» HEXA Compact Data Structures for Faster Packet Processing

» Obstacleavoiding rectilinear Steiner tree construction

» Postplacement voltage island generation

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	SPAA
Authors	Kofi A. Laing, Rajmohan Rajaraman

Comments (0)