| 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 | 18 | 2022 |
| 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 | 11 | 2021 |
| 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 | 9 | 2022 |
| 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 | 8 | 2023 |
| Bounds on the twin-width of product graphs W Pettersson, J Sylvester Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2023 | 6 | 2023 |
| 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 | 5 | 2019 |
| 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 | 4 | 2024 |
| A new temporal interpretation of cluster editing C Bocci, C Capresi, K Meeks, J Sylvester Journal of Computer and System Sciences 144, 103551, 2024 | 4 | 2024 |
| 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 | 4 | 2023 |
| Time dependent biased random walks J Haslegrave, T Sauerwald, J Sylvester ACM Transactions on Algorithms 18 (2), 2022 | 4 | 2022 |
| Tight bounds on adjacency labels for monotone graph classes É Bonnet, J Duron, J Sylvester, V Zamaraev, M Zhukovskii arXiv preprint arXiv:2310.20522, 2023 | 3 | 2023 |
| Tangled paths: A random graph model from mallows permutations J Enright, K Meeks, W Pettersson, J Sylvester arXiv preprint arXiv:2108.04786, 2021 | 3 | 2021 |
| Mean-Biased Processes for Balanced Allocations D Los, T Sauerwald, J Sylvester arXiv preprint arXiv:2308.05087, 2023 | 2 | 2023 |
| The cover time of a (multiple) Markov chain with rational transition probabilities is rational J Sylvester Statistics & Probability Letters 187, 109534, 2022 | 2 | 2022 |
| 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 | 2 | 2020 |
| The Power of Filling in Balanced Allocations D Los, T Sauerwald, J Sylvester SIAM Journal on Discrete Mathematics 38 (1), 529-565, 2024 | 1 | 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 | 1 | 2023 |
| Symmetric-Difference (Degeneracy) and Signed Tree Models É Bonnet, J Duron, J Sylvester, V Zamaraev arXiv preprint arXiv:2405.09011, 2024 | | 2024 |
| Rumors with changing credibility C Out, N Rivera, T Sauerwald, J Sylvester 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) 287 …, 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 |
Thomas SauerwaldUniversity Lecturer in Computer Science, University of Cambridge在 cl.cam.ac.uk 的电子邮件经过验证
