The following pages link to John Sylvester (Q2149863):
Displaying 13 items.
- The complexity of finding optimal subgraphs to represent spatial correlation (Q2149864) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- The cover time of a (multiple) Markov chain with rational transition probabilities is rational (Q2670806) (← links)
- Choice and Bias in Random Walks (Q5875783) (← links)
- The power of two choices for random walks (Q5886308) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
- The Power of Filling in Balanced Allocations (Q6188516) (← links)
- Balanced Allocations with Heterogeneous Bins: The Power of Memory (Q6424212) (← links)
- Tangled Paths: A Random Graph Model from Mallows Permutations (Q6505169) (← links)
- Mean-Biased Processes for Balanced Allocations (Q6512397) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)
- Balanced allocations: caching and packing, twinning and thinning (Q6575148) (← links)
- The complexity of finding and enumerating optimal subgraphs to represent spatial correlation (Q6623585) (← links)
