The following pages link to Amos Korman (Q352248):
Displaying 24 items.
- (Q5092351) (← links)
- (Q5111412) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- Efficient threshold detection in a distributed environment (Q5176197) (← links)
- Proof labeling schemes (Q5177219) (← links)
- Distributed verification of minimum spanning trees (Q5177261) (← links)
- Parallel Bayesian Search with No Coordination (Q5244389) (← links)
- Parallel exhaustive search without coordination (Q5361839) (← links)
- Brief Announcement (Q5361937) (← links)
- (Q5365131) (← links)
- Distributed Computing (Q5395163) (← links)
- Towards a complexity theory for local distributed computing (Q5395731) (← links)
- Controller and estimator for dynamic networks (Q5401410) (← links)
- (Q5417638) (← links)
- Distributed verification and hardness of distributed approximation (Q5419106) (← links)
- Labeling Schemes with Queries (Q5425964) (← links)
- Labeling Schemes for Vertex Connectivity (Q5428801) (← links)
- Constructing Labeling Schemes Through Universal Matrices (Q5459136) (← links)
- Distributed Computing – IWDC 2005 (Q5491762) (← links)
- Local Distributed Decision (Q5494995) (← links)
- On the Impact of Identifiers on Local Decision (Q5499979) (← links)
- Automata, Languages and Programming (Q5716786) (← links)
- (Q5874301) (← links)
- Early adapting to trends: self-stabilizing information spread using passive communication (Q6658819) (← links)