Sarah Cannon

From MaRDI portal
(Redirected from Sarah Cannon)
Sarah Cannon Q299063



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Sampling Balanced Forests of Grids in Polynomial Time
(available as arXiv preprint)
N/APaper
Spanning trees and redistricting: new methods for sampling and validation
SIAM Review
2026-05-27Paper
Pirogov-Sinai theory for the hard-core model beyond lattices
Communications in Mathematical Physics
2026-05-15Paper
Census Dual Graphs: Properties and Random Graph Models
(available as arXiv preprint)
2026-01-01Paper
Fast and perfect sampling of subgraphs and polymer systems
ACM Transactions on Algorithms
2025-02-21Paper
Sampling tree-weighted partitions without sampling trees
(available as arXiv preprint)
2025-01-01Paper
Fast and perfect sampling of subgraphs and polymer systems2024-08-22Paper
Irreducibility of recombination Markov chains in the triangular lattice
Discrete Applied Mathematics
2024-02-27Paper
Repetition effects in a Sequential Monte Carlo sampler
(available as arXiv preprint)
2024-01-01Paper
Pirogov--Sinai Theory Beyond Lattices
(available as arXiv preprint)
2024-01-01Paper
A stochastic approach to shortcut bridging in programmable matter
Natural Computing
2023-11-30Paper
All the Math You Missed (But Need to Know for Graduate School)
Notices of the American Mathematical Society
2023-10-16Paper
scientific article; zbMATH DE number 7650121 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
On the effects of hierarchical self-assembly for reducing program-size complexity
Theoretical Computer Science
2021-11-11Paper
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings2021-07-28Paper
Counting independent sets in unbalanced bipartite graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
Brief Announcement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
2019-09-19Paper
A generalisation of Stone duality to orthomodular lattices2019-05-28Paper
Phase transitions in random dyadic tilings and rectangular dissections
SIAM Journal on Discrete Mathematics
2018-08-10Paper
Sampling on lattices with free boundary conditions using randomized extensions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems
(available as arXiv preprint)
2018-05-11Paper
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
Computational Geometry
2018-02-19Paper
A stochastic approach to shortcut bridging in programmable matter
Lecture Notes in Computer Science
2018-02-02Paper
Phase transitions in random dyadic tilings and rectangular dissections
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
A Markov chain algorithm for compression in self-organizing particle systems
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
2017-09-29Paper
Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
(available as arXiv preprint)
2017-01-30Paper
Diffuse reflection diameter in simple polygons
Discrete Applied Mathematics
2016-06-22Paper
Embeddedness for singly periodic Scherk surfaces with higher dihedral symmetry
Involve
2013-11-15Paper


Research outcomes over time


This page was built for person: Sarah Cannon