| On the existence of accessible paths in various models of fitness landscapes P Hegarty, A Martinsson | 56 | 2014 |
| Optimal kronecker-sum approximation of real time recurrent learning F Benzing, MM Gauy, A Mujika, A Martinsson, A Steger International Conference on Machine Learning, 604-613, 2019 | 25 | 2019 |
| Lovász ϑ function, svms and finding dense subgraphs V Jethava, A Martinsson, C Bhattacharyya, D Dubhashi The Journal of Machine Learning Research 14 (1), 3495-3536, 2013 | 22 | 2013 |
| When does hillclimbing fail on monotone functions: an entropy compression argument J Lengler, A Martinsson, A Steger 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and …, 2019 | 19 | 2019 |
| An improved energy argument for the Hegselmann–Krause model A Martinsson Journal of Difference Equations and Applications 22 (4), 513-518, 2016 | 19 | 2016 |
| Unoriented first-passage percolation on the n-cube A Martinsson | 16 | 2016 |
| Accessibility percolation and first-passage site percolation on the unoriented binary hypercube A Martinsson arXiv preprint arXiv:1501.02206, 2015 | 15 | 2015 |
| A linear threshold for uniqueness of solutions to random jigsaw puzzles A Martinsson Combinatorics, Probability and Computing 28 (2), 287-302, 2019 | 13 | 2019 |
| The edge-statistics conjecture for ℓ ≪ k6/5 A Martinsson, F Mousset, A Noever, M Trujić Israel Journal of Mathematics 234 (2), 677-690, 2019 | 10 | 2019 |
| First-passage percolation on Cartesian power graphs A Martinsson The Annals of Probability 46 (2), 1004-1041, 2018 | 10 | 2018 |
| The Hegselmann-Krause dynamics on the circle converge P Hegarty, A Martinsson, E Wedin Journal of Difference Equations and Applications 22 (11), 1720-1731, 2016 | 10 | 2016 |
| Shotgun edge assembly of random jigsaw puzzles A Martinsson arXiv preprint arXiv:1605.07151, 2016 | 9 | 2016 |
| Mastermind with a linear number of queries A Martinsson, P Su Combinatorics, Probability and Computing 33 (2), 143-156, 2024 | 8 | 2024 |
| Long cycles, heavy cycles and cycle decompositions in digraphs C Knierim, M Larcher, A Martinsson, A Noever Journal of Combinatorial Theory, Series B 148, 125-148, 2021 | 8 | 2021 |
| Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances V Rozhoň, B Haeupler, A Martinsson, C Grunau, G Zuzic Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 321-334, 2023 | 7 | 2023 |
| Most edge‐orderings of Kn have maximal altitude A Martinsson Random Structures & Algorithms 54 (3), 559-585, 2019 | 7 | 2019 |
| The Lovasz ϑ function, SVMs and finding large dense subgraphs V Jethava, A Martinsson, C Bhattacharyya, D Dubhashi Advances in Neural Information Processing Systems 25, 2012 | 7 | 2012 |
| The Lovász θ function, SVMs and finding large dense subgraphs V Jethava, A Martinsson, C Bhattacharyya, D Dubhashi Proceedings of the 25th International Conference on Neural Information …, 2012 | 6 | 2012 |
| Hat guessing numbers of strongly degenerate graphs C Knierim, A Martinsson, R Steiner SIAM Journal on Discrete Mathematics 37 (2), 1331-1347, 2023 | 4 | 2023 |
| A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method A Martinsson arXiv preprint arXiv:2111.06214, 2021 | 3 | 2021 |
