Подписаться
John Sylvester
John Sylvester
Lecturer, University of Liverpool
Подтвержден адрес электронной почты в домене liverpool.ac.uk - Главная страница
Название
Процитировано
Процитировано
Год
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
182022
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
132021
Bounds on the twin-width of product graphs
W Pettersson, J Sylvester
Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2023
112023
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
102022
A new temporal interpretation of cluster editing
C Bocci, C Capresi, K Meeks, J Sylvester
Journal of Computer and System Sciences 144, 103551, 2024
92024
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
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
62024
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
62019
Tight bounds on adjacency labels for monotone graph classes
É Bonnet, J Duron, J Sylvester, V Zamaraev, M Zhukovskii
51st International Colloquium on Automata, Languages, and Programming ICALP …, 2024
52024
Time dependent biased random walks
J Haslegrave, T Sauerwald, J Sylvester
ACM Transactions on Algorithms 18 (2), 2022
52022
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
Cover and hitting times of hyperbolic random graphs
M Kiwi, M Schepers, J Sylvester
Random Structures & Algorithms, 2024
32024
Mean-Biased Processes for Balanced Allocations
D Los, T Sauerwald, J Sylvester
arXiv preprint arXiv:2308.05087, 2023
32023
Tangled paths: A random graph model from mallows permutations
J Enright, K Meeks, W Pettersson, J Sylvester
arXiv preprint arXiv:2108.04786, 2021
32021
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
32020
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
J Enright, D Lee, K Meeks, W Pettersson, J Sylvester
Algorithmica 86 (10), 3186-3230, 2024
2*2024
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
22023
The cover time of a (multiple) Markov chain with rational transition probabilities is rational
J Sylvester
Statistics & Probability Letters 187, 109534, 2022
22022
Adjacency Labeling Schemes for Small Classes
É Bonnet, J Duron, J Sylvester, V Zamaraev
arXiv preprint arXiv:2409.04821, 2024
12024
The Power of Filling in Balanced Allocations
D Los, T Sauerwald, J Sylvester
SIAM Journal on Discrete Mathematics 38 (1), 529-565, 2024
12024
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20