( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.

, , , и . PODC, стр. 279-288. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Alan Cannon

Nabil Sarah

Thula Cannon Walter

Silva E Cannon

Sarah Wagner

 

Другие публикации лиц с тем же именем

Phase Transitions in Random Dyadic Tilings and Rectangular Dissections., , и . SIAM J. Discret. Math., 32 (3): 1966-1992 (2018)Markov chains and emergent behavior for problems from discrete geometry.. Georgia Institute of Technology, Atlanta, GA, USA, (2018)base-search.net (ftgeorgiatech:oai:smartech.gatech.edu:1853/60265).Counting independent sets in unbalanced bipartite graphs., и . SODA, стр. 1456-1466. SIAM, (2020)Phase Transitions in Random Dyadic Tilings and Rectangular Dissections., , и . SODA, стр. 1573-1589. SIAM, (2015)Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions., и . SODA, стр. 1952-1971. SIAM, (2016)Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM., , , , , , , и . STACS, том 20 из LIPIcs, стр. 172-184. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems., , , , и . CoRR, (2018)Hidden Mobile Guards in Simple Polygons, , и . CoRR, (2012)Fast and Perfect Sampling of Subgraphs and Polymer Systems., , и . ACM Trans. Algorithms, 20 (1): 5:1-5:30 (января 2024)Combinatorics and complexity of guarding polygons with edge and point 2-transmitters., , , , и . Comput. Geom., (2018)