The following pages link to (Q4736828):
Displayed 10 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Compact Routing in Unit Disk Graphs (Q6065413) (← links)