Pages that link to "Item:Q3140012"
From MaRDI portal
The following pages link to Random walks on weighted graphs and applications to on-line algorithms (Q3140012):
Displayed 18 items.
- Geometric two-server algorithms (Q673915) (← links)
- On convex body chasing (Q1207798) (← links)
- The combinatorics of effective resistances and resistive inverses (Q1281506) (← links)
- Non-uniform random spanning trees on weighted graphs (Q1292296) (← links)
- On the power of randomization in on-line algorithms (Q1312184) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- On-line algorithms for locating checkpoints (Q1312186) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- Random walks on a finite graph with congestion points (Q1827003) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Calculating effective resistances on underlying networks of association schemes (Q5504981) (← links)