Till Knollmann's Personal Website

About Me

My name is Till Knollmann. I am both professionally and privately passionate about software development with a background in theoretical computer science.

After completing my bachelor's and master's degree in computer science at the Paderborn University, I earned my doctoral degree in the Algorithms and Complexity research group at the Heinz Nixdorf Institut. My research focus was on online algorithms that manage heterogeneous resources and cost-effectively answer requests for them. I also worked on distributed data structures, flow problems, and theoretical robot models. My main activities involved the mathematical modeling of problems as well as the development and analysis of algorithms.

Since July 2023, I work as a software developer at WPS Management GmbH. As part of an agile team, my focus is on the backend development of a microservice architecture based on Spring Boot.

Also in my spare time I like to engage technological topics like development in Java, C#, Python and Rust, tools like Docker, Kubernetes and cloud solutions, or approaches like machine learning. Additionally, I have been eagerly competing in the Advent of Code for the past two years and published my solutions on GitHub.

Both the theoretical and practical sides of computer science fascinate me and delight me. Do you feel the same way? Then feel free to connect with me on LinkedIn or GitHub, or contact me by email.

My Publications

During my doctoral studies, I published the following results:

[7]
2023 | Dissertation
Online Algorithms for Allocating Heterogeneous Resources
T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
DOI
 
[6]
2023 | Book Chapter
Capabilities and Limitations of Local Strategies in Dynamic Networks
T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: On-The-Fly Computing — Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.
DOI
 
[5]
2022 | Conference Paper
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 (SPAA), 2022, pp. 345–356.
DOI | arXiv
 
[4]
2022 | Journal Article
A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2022).
DOI
 
[3]
2020 | Conference Paper
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 (SPAA), 2020.
DOI | arXiv
 
[2]
2018 | Conference Paper
A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018.
DOI | arXiv
 
[1]
2018 | Conference Paper
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.
DOI
 

[14]
2023 | Book Chapter
Distributed Data Streams
J. Castenow, B. Feldkord, J. Hanselle, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Algorithms for Big Data. Lecture Notes in Computer Science, vol 13201, Springer, 2023, pp. 179–-195.
DOI
 
[13]
2023 | Journal Article
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 939 (2023) 261–291.
DOI | arXiv
 
[12]
2023 | Conference Paper
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: Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS), 2023, p. 15:1–15:25.
DOI | arXiv
 
[11]
2022 | Journal Article
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).
DOI
 
[10]
2022 | Journal Article
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
DOI
 
[9]
2021 | Conference Paper
Gathering a Euclidean Closed Chain of Robots in Linear Time
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2021, pp. 29–44.
DOI | arXiv
 
[8]
2021 | Journal Article
Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.
DOI
 
[7]
2021 | Conference Paper
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: Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2021, pp. 289–304.
DOI | arXiv
 
[6]
2020 | Conference Paper
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 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2020, pp. 65–80.
DOI | arXiv
 
[5]
2020 | Conference Paper
Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, in: Proceedings of the 28th Annual European Symposium on Algorithms (ESA), 2020, pp. 12:1-12:14.
DOI
 
[4]
2020 | Conference Paper
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: Proceedings of the 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2020, pp. 60–64.
DOI | arXiv
 
[3]
2020 | Conference Paper
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 (SPAA), 2020.
DOI | arXiv
 
[2]
2019 | Conference Paper
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), 2019, pp. 120–137.
DOI | arXiv
 
[1]
2017 | Book Chapter
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 (SIROCCO), 2017.
DOI | arXiv
 

Contact Me

If you would like to get in touch with me, feel free to use the form below or connect with me via LinkedIn. I am looking forward to your message.