Peter Kling

Orcid: 0000-0003-0000-8689

According to our database1, Peter Kling authored at least 59 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Scheduling with a Limited Testing Budget.
CoRR, 2023

Moving Target Defense for Service-Oriented Mission-Critical Networks.
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.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Improved Scheduling with a Shared Resource.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
A discrete and continuous study of the Max-Chain-Formation problem.
Inf. Comput., 2022

Fast Consensus via the Unconstrained Undecided State Dynamics.
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.
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.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments.
Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

2021
Time-space trade-offs in population protocols for the majority problem.
Distributed Comput., 2021

On Minimum Generalized Manhattan Connections.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Infinite Balanced Allocation via Finite Capacities.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

On Greedily Packing Anchored Rectangles.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Optimal time and space leader election in population protocols.
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.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Improved Scheduling with a Shared Resource via Structural Insights.
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Continuous Protocols for Swarm Robotics.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Tight & Simple Load Balancing.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

On the Complexity of Anchored Rectangle Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Towards Efficient Reconstruction of Attacker Lateral Movement.
Proceedings of the 14th International Conference on Availability, Reliability and Security, 2019

2018
Scheduling shared continuous resources on many-cores.
J. Sched., 2018

Simple Load Balancing.
CoRR, 2018

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

Majority & Stabilization in Population Protocols.
CoRR, 2018

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

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Simple and Efficient Leader Election.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Continuous speed scaling with variability: A simple and direct approach.
Theor. Comput. Sci., 2017

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

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Ignore or Comply?: On Breaking Symmetry in Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Tight Load Balancing Via Randomized Local Search.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Towards the price of leasing online.
J. Comb. Optim., 2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches.
CoRR, 2016

Optimal Speed Scaling with a Solar Cell.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].
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.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Optimal Speed Scaling with a Solar Cell - (Extended Abstract).
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Profitable Scheduling on Multiple Speed-Scalable Processors.
ACM Trans. Parallel Comput., 2015

Linear and Competitive Strategies for Continuous Robot Formation Problems.
ACM Trans. Parallel Comput., 2015

On the Complexity of Speed Scaling.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Energy-efficient scheduling algorithms.
PhD thesis, 2014

Scheduling shared continuous resources on many-cores.
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.
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
CoRR, 2012

Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

An Algorithm for Online Facility Leasing.
Proceedings of the Structural Information and Communication Complexity, 2012

Basic Network Creation Games with Communication Interests.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Slow Down and Sleep for Profit in Online Deadline Scheduling.
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
CoRR, 2011

Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011


An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

A New Approach for Analyzing Convergence Algorithms for Mobile Robots.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2010


  Loading...