**Project: Stochastic SOPS**

## Publications

### Refereed Journal Papers

- A stochastic approach to shortcut bridging in programmable matter. Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa.
*Natural Computing*, pp. 1-19, 2018. [Full Text]

### Refereed Conference Proceedings

- [In Preparation] A local stochastic algorithm for separation in heterogeneous self-organizing particle systems. Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, and Andréa W. Richa.
- Brief Announcement: A local stochastic algorithm for separation in heterogeneous self-organizing particle systems. Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, and Andréa W. Richa. In
*Proceedings of the 2018 ACM Principles of Distributed Computing (PODC ’18),*pp. 483-485, 2018. - A stochastic approach to shortcut bridging in programmable matter. Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa. In
*DNA Computing and Molecular Programming — 23rd International Conference (DNA23)*, pp. 122-138, 2017. [Simulation] - A Markov chain algorithm for compression in self-organizing particle systems. Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa. In
*Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC ’16)*, pp. 279-288, 2016. [Simulation]

## Presentations

### Invited Talks

- Self-Organizing Particle Systems: an Algorithmic Approach to Programmable Matter. Joshua J. Daymude.
*2nd Workshop on Self-Organization in Swarm of Robots (WSSR ’18)*, Tokyo, Japan. November 4, 2018. - Algorithmic Foundations of Programmable Matter. Andréa W. Richa. Keynote talk at
*Latin American Theoretical Informatics 2018 (LATIN ’18)*, Buenos Aires, Argentina. April 17, 2018.

### Conference Talks

- Separation in Heterogeneous Self-Organizing Particle Systems. Andréa W. Richa.
*ACM Symposium on Principles of Distributed Computing (PODC ’18)*, London, UK. July 26, 2018. - Local Stochastic Algorithms for Compression and Shortcut Bridging in Programmable Matter. Andréa W. Richa.
*Joint Mathematics Meetings (JMM ’18) Special Session on Emergent Phenomena in Discrete Models,*San Diego, CA, USA. January 12, 2018. - A Stochastic Approach to Shortcut Bridging in Programmable Matter. Sarah Cannon.
*DNA Computing and Molecular Programming – 23rd International Conference (DNA23)*, Austin, TX, USA. September 26, 2017. - A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Sarah Cannon.
*ACM Symposium on Principles of Distributed Computing (PODC ’16)*, Chicago, IL, USA. July 27, 2016.

### Poster Presentations

- Self-Organizing Particle Systems: an Abstraction of Programmable Matter. Joshua J. Daymude.
*Achievement Rewards for College Scientists (ARCS) Awards Dinner 2018*, Phoenix, AZ, USA. April 20, 2018. - A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. (Best Poster Presentation Award). Cem Gokmen.
*Georgia Tech Undergraduate Research Spring Symposium*, Atlanta, GA, USA. April 17, 2018. - Compression and Shortcut Bridging in Self-Organizing Particle Systems. Joshua J. Daymude.
*Google PhD Intern Research Conference (PIRC ’17)*, Mountain View, CA, USA. July 2017. - Compression in Self-Organizing Particle Systems. Joshua J. Daymude.
*Barrett Celebrating Honors Symposium (BCHS ’16)*, Tempe, AZ, USA. April 12, 2016.

### Other Presentations

- Self-Organizing Particle Systems (SOPS). Andréa W. Richa. Tutorial at
*Dagstuhl Seminar 18331: Algorithmic Foundations of Programmable Matter*, Schloss Dagstuhl, Germany. August 16, 2018. - Separation in Heterogeneous Programmable Matter. Andréa W. Richa.
*Biological Distributed Algorithms (BDA ’18)*, London, UK. July 23, 2018. - A Stochastic Approach to Shortcut Bridging in Programmable Matter. Joshua J. Daymude.
*Algorithms, Combinatorics, and Optimization (ACO) Student Seminar*, Atlanta, GA, USA. October 6, 2017. - Local Stochastic Algorithms for Compression and Shortcut Bridging in Programmable Matter. Joshua J. Daymude.
*Biological Distributed Algorithms (BDA ’17),*Washington D.C., USA. July 28, 2017. - A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Sarah Cannon.
*Achievement Rewards for College Scientists (ARCS)*, Atlanta, GA, USA. October 17, 2016. - A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Sarah Cannon.
*Algorithms, Combinatorics, and Optimization (ACO) Student Seminar*, Atlanta, GA, USA. September 16, 2016. - A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Sarah Cannon.
*China Theory Week 2016,*Hong Kong, China. August 25, 2016. - A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Sarah Cannon.
*Dagstuhl Seminar 16271*, Dagstuhl, Germany. July 4-8, 2016.

## People

### Current Team

### Past Members

#### Marta Andrés Arroyo

Undergraduate Researcher, University of Granada

[Website]## Funding

- Algorithms in the Field: Collaborative Research: A Distributed and Stochastic Algorithmic Framework for Active Matter. NSF CCF (Division of Computing and Communication Foundations): Algorithmic Foundations Award #1637031. Sept. 2016 – Aug. 2018 (estimated).
- Algorithms in the Field: Collaborative Research: A Distributed and Stochastic Algorithmic Framework for Active Matter. NSF CCF (Division of Computing and Communication Foundations): Algorithmic Foundations Award #1637393. Sept. 2016 – Aug. 2018 (estimated).
- Algorithms in the Field: Collaborative Research: Distributed and Stochastic Algorithms for Active Matter: Theory and Practice. NSF CCF (Division of Computing and Communication Foundations): Algorithmic Foundations Award #1733680. Jan. 2018 – Dec. 2020 (estimated).
- Algorithms in the Field: Collaborative Research: Distributed and Stochastic Algorithms for Active Matter: Theory and Practice. NSF CCF (Division of Computing and Communication Foundations): Algorithmic Foundations Award #1733812. Jan. 2018 – Dec. 2020 (estimated).