22 Publikationen

2023 | Zeitschriftenaufsatz | LibreCat-ID: 33947
Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031
LibreCat | DOI | arXiv
 
2023 | Konferenzbeitrag | LibreCat-ID: 34008
Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) . Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15
LibreCat | DOI | arXiv
 
2023 | Sammelwerksbeitrag | LibreCat-ID: 44769
Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1
LibreCat | DOI
 
2023 | Dissertation | LibreCat-ID: 45580
Castenow J. Local Protocols for Contracting and Expanding Robot Formation Problems.; 2023. doi:10.17619/UNIPB/1-1750
LibreCat | DOI
 
2022 | Zeitschriftenaufsatz | LibreCat-ID: 29843
Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation. Published online 2022. doi:10.1016/j.ic.2022.104877
LibreCat | DOI
 
2022 | Konferenzbeitrag | LibreCat-ID: 31847
Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2022:345-356. doi:10.1145/3490148.3538595
LibreCat | DOI | arXiv
 
2021 | Konferenzbeitrag | LibreCat-ID: 23730
Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R, Radzik T, eds. Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS. Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3
LibreCat | DOI | arXiv
 
2021 | Konferenzbeitrag | LibreCat-ID: 26986
Castenow J, Götte T, Knollmann T, Meyer auf der Heide F. The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller EM, Schmid S, eds. Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021. Vol 13046. LNCS. Springer; 2021:289-304. doi:10.1007/978-3-030-91081-5_19
LibreCat | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 19899
Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:10.1007/978-3-030-64348-5_6
LibreCat | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 20185
Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5
LibreCat | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 17370
Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281
LibreCat | Dateien verfügbar | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 17371
Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400263
LibreCat | Dateien verfügbar | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 16968
Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots in Three Dimensions. In: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer; 2020. doi:10.1007/978-3-030-54921-3_4
LibreCat | Dateien verfügbar | DOI | arXiv
 
2020 | Konferenzbeitrag | LibreCat-ID: 15169
Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.
LibreCat
 
2020 | Zeitschriftenaufsatz | LibreCat-ID: 16299
Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018
LibreCat | DOI
 
2019 | Konferenzbeitrag | LibreCat-ID: 14539
Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26
LibreCat | DOI
 
2018 | Konferenzbeitrag | LibreCat-ID: 4563
Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.
LibreCat | Dateien verfügbar
 
2018 | Konferenzbeitrag | LibreCat-ID: 4565
Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663
LibreCat | Dateien verfügbar | DOI
 
2018 | Konferenzbeitrag | LibreCat-ID: 4375
Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4
LibreCat | Dateien verfügbar | DOI
 
2017 | Masterarbeit | LibreCat-ID: 699
Sundermeier J. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn; 2017.
LibreCat
 
2017 | Sammelwerksbeitrag | LibreCat-ID: 16461
Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: Structural Information and Communication Complexity. ; 2017. doi:10.1007/978-3-319-72050-0_13
LibreCat | DOI | arXiv
 
2015 | Bachelorarbeit | LibreCat-ID: 18006
Sundermeier J. Implementierung Eines Selbststabilisierenden Verteilten Stacks. Universität Paderborn; 2015.
LibreCat
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: AMA

Export