6 Publications
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 20711
Monien B, Lorenz U, Warner D. Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In: Taschenbuch Der Algorithmen. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-76394-9_28
LibreCat
| DOI
6 Publications
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 20711
Monien B, Lorenz U, Warner D. Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In: Taschenbuch Der Algorithmen. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-76394-9_28
LibreCat
| DOI