Sarah Cannon

According to our database1, Sarah Cannon authored at least 18 papers between 2012 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Programming Active Granular Matter with Mechanically Induced Phase Changes.
CoRR, 2020

Counting independent sets in unbalanced bipartite graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings.
Comb. Probab. Comput., 2019

A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the Approximation, 2019

2018
Markov chains and emergent behavior for problems from discrete geometry.
PhD thesis, 2018

Phase Transitions in Random Dyadic Tilings and Rectangular Dissections.
SIAM J. Discret. Math., 2018

A stochastic approach to shortcut bridging in programmable matter.
Nat. Comput., 2018

Combinatorics and complexity of guarding polygons with edge and point 2-transmitters.
Comput. Geom., 2018

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Phototactic Supersmarticles.
CoRR, 2017

2016
Diffuse reflection diameter in simple polygons.
Discret. Appl. Math., 2016

Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2013
Diffuse Reflections in Simple Polygons.
Electron. Notes Discret. Math., 2013

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

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

Conflict-Free Graph Orientations with Parity Constraints.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Hidden Mobile Guards in Simple Polygons.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012


  Loading...