Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Link opens in a new tab
Search content at Bar-Ilan University
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Locally self-adjusting tree networks
Chen Avin
, Bernhard Haeupler
,
Zvi Lotker
, Christian Scheideler
, Stefan Schmid
Ben-Gurion University of the Negev
Massachusetts Institute of Technology
Paderborn University
Technical University of Berlin
Research output
:
Contribution to conference
›
Paper
›
peer-review
18
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Locally self-adjusting tree networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Communication Cost
100%
Communication Patterns
100%
Tree Network
100%
Empirical Entropy
100%
Self-adjusting
100%
NP-hard
50%
Polynomial Time
50%
Facebook
50%
Simulation Study
50%
Shortest Path
50%
Greedy Routing
50%
Splay Tree
50%
Product Distribution
50%
Fully Decentralized
50%
Formal Analysis
50%
Convergence Property
50%
Graph Families
50%
Large Graphs
50%
Static Networks
50%
Distributed Data Structures
50%
Graph Cuts
50%
Minimum Linear Arrangement
50%
Multicast Tree
50%
Adaptive Networks
50%
Communication Partners
50%
Cost-based
50%
Computer Science
Communication Cost
100%
Tree Network
100%
Facebook
50%
multicast tree
50%
Distributed Data Structure
50%
Graph Cut
50%
Polynomial Time
50%
Simulation Study
50%
Convergence Property
50%