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):
Displaying 33 items.
- Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
- A scaling analysis of a cat and mouse Markov chain (Q417084) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Potential induced random teleportation on finite graphs (Q493692) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Random walks and the effective resistance sum rules (Q602687) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← 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)
- Randomized competitive analysis for two server problems (Q1662430) (← 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)
- Biased random walks (Q1912749) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Online perfect matching and mobile computing (Q5057433) (← links)
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations (Q5066876) (← links)
- Calculating effective resistances on underlying networks of association schemes (Q5504981) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
- Controllability of consensus heterogeneous multi-agent networks over continuous time scale (Q6556612) (← links)
