The following pages link to Tomasz Radzik (Q392192):
Displaying 18 items.
- (Q5005184) (← links)
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States (Q5090899) (← links)
- On Counting the Population Size (Q5145177) (← links)
- The Power of Two Choices in Distributed Voting (Q5167858) (← links)
- (Q5207878) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Algorithm Theory - SWAT 2004 (Q5315391) (← links)
- The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process (Q5361970) (← links)
- Brief Announcement (Q5369002) (← links)
- Coalescing Random Walks and Voting on Connected Graphs (Q5408589) (← links)
- (Q5417719) (← links)
- Power balance and apportionment algorithms for the United States Congress (Q5463376) (← links)
- Structural Information and Communication Complexity (Q5710084) (← links)
- Automata, Languages and Programming (Q5716787) (← links)
- Fast Low-Cost Estimation of Network Properties Using Random Walks (Q5856437) (← links)
- Perpetual maintenance of machines with different urgency requirements (Q6078292) (← links)
- Fast plurality consensus in regular expanders (Q6487484) (← links)
- New bounds for single-machine time-dependent scheduling with uniform deterioration (Q6562460) (← links)