Peter Kling

Latest

• Moving Target Defense for Service-oriented Mission-critical Networks
• Moving Target Defense for Service-Oriented Mission-Critical Networks
• Scheduling with a Limited Testing Budget
• Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings
• A discrete and continuous study of the Max-Chain-Formation problem
• A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
• 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
• Fast Consensus via the Unconstrained Undecided State Dynamics
• Infinite Balanced Allocation via Finite Capacities
• On Greedily Packing Anchored Rectangles
• On Greedily Packing Anchored Rectangles
• On Minimum Generalized Manhattan Connections
• Time-space trade-offs in population protocols for the majority problem
• A Discrete and Continuous Study of the Max-Chain-Formation Problem
• A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up
• A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
• Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
• Improved Scheduling with a Shared Resource via Structural Insights
• On Minimum Generalized Manhattan Connections
• Optimal time and space leader election in population protocols
• Continuous Protocols for Swarm Robotics
• On the Complexity of Anchored Rectangle Packing
• Tight & Simple Load Balancing
• Towards Efficient Reconstruction of Attacker Lateral Movement
• A population protocol for exact majority with O(log(^mbox5/3)n) stabilization time and asymptotically optimal number of states
• A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
• Majority & Stabilization in Population Protocols
• Scheduling shared continuous resources on many-cores
• Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins
• Simple and Efficient Leader Election
• Simple Load Balancing
• Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs
• Continuous speed scaling with variability: A simple and direct approach
• Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
• Ignore or Comply? On Breaking Symmetry in Consensus
• Ignore or Comply?: On Breaking Symmetry in Consensus
• Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource
• Tight Load Balancing via Randomized Local Search
• Tight Load Balancing Via Randomized Local Search
• Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time
• Optimal Speed Scaling with a Solar Cell
• Optimal Speed Scaling with a Solar Cell - (Extended Abstract)
• Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing
• Plurality Consensus via Shuffling: Lessons Learned from Load Balancing
• Self-stabilizing Balls & Bins in Batches
• Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]
• Towards the price of leasing online
• Linear and Competitive Strategies for Continuous Robot Formation Problems
• On the Complexity of Speed Scaling
• Profitable Scheduling on Multiple Speed-Scalable Processors
• Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
• Energy-efficient scheduling algorithms
• Scheduling shared continuous resources on many-cores
• On-The-Fly Computing: A novel paradigm for individualized IT services
• Profitable scheduling on multiple speed-scalable processors
• An Algorithm for Online Facility Leasing
• Basic Network Creation Games with Communication Interests
• Basic Network Creation Games with Communication Interests
• Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
• Profitable Scheduling on Multiple Speed-Scalable Processors
• Slow Down & Sleep for Profit in Online Deadline Scheduling
• Slow Down and Sleep for Profit in Online Deadline Scheduling
• A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment
• Collisionless Gathering of Robots with an Extent
• Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed
• A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots