The following pages link to Yoav Rodeh (Q202474):
Displaying 21 items.
- Labeling schemes for dynamic tree networks (Q705063) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- Parallel search with no coordination (Q1742769) (← links)
- The small model property: How small can it be? (Q1854568) (← links)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Building small equality graphs for deciding equality logic with uninterpreted functions (Q2490118) (← links)
- (Q4474229) (← links)
- (Q4551144) (← links)
- The Dependent Doors Problem (Q4629956) (← links)
- (Q4736829) (← links)
- (Q4818813) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Navigating in Trees with Permanently Noisy Advice (Q5032023) (← links)
- (Q5092351) (← links)
- (Q5111412) (← links)
- Parallel Bayesian Search with No Coordination (Q5244389) (← links)
- Parallel exhaustive search without coordination (Q5361839) (← links)
- Constructing Labeling Schemes Through Universal Matrices (Q5459136) (← links)
- Correct Hardware Design and Verification Methods (Q5897079) (← links)
- Efficient detection of vacuity in temporal model checking (Q5943261) (← links)
