Peter Kling

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

2023

Scheduling with a Limited Testing Budget.

[BibT_eX]

[DOI]

CoRR, 2023

Moving Target Defense for Service-Oriented Mission-Critical Networks.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Computer Communications and Networks, 2023

Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Improved Scheduling with a Shared Resource.

[BibT_eX]

[DOI]

Christoph Damerius

Florian Schneider

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

A discrete and continuous study of the Max-Chain-Formation problem.

[BibT_eX]

[DOI]

Jannik Castenow

Till Knollmann

Inf. Comput., 2022

Fast Consensus via the Unconstrained Undecided State Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

2021

Time-space trade-offs in population protocols for the majority problem.

[BibT_eX]

[DOI]

Distributed Comput., 2021

On Minimum Generalized Manhattan Connections.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Infinite Balanced Allocation via Finite Capacities.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

On Greedily Packing Anchored Rectangles.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Optimal time and space leader election in population protocols.

[BibT_eX]

[DOI]

George Giakkoupis

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up.

[BibT_eX]

[DOI]

Jannik Castenow

Till Knollmann

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.

[BibT_eX]

[DOI]

George Giakkoupis

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Improved Scheduling with a Shared Resource via Structural Insights.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Continuous Protocols for Swarm Robotics.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Tight & Simple Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

On the Complexity of Anchored Rectangle Packing.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Towards Efficient Reconstruction of Attacker Lateral Movement.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Availability, Reliability and Security, 2019

2018

Scheduling shared continuous resources on many-cores.

[BibT_eX]

[DOI]

Ernst Althaus

André Brinkmann

J. Sched., 2018

Simple Load Balancing.

[BibT_eX]

[DOI]

CoRR, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.

[BibT_eX]

[DOI]

CoRR, 2018

Majority & Stabilization in Population Protocols.

[BibT_eX]

[DOI]

CoRR, 2018

Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.

[BibT_eX]

[DOI]

Algorithmica, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Simple and Efficient Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.

[BibT_eX]

[DOI]

George Giakkoupis

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Continuous speed scaling with variability: A simple and direct approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules.

[BibT_eX]

[DOI]

Algorithmica, 2017

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Ignore or Comply?: On Breaking Symmetry in Consensus.

[BibT_eX]

[DOI]

Emanuele Natale

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Tight Load Balancing Via Randomized Local Search.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Towards the price of leasing online.

[BibT_eX]

[DOI]

Sebastian Abshoff

Christine Markarian

Peter Pietrzyk

J. Comb. Optim., 2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.

[BibT_eX]

[DOI]

CoRR, 2016

Self-stabilizing Balls & Bins in Batches.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Speed Scaling with a Solar Cell.

[BibT_eX]

[DOI]

CoRR, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].

[BibT_eX]

[DOI]

Christopher Wastell

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Optimal Speed Scaling with a Solar Cell - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Profitable Scheduling on Multiple Speed-Scalable Processors.

[BibT_eX]

[DOI]

Peter Pietrzyk

ACM Trans. Parallel Comput., 2015

Linear and Competitive Strategies for Continuous Robot Formation Problems.

[BibT_eX]

[DOI]

Bastian Degener

Barbara Kempkes

ACM Trans. Parallel Comput., 2015

On the Complexity of Speed Scaling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Energy-efficient scheduling algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2014

Scheduling shared continuous resources on many-cores.

[BibT_eX]

[DOI]

André Brinkmann

Sören Riechers

Tim Süß

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

On-The-Fly Computing: A novel paradigm for individualized IT services.

[BibT_eX]

[DOI]

Markus Happe

Marco Platzner

Christian Plessl

Proceedings of the 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, 2013

2012

Slow Down & Sleep for Profit in Online Deadline Scheduling

[BibT_eX]

[DOI]

CoRR, 2012

Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.

[BibT_eX]

[DOI]

Barbara Kempkes

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

An Algorithm for Online Facility Leasing.

[BibT_eX]

[DOI]

Peter Pietrzyk

Proceedings of the Structural Information and Communication Complexity, 2012

Basic Network Creation Games with Communication Interests.

[BibT_eX]

[DOI]

Martina Hüllmann

Alexander Setzer

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Slow Down and Sleep for Profit in Online Deadline Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

2011

A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model

[BibT_eX]

[DOI]

CoRR, 2011

Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Collisionless Gathering of Robots with an Extent.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.

[BibT_eX]

[DOI]

Joachim Gehweiler

Proceedings of the Parallel Processing and Applied Mathematics, 2011

A New Approach for Analyzing Convergence Algorithms for Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.

[BibT_eX]

[DOI]

Bastian Degener

Barbara Kempkes