The following pages link to Tom Friedetzky (Q433411):
Displaying 32 items.
- Balls into bins with related random choices (Q433413) (← links)
- Sublinear-time algorithms for tournament graphs (Q652634) (← links)
- Randomized diffusion for indivisible loads (Q743119) (← links)
- Balls into non-uniform bins (Q897392) (← links)
- Self-stabilizing balls and bins in batches. The power of leaky bins (Q1799218) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- On weighted balls-into-bins games (Q2378532) (← links)
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks (Q2428697) (← links)
- On the stability of dynamic diffusion load balancing (Q2479533) (← links)
- Observe and Remain Silent (Communication-Less Agent Location Discovery) (Q2912740) (← links)
- Random walks which prefer unvisited edges. (Q2933774) (← links)
- Faster Coupon Collecting via Replication with Applications in Gossiping (Q3088030) (← links)
- Multiple-Choice Balanced Allocation in (Almost) Parallel (Q3167413) (← links)
- Distributed Selfish Load Balancing (Q3519392) (← links)
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks (Q3527199) (← links)
- Distributed selfish load balancing (Q3581536) (← links)
- The Natural Work-Stealing Algorithm is Stable (Q4429685) (← links)
- Efficient plurality consensus, or: The benefits of cleaning up from time to time (Q4598279) (← links)
- Plurality consensus in arbitrary graphs : lessons learned from load balancing. (Q4606279) (← links)
- (Q4737705) (← links)
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States (Q5090899) (← links)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (Q5175230) (← links)
- Sublinear-Time Algorithms for Tournament Graphs (Q5323094) (← links)
- Self-stabilizing Balls & Bins in Batches (Q5361921) (← links)
- (Q5365053) (← links)
- Brief Announcement (Q5368985) (← links)
- Algorithms – ESA 2005 (Q5475882) (← links)
- STACS 2005 (Q5710677) (← links)
- Automata, Languages and Programming (Q5716762) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5891998) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5892351) (← links)
- Payment scheduling in the interval debt model (Q6664057) (← links)
