Peter Kling
Peter Kling
About
Posts
Publications
Teaching
Contact
Light
Dark
Automatic
1
Moving Target Defense for Service-Oriented Mission-Critical Networks
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments
Fast Consensus via the Unconstrained Undecided State Dynamics
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions
Infinite Balanced Allocation via Finite Capacities
On Greedily Packing Anchored Rectangles
On Minimum Generalized Manhattan Connections
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up
»
Cite
×