Follow
John Sylvester
John Sylvester
Lecturer, University of Liverpool
Verified email at glasgow.ac.uk - Homepage
Title
Cited by
Cited by
Year
Balanced Allocations: Caching and Packing, Twinning and Thinning∗
D Los, T Sauerwald, J Sylvester
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
162022
Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
J Sylvester
Journal of Graph Theory 96 (1), 44-84, 2021
112021
The power of two choices for random walks
A Georgakopoulos, J Haslegrave, T Sauerwald, J Sylvester
Combinatorics, Probability and Computing 31 (1), 73-100, 2022
92022
Multiple random walks on graphs: Mixing few to cover many
N Rivera, T Sauerwald, J Sylvester
Combinatorics, Probability and Computing 32 (4), 594-637, 2023
82023
Bounds on the Twin-Width of Product Graphs
J Sylvester, W Pettersson
Discrete Mathematics and Theoretical Computer Science 25 (1), 2023
4*2023
Balanced allocations with heterogeneous bins: The power of memory
D Los, T Sauerwald, J Sylvester
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
42023
The dispersion time of random walks on finite graphs
N Rivera, T Sauerwald, A Stauffer, J Sylvester
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 103-113, 2019
42019
A new temporal interpretation of cluster editing
C Bocci, C Capresi, K Meeks, J Sylvester
International Workshop on Combinatorial Algorithms, 214-227, 2022
32022
Time dependent biased random walks
J Haslegrave, T Sauerwald, J Sylvester
ACM Transactions on Algorithms 18 (2), 2022
32022
Tangled paths: A random graph model from mallows permutations
J Enright, K Meeks, W Pettersson, J Sylvester
arXiv preprint arXiv:2108.04786, 2021
32021
Small but unwieldy: A lower bound on adjacency labels for small classes
É Bonnet, J Duron, J Sylvester, V Zamaraev, M Zhukovskii
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
22024
Tight bounds on adjacency labels for monotone graph classes
É Bonnet, J Duron, J Sylvester, V Zamaraev, M Zhukovskii
arXiv preprint arXiv:2310.20522, 2023
22023
Mean-Biased Processes for Balanced Allocations
D Los, T Sauerwald, J Sylvester
arXiv preprint arXiv:2308.05087, 2023
22023
The cover time of a (multiple) Markov chain with rational transition probabilities is rational
J Sylvester
Statistics & Probability Letters 187, 109534, 2022
22022
Choice and bias in random walks
A Georgakopoulos, J Haslegrave, T Sauerwald, J Sylvester
11th Innovations in Theoretical Computer Science Conference, ITCS 2020 151 …, 2020
22020
The Power of Filling in Balanced Allocations
D Los, T Sauerwald, J Sylvester
SIAM Journal on Discrete Mathematics 38 (1), 529-565, 2024
12024
Cops and robbers on multi-layer graphs
J Enright, K Meeks, W Pettersson, J Sylvester
International Workshop on Graph-Theoretic Concepts in Computer Science, 319-333, 2023
12023
Rumors with changing credibility
C Out, N Rivera, T Sauerwald, J Sylvester
arXiv preprint arXiv:2311.17040, 2023
2023
Cover and Hitting Times of Hyperbolic Random Graphs
M Kiwi, M Schepers, J Sylvester
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022
2022
The complexity of finding optimal subgraphs to represent spatial correlation
J Enright, D Lee, K Meeks, W Pettersson, J Sylvester
Combinatorial Optimization and Applications, COCOA 2021 13135, 152-166, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20