John Sylvester

Available identifiers

Publication	Date of Publication	Type
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation	2024-10-24	Paper
Balanced allocations: caching and packing, twinning and thinning	2024-07-19	Paper
A new temporal interpretation of cluster editing	2024-07-01	Paper
The Power of Filling in Balanced Allocations	2024-02-07	Paper
Rumors with Changing Credibility	2023-11-28	Paper
Multiple random walks on graphs: mixing few to cover many	2023-11-08	Paper
Time Dependent Biased Random Walks	2023-10-31	Paper
The power of two choices for random walks	2023-03-31	Paper
Cops and Robbers on Multi-Layer Graphs	2023-03-07	Paper
Choice and Bias in Random Walks	2023-02-03	Paper
Balanced Allocations with Heterogeneous Bins: The Power of Memory	2023-01-23	Paper
A new temporal interpretation of cluster editing	2022-08-30	Paper
The complexity of finding optimal subgraphs to represent spatial correlation	2022-06-29	Paper
The cover time of a (multiple) Markov chain with rational transition probabilities is rational	2022-06-01	Paper
A New Temporal Interpretation of Cluster Editing	2022-02-02	Paper
Balanced Allocations: Caching and Packing, Twinning and Thinning	2021-10-20	Paper
The Power of Two Choices for Random Walks	2019-11-12	Paper
The dispersion time of random walks on finite graphs	2018-08-28	Paper
Tangled Paths: A Random Graph Model from Mallows Permutations	N/A	Paper
Mean-Biased Processes for Balanced Allocations	N/A	Paper

This page was built for person: John Sylvester