Daniel Warner

Theorie verteilter Systeme
Sonderforschungsbereich 901
dwarner@uni-paderborn.de
ID
3902

7 Publications

Mark all

[7]
2024 | Journal Article | LibreCat-ID: 55379
Padalkin, A., Scheideler, C., & Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. Natural Computing. https://doi.org/10.1007/s11047-024-09981-6
LibreCat | DOI
 
[6]
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
LibreCat | DOI
 
[5]
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.9
LibreCat | DOI
 
[4]
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.23
LibreCat | DOI
 
[3]
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_15
LibreCat | DOI
 
[2]
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52
LibreCat | DOI
 
[1]
2008 | Book Chapter | LibreCat-ID: 20711
Monien, B., Lorenz, U., & Warner, D. (2008). Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In Taschenbuch der Algorithmen. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_28
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

7 Publications

Mark all

[7]
2024 | Journal Article | LibreCat-ID: 55379
Padalkin, A., Scheideler, C., & Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. Natural Computing. https://doi.org/10.1007/s11047-024-09981-6
LibreCat | DOI
 
[6]
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
LibreCat | DOI
 
[5]
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.9
LibreCat | DOI
 
[4]
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.23
LibreCat | DOI
 
[3]
2011 | Book Chapter | LibreCat-ID: 20709
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_15
LibreCat | DOI
 
[2]
2011 | Book Chapter | LibreCat-ID: 20710
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52
LibreCat | DOI
 
[1]
2008 | Book Chapter | LibreCat-ID: 20711
Monien, B., Lorenz, U., & Warner, D. (2008). Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In Taschenbuch der Algorithmen. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_28
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed