Back to Results
First PageMeta Content
Network theory / Distributed data storage / Tree decomposition / Path decomposition / Shortest path problem / Chord / Binary tree / Graph / Centrality / Graph theory / Mathematics / Theoretical computer science


Universal Augmentation Schemes Navigability: √ for Network ∗ Overcoming the n-Barrier Pierre Fraigniaud
Add to Reading List

Document Date: 2007-02-16 13:50:20

Open Document

File Size: 158,79 KB

Share Result on Facebook

City

Philadelphia / San Diego / MATRIX / /

Company

Randomized P2P Networks / ComputerCommunication Networks / Small-World Networks / Computer-Communication Networks / /

Country

United States / /

Currency

USD / /

/

Event

FDA Phase / /

Facility

University Paris Sud / France Ben Gurion University / University of Bordeaux / University Paris / France University of Bordeaux France Gdansk Univ. / /

IndustryTerm

long-range contact networks / decentralized search algorithm / oblivious routing protocol / social networks / /

Organization

International Congress / France Ben Gurion University Israel / France University of Bordeaux France Gdansk Univ. / University of Bordeaux / /

Person

Adrian Kosowski / Standley Milgram / Emmanuelle Lebhar Zvi Lotker / Cyril Gavoille / Emmanuelle Lebhar / Pierre Fraigniaud / Cyril Gavoille Adrian Kosowski / /

/

Position

General / sociologist / /

Product

Pentax K-x Digital Camera / Bk0 / /

ProvinceOrState

California / /

PublishedMedium

Psychology Today / Theoretical Computer Science / Theory of Computing / /

Technology

oblivious routing protocol / peer-to-peer / ESA / decentralized search algorithm / Network Protocols / /

SocialTag