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