| Fast algorithms at low temperatures via Markov chains Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda Random Structures & Algorithms 58 (2), 294-321, 2021 | 40 | 2021 |
| Fast algorithms for general spin systems on bipartite expanders A Galanis, LA Goldberg, J Stewart ACM Transactions on Computation Theory (TOCT) 13 (4), 1-18, 2021 | 22 | 2021 |
| The complexity of bribery in network-based rating systems U Grandi, J Stewart, P Turrini Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 7 | 2018 |
| Fast mixing via polymers for random graphs with unbounded degree A Galanis, LA Goldberg, J Stewart Information and Computation 285, 104894, 2022 | 5 | 2022 |
| Personalised rating U Grandi, J Stewart, P Turrini Autonomous Agents and Multi-Agent Systems 34, 1-38, 2020 | 5 | 2020 |
| Data-free model pruning at initialization via expanders J Stewart, U Michieli, M Ozay Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2023 | 3 | 2023 |
| Randomised algorithms for low temperature spin systems J Stewart University of Oxford, 2022 | | 2022 |
| A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs A Galanis, LA Goldberg, J Stewart arXiv preprint arXiv:1901.06653, 2019 | | 2019 |
| The Computational Complexity of Bribery in a Network-Based Rating System J Stewart Master’s Thesis, Imperial College London, 2017 | | 2017 |
