Pages that link to "Item:Q3581257"
From MaRDI portal
The following pages link to A stochastic process on the hypercube with applications to peer-to-peer networks (Q3581257):
Displaying 10 items.
- Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks (Q436777) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- Using theorem proving to verify expectation and variance for discrete random variables (Q1040780) (← links)
- Proper distance in edge-colored hypercubes (Q1740062) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- Discovery through gossip (Q2811164) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- Scalable and dynamic quorum systems (Q5917934) (← links)