Till Knollmann

Algorithmen und Komplexität / Heinz Nixdorf Institut
till.knollmann@uni-paderborn.de
ID
39241

19 Publications

Mark all

[19]
2022 | Journal Article | LibreCat-ID: 29843
A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat | DOI
 
[18]
2022 | Conference Paper | LibreCat-ID: 31847
The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.
LibreCat | DOI | arXiv
 
[17]
2022 | Journal Article | LibreCat-ID: 31479
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
LibreCat | DOI
 
[16]
2022 | Journal Article | LibreCat-ID: 33947
Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science (2022).
LibreCat | DOI | arXiv
 
[15]
2022 | Conference Paper | LibreCat-ID: 34008
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility
J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: 26th International Conference on Principles of Distributed Systems (OPODIS) (Accepted), n.d.
LibreCat | arXiv
 
[14]
2021 | Journal Article | LibreCat-ID: 21096
A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2021).
LibreCat | DOI
 
[13]
2021 | Conference Paper | LibreCat-ID: 23730
Gathering a Euclidean Closed Chain of Robots in Linear Time
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.
LibreCat | DOI | arXiv
 
[12]
2021 | Journal Article | LibreCat-ID: 20683
Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.
LibreCat | DOI
 
[11]
2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
 
[10]
2020 | Conference Paper | LibreCat-ID: 19899
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.
LibreCat | DOI | arXiv
 
[9]
2020 | Conference Paper | LibreCat-ID: 20159
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.
LibreCat | DOI
 
[8]
2020 | Conference Paper | LibreCat-ID: 20185
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.
LibreCat | DOI | arXiv
 
[7]
2020 | Conference Paper | LibreCat-ID: 17370
The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[6]
2020 | Conference Paper | LibreCat-ID: 17371
Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[5]
2019 | Conference Paper | LibreCat-ID: 12870
Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.
LibreCat | DOI | arXiv
 
[4]
2018 | Conference Paper | LibreCat-ID: 4411
A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.
LibreCat | Files available | DOI | arXiv
 
[3]
2018 | Conference Paper | LibreCat-ID: 4375
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat | Files available | DOI
 
[2]
2017 | Book Chapter | LibreCat-ID: 16461
Monitoring of Domain-Related Problems in Distributed Data Streams
P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.
LibreCat | DOI | arXiv
 
[1]
2015 | Bachelorsthesis | LibreCat-ID: 18024
Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix
T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

19 Publications

Mark all

[19]
2022 | Journal Article | LibreCat-ID: 29843
A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat | DOI
 
[18]
2022 | Conference Paper | LibreCat-ID: 31847
The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.
LibreCat | DOI | arXiv
 
[17]
2022 | Journal Article | LibreCat-ID: 31479
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
LibreCat | DOI
 
[16]
2022 | Journal Article | LibreCat-ID: 33947
Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science (2022).
LibreCat | DOI | arXiv
 
[15]
2022 | Conference Paper | LibreCat-ID: 34008
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility
J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: 26th International Conference on Principles of Distributed Systems (OPODIS) (Accepted), n.d.
LibreCat | arXiv
 
[14]
2021 | Journal Article | LibreCat-ID: 21096
A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2021).
LibreCat | DOI
 
[13]
2021 | Conference Paper | LibreCat-ID: 23730
Gathering a Euclidean Closed Chain of Robots in Linear Time
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.
LibreCat | DOI | arXiv
 
[12]
2021 | Journal Article | LibreCat-ID: 20683
Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.
LibreCat | DOI
 
[11]
2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
 
[10]
2020 | Conference Paper | LibreCat-ID: 19899
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.
LibreCat | DOI | arXiv
 
[9]
2020 | Conference Paper | LibreCat-ID: 20159
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.
LibreCat | DOI
 
[8]
2020 | Conference Paper | LibreCat-ID: 20185
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.
LibreCat | DOI | arXiv
 
[7]
2020 | Conference Paper | LibreCat-ID: 17370
The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[6]
2020 | Conference Paper | LibreCat-ID: 17371
Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[5]
2019 | Conference Paper | LibreCat-ID: 12870
Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.
LibreCat | DOI | arXiv
 
[4]
2018 | Conference Paper | LibreCat-ID: 4411
A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.
LibreCat | Files available | DOI | arXiv
 
[3]
2018 | Conference Paper | LibreCat-ID: 4375
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat | Files available | DOI
 
[2]
2017 | Book Chapter | LibreCat-ID: 16461
Monitoring of Domain-Related Problems in Distributed Data Streams
P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.
LibreCat | DOI | arXiv
 
[1]
2015 | Bachelorsthesis | LibreCat-ID: 18024
Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix
T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed