Sarah Cannon

According to our database, Sarah Cannon authored at least 26 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Fast and Perfect Sampling of Subgraphs and Polymer Systems.

Antonio Blanca, Sarah Cannon, Will Perkins

ACM Trans. Algorithms, January, 2024

Irreducibility of recombination Markov chains in the triangular lattice.

Sarah Cannon

Discret. Appl. Math., 2024

Pirogov-Sinai Theory Beyond Lattices.

Sarah Cannon, Tyler Helmuth, Will Perkins

CoRR, 2024

Repetition effects in a Sequential Monte Carlo sampler.

Sarah Cannon, Daryl R. DeFord, Moon Duchin

CoRR, 2024

Sampling Balanced Forests of Grids in Polynomial Time.

Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2022

Spanning tree methods for sampling graph partitions.

Sarah Cannon, Moon Duchin, Dana Randall, Parker Rule

CoRR, 2022

2021

On the effects of hierarchical self-assembly for reducing program-size complexity.

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

Theor. Comput. Sci., 2021

2020

Religion-focused dating apps: A Q methodology study on the uses of mutual.

Marcus Richardson, Sarah Cannon, Lincoln Teichert, Annaleah Vance, Isabelle Kramer, Megan Barter, Jesse King, Clark Callahan

Telematics Informatics, 2020

Programming Active Granular Matter with Mechanically Induced Phase Changes.

Shengkai Li, Bahnisikha Dutta, Sarah Cannon, Joshua J. Daymude, Ram Avinery, Enes Aydin, Andréa W. Richa, Daniel I. Goldman, Dana Randall

CoRR, 2020

Counting independent sets in unbalanced bipartite graphs.

Sarah Cannon, Will Perkins

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings.

Sarah Cannon, David A. Levin, Alexandre Stauffer

Comb. Probab. Comput., 2019

A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.

Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa

Proceedings of the Approximation, 2019

2018

Markov chains and emergent behavior for problems from discrete geometry.

Sarah Cannon

PhD thesis, 2018

Phase Transitions in Random Dyadic Tilings and Rectangular Dissections.

Sarah Cannon, Sarah Miracle, Dana Randall

SIAM J. Discret. Math., 2018

A stochastic approach to shortcut bridging in programmable matter.

Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa

Nat. Comput., 2018

Combinatorics and complexity of guarding polygons with edge and point 2-transmitters.

Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt

Comput. Geom., 2018

Phototactic supersmarticles.

William Savoie, Sarah Cannon, Joshua J. Daymude, Ross Warkentin, Shengkai Li, Andréa W. Richa, Dana Randall, Daniel I. Goldman

Artif. Life Robotics, 2018

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.

Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2016

Diffuse reflection diameter in simple polygons.

Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow

Discret. Appl. Math., 2016

Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions.

Sarah Cannon, Dana Randall

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.

Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2013

Diffuse Reflections in Simple Polygons.

Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow

Electron. Notes Discret. Math., 2013

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Two Hands Are Better Than One (up to constant factors)

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

CoRR, 2012

Conflict-Free Graph Orientations with Parity Constraints.

Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Hidden Mobile Guards in Simple Polygons.

Sarah Cannon, Diane L. Souvaine, Andrew Winslow

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012