6 Publications
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 20711
Monien, Burkhard, et al. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_28.
LibreCat
| DOI
6 Publications
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 20711
Monien, Burkhard, et al. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_28.
LibreCat
| DOI