Two hands are better than one (up to constant factors) S Cannon, ED Demaine, ML Demaine, S Eisenstat, MJ Patitz, ... arXiv preprint arXiv:1201.1650, 2012 | 102 | 2012 |
A Markov chain algorithm for compression in self-organizing particle systems S Cannon, JJ Daymude, D Randall, AW Richa Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 65 | 2016 |
Programming active cohesive granular matter with mechanically induced phase changes S Li, B Dutta, S Cannon, JJ Daymude, R Avinery, E Aydin, AW Richa, ... Science Advances 7 (17), eabe8494, 2021 | 47 | 2021 |
Counting independent sets in unbalanced bipartite graphs S Cannon, W Perkins Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 33 | 2020 |
A stochastic approach to shortcut bridging in programmable matter M Andrés Arroyo, S Cannon, JJ Daymude, D Randall, AW Richa Natural Computing 17, 723-741, 2018 | 33 | 2018 |
Phototactic supersmarticles W Savoie, S Cannon, JJ Daymude, R Warkentin, S Li, AW Richa, ... Artificial Life and Robotics 23, 459-468, 2018 | 31 | 2018 |
Voting rights, Markov chains, and optimization by short bursts S Cannon, A Goldbloom-Helzner, V Gupta, JN Matthews, B Suwal Methodology and Computing in Applied Probability 25 (1), 36, 2023 | 23 | 2023 |
A local stochastic algorithm for separation in heterogeneous self-organizing particle systems S Cannon, JJ Daymude, C Gokmen, D Randall, AW Richa arXiv preprint arXiv:1805.04599, 2018 | 18 | 2018 |
Spanning tree methods for sampling graph partitions S Cannon, M Duchin, D Randall, P Rule arXiv preprint arXiv:2210.01401, 2022 | 16 | 2022 |
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters S Cannon, TG Fai, J Iwerks, U Leopold, C Schmidt Computational Geometry 68, 89-100, 2018 | 12 | 2018 |
Phase transitions in random dyadic tilings and rectangular dissections S Cannon, S Miracle, D Randall SIAM Journal on Discrete Mathematics 32 (3), 1966-1992, 2018 | 12 | 2018 |
Fast and perfect sampling of subgraphs and polymer systems A Blanca, S Cannon, W Perkins ACM Transactions on Algorithms 20 (1), 1-30, 2024 | 11 | 2024 |
A reversible recombination chain for graph partitions S Cannon, M Duchin, D Randall, P Rule preprint, 2020 | 9 | 2020 |
A generalisation of Stone duality to orthomodular lattices S Cannon, A Döring Nagoya Winter Workshop: Reality and Measurement in Algebraic Quantum Theory …, 2015 | 9 | 2015 |
Diffuse reflection diameter in simple polygons G Barequet, SM Cannon, E Fox-Epstein, B Hescott, DL Souvaine, ... Discrete Applied Mathematics 210, 123-132, 2016 | 6* | 2016 |
On the effects of hierarchical self-assembly for reducing program-size complexity S Cannon, ED Demaine, ML Demaine, S Eisenstat, D Furcy, MJ Patitz, ... Theoretical Computer Science 894, 50-78, 2021 | 5 | 2021 |
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings S Cannon, D Levin, A Stauffer arXiv preprint arXiv:1611.03636, 2016 | 5 | 2016 |
Hidden mobile guards in simple polygons S Cannon, DL Souvaine, A Winslow arXiv preprint arXiv:1206.1803, 2012 | 5 | 2012 |
The spectral presheaf of an orthomodular lattice S Cannon Master’s thesis, Univ. Oxford, 2013 | 4 | 2013 |
Sampling on lattices with free boundary conditions using randomized extensions S Cannon, D Randall Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 3 | 2016 |