| 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 | 11 | 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 | 9 | 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 | 7 | 2022 |
| Multiple Random Walks on Graphs: Mixing Few to Cover Many N Rivera, T Sauerwald, J Sylvester 48th International Colloquium on Automata, Languages, and Programming, ICALP …, 2020 | 5 | 2020 |
| Bounds on the twin-width of product graphs W Pettersson, J Sylvester arXiv preprint arXiv:2202.11556, 2022 | 3 | 2022 |
| Time dependent biased random walks J Haslegrave, T Sauerwald, J Sylvester ACM Transactions on Algorithms 18 (2), 2022 | 3 | 2022 |
| The cover time of a (multiple) Markov chain with rational transition probabilities is rational J Sylvester Statistics & Probability Letters 187, 109534, 2022 | 2 | 2022 |
| A new temporal interpretation of cluster editing C Bocci, C Capresi, K Meeks, J Sylvester Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier …, 2022 | 2 | 2022 |
| Tangled paths: A random graph model from mallows permutations J Enright, K Meeks, W Pettersson, J Sylvester arXiv preprint arXiv:2108.04786, 2021 | 2 | 2021 |
| 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 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 | 2 | 2019 |
| Bounds on the Twin-Width of Product Graphs J Sylvester, W Pettersson Discrete Mathematics and Theoretical Computer Science 25 (1), 2023 | | 2023 |
| Cops and Robbers on Multi-Layer Graphs J Enright, K Meeks, W Pettersson, J Sylvester arXiv preprint arXiv:2303.03962, 2023 | | 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 | | 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 Power of Filling in Balanced Allocations D Los, T Sauerwald, J Sylvester arXiv preprint arXiv:2204.04057, 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 |
Thomas SauerwaldUniversity Lecturer in Computer Science, University of CambridgeVerified email at cl.cam.ac.uk
