The following pages link to Amos Korman (Q352248):
Displaying 50 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Online computation with advice (Q541670) (← links)
- Local MST computation with short advice (Q613116) (← links)
- New bounds for the controller problem (Q661061) (← links)
- Labeling schemes for dynamic tree networks (Q705063) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Parallel search with no coordination (Q1742769) (← links)
- Controller and estimator for dynamic networks (Q1951592) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Proof labeling schemes (Q2377139) (← links)
- The ANTS problem (Q2401118) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- An optimal ancestry scheme and small universal posets (Q2875188) (← links)
- Labeling schemes for vertex connectivity (Q2930318) (← links)
- Collaborative search on the plane without communication (Q2933778) (← links)
- Improved compact routing schemes for dynamic trees (Q2934343) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
- Breathe before speaking (Q2943616) (← links)
- An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets (Q3177763) (← links)
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach (Q3460704) (← links)
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes (Q3523216) (← links)
- On the Additive Constant of the k-Server Work Function Algorithm (Q3558920) (← links)
- Dynamic Routing Schemes for General Graphs (Q3613795) (← links)
- Online Computation with Advice (Q3638053) (← links)
- New Bounds for the Controller Problem (Q3646214) (← links)
- (Q4449189) (← links)
- Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits (Q4575917) (← links)
- The Dependent Doors Problem (Q4629956) (← links)
- Labeling Schemes for Flow and Connectivity (Q4651524) (← links)
- (Q4736829) (← links)
- (Q4829032) (← links)
- Distributed Verification and Hardness of Distributed Approximation (Q4907581) (← links)
- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology (Q4909402) (← links)
- Dynamic routing schemes for graphs with low local density (Q4962746) (← links)
- Label-guided graph exploration by a finite automaton (Q4962747) (← links)
- (Q4993318) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Navigating in Trees with Permanently Noisy Advice (Q5032023) (← links)
