The following pages link to (Q2768347):
Displayed 21 items.
- Topology recognition with advice (Q259077) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- XRules: an effective algorithm for structural classification of XML data (Q2491362) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Lower and upper bounds for deterministic convergecast with labeling schemes (Q2693630) (← links)
- A Simple and Optimal Ancestry Labeling Scheme for Trees (Q3449505) (← links)
- (Q5002836) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)