default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarah Cannon
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Sarah Cannon
:
Irreducibility of recombination Markov chains in the triangular lattice. Discret. Appl. Math. 347: 75-130 (2024)- [j10]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms 20(1): 5:1-5:30 (2024) - [c14]Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz:
Sampling Balanced Forests of Grids in Polynomial Time. STOC 2024: 1676-1687 - [i18]Sarah Cannon, Daryl R. DeFord, Moon Duchin:
Repetition effects in a Sequential Monte Carlo sampler. CoRR abs/2409.19017 (2024) - [i17]Sarah Cannon, Tyler Helmuth, Will Perkins:
Pirogov-Sinai Theory Beyond Lattices. CoRR abs/2411.07809 (2024) - 2023
- [c13]Sarah Cannon:
Irreducibility of Recombination Markov Chains in the Triangular Lattice. ACDA 2023: 98-109 - [i16]Sarah Cannon:
Irreducibility of Recombination Markov Chains in the Triangular Lattice. CoRR abs/2305.17239 (2023) - [i15]Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz:
Sampling Balanced Forests of Grids in Polynomial Time. CoRR abs/2310.15152 (2023) - 2022
- [c12]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. APPROX/RANDOM 2022: 4:1-4:18 - [i14]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and perfect sampling of subgraphs and polymer systems. CoRR abs/2202.05907 (2022) - [i13]Sarah Cannon, Moon Duchin, Dana Randall, Parker Rule:
Spanning tree methods for sampling graph partitions. CoRR abs/2210.01401 (2022) - 2021
- [j9]Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
On the effects of hierarchical self-assembly for reducing program-size complexity. Theor. Comput. Sci. 894: 50-78 (2021) - 2020
- [j8]Marcus Richardson, Sarah Cannon, Lincoln Teichert, Annaleah Vance, Isabelle Kramer, Megan Barter, Jesse King, Clark Callahan:
Religion-focused dating apps: A Q methodology study on the uses of mutual. Telematics Informatics 55: 101448 (2020) - [c11]Sarah Cannon, Will Perkins:
Counting independent sets in unbalanced bipartite graphs. SODA 2020: 1456-1466 - [i12]Shengkai Li, Bahnisikha Dutta, Sarah Cannon, Joshua J. Daymude, Ram Avinery, Enes Aydin, Andréa W. Richa, Daniel I. Goldman, Dana Randall:
Programming Active Granular Matter with Mechanically Induced Phase Changes. CoRR abs/2009.05710 (2020)
2010 – 2019
- 2019
- [j7]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. Comb. Probab. Comput. 28(3): 365-387 (2019) - [c10]Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa:
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. APPROX-RANDOM 2019: 54:1-54:22 - [i11]Sarah Cannon, Will Perkins:
Counting independent sets in unbalanced bipartite graphs. CoRR abs/1906.01666 (2019) - 2018
- [b1]Sarah Cannon:
Markov chains and emergent behavior for problems from discrete geometry. Georgia Institute of Technology, Atlanta, GA, USA, 2018 - [j6]William Savoie, Sarah Cannon, Joshua J. Daymude, Ross Warkentin, Shengkai Li, Andréa W. Richa, Dana Randall, Daniel I. Goldman:
Phototactic supersmarticles. Artif. Life Robotics 23(4): 459-468 (2018) - [j5]Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt:
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. Comput. Geom. 68: 89-100 (2018) - [j4]Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A stochastic approach to shortcut bridging in programmable matter. Nat. Comput. 17(4): 723-741 (2018) - [j3]Sarah Cannon, Sarah Miracle, Dana Randall:
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections. SIAM J. Discret. Math. 32(3): 1966-1992 (2018) - [c9]Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa:
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. PODC 2018: 483-485 - [i10]Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa:
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. CoRR abs/1805.04599 (2018) - 2017
- [c8]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. APPROX-RANDOM 2017: 34:1-34:21 - [c7]Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A Stochastic Approach to Shortcut Bridging in Programmable Matter. DNA 2017: 122-138 - [i9]Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A Stochastic Approach to Shortcut Bridging in Programmable Matter. CoRR abs/1709.02425 (2017) - [i8]Sarah Cannon, Joshua J. Daymude, William Savoie, Ross Warkentin, Shengkai Li, Daniel I. Goldman, Dana Randall, Andréa W. Richa:
Phototactic Supersmarticles. CoRR abs/1711.01327 (2017) - 2016
- [j2]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. Discret. Appl. Math. 210: 123-132 (2016) - [c6]Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. PODC 2016: 279-288 - [c5]Sarah Cannon, Dana Randall:
Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions. SODA 2016: 1952-1971 - [i7]Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. CoRR abs/1603.07991 (2016) - [i6]Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings. CoRR abs/1611.03636 (2016) - 2015
- [c4]Sarah Cannon, Sarah Miracle, Dana Randall:
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections. SODA 2015: 1573-1589 - [i5]Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt:
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. CoRR abs/1503.05681 (2015) - 2013
- [j1]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. Electron. Notes Discret. Math. 44: 345-350 (2013) - [c3]Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. STACS 2013: 172-184 - [i4]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. CoRR abs/1302.2271 (2013) - 2012
- [c2]Sarah Cannon, Diane L. Souvaine, Andrew Winslow:
Hidden Mobile Guards in Simple Polygons. CCCG 2012: 161-166 - [c1]Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth:
Conflict-Free Graph Orientations with Parity Constraints. FUN 2012: 57-68 - [i3]Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
Two Hands Are Better Than One (up to constant factors). CoRR abs/1201.1650 (2012) - [i2]Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth:
Conflict-free graph orientations with parity constraints. CoRR abs/1203.3256 (2012) - [i1]Sarah Cannon, Diane L. Souvaine, Andrew Winslow:
Hidden Mobile Guards in Simple Polygons. CoRR abs/1206.1803 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
