Fast and Perfect Sampling of Subgraphs and Polymer Systems. | 0 | 0.34 | 2022 |
On the effects of hierarchical self-assembly for reducing program-size complexity | 0 | 0.34 | 2021 |
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. | 1 | 0.43 | 2018 |
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. | 0 | 0.34 | 2018 |
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings | 0 | 0.34 | 2017 |
A Stochastic Approach to Shortcut Bridging in Programmable Matter. | 0 | 0.34 | 2017 |
Phototactic Supersmarticles. | 0 | 0.34 | 2017 |
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. | 6 | 0.50 | 2016 |
Diffuse Reflection Diameter in Simple Polygons | 0 | 0.34 | 2016 |
Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions. | 1 | 0.37 | 2016 |
Phase transitions in random dyadic tilings and rectangular dissections | 2 | 0.41 | 2015 |
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. | 10 | 0.60 | 2013 |
Diffuse Reflections in Simple Polygons | 1 | 0.36 | 2013 |
Hidden Mobile Guards in Simple Polygons | 1 | 0.43 | 2012 |
Two Hands Are Better Than One (up to constant factors) | 7 | 0.56 | 2012 |
Conflict-Free graph orientations with parity constraints | 0 | 0.34 | 2012 |