Peter Kling
YOU?
Author Swipe
View article: (Almost) Perfect Discrete Iterative Load Balancing
(Almost) Perfect Discrete Iterative Load Balancing Open
We consider discrete, iterative load balancing via matchings on arbitrary graphs. Initially each node holds a certain number of tokens, defining the load of the node, and the objective is to redistribute the tokens such that eventually eac…
View article: Scheduling with Calibrations for Multi-Interval Jobs
Scheduling with Calibrations for Multi-Interval Jobs Open
This paper studies a scheduling problem with machine calibrations for multi-interval jobs. More exactly, there are n (possibly weighted) jobs of unit size that must be scheduled on a single initially uncalibrated machine. The machine can p…
View article: Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility Open
In the general pattern formation (GPF) problem, a swarm of simple autonomous, disoriented robots must form a given pattern. The robots' simplicity imply a strong limitation: When the initial configuration is rotationally symmetric, only pa…
View article: Forming Large Patterns with Local Robots in the OBLOT Model
Forming Large Patterns with Local Robots in the OBLOT Model Open
In the arbitrary pattern formation problem, $n$ autonomous, mobile robots must form an arbitrary pattern $P \subseteq \mathbb{R}^2$. The (deterministic) robots are typically assumed to be indistinguishable, disoriented, and unable to commu…
View article: Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions Open
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, $n$ anonymous agents start each with one of $k$ opinions. Their goal is to agree on the initially most frequent opinion (the \emph{plurality op…
View article: Improved Scheduling with a Shared Resource
Improved Scheduling with a Shared Resource Open
We consider the following shared-resource scheduling problem: Given a set of jobs $J$, for each $j\in J$ we must schedule a job-specific processing volume of $v_j>0$. A total resource of $1$ is available at any time. Jobs have a resource r…
View article: Scheduling with a limited testing budget
Scheduling with a limited testing budget Open
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the…
View article: Multiphoton processes and higher resonances in the quantum regime of the free-electron laser
Multiphoton processes and higher resonances in the quantum regime of the free-electron laser Open
Despite exhibiting novel radiation features, the operation of the proposed quantum free-electron laser would have the drawback that the number of emitted photons is limited by one per electron, significantly reducing the output power of su…
View article: Moving Target Defense for Service-oriented Mission-critical Networks
Moving Target Defense for Service-oriented Mission-critical Networks Open
Modern mission-critical systems (MCS) are increasingly softwarized and interconnected. As a result, their complexity increased, and so their vulnerability against cyber-attacks. The current adoption of virtualization and service-oriented a…
View article: 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 Open
We consider a swarm of n robots in a d-dimensional Euclidean space. The robots are oblivious (no persistent memory), disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up to a constant dist…
View article: Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings Open
Scheduling with testing falls under the umbrella of the research on optimization with explorable uncertainty. In this model, each job has an upper limit on its processing time that can be decreased to a lower limit (possibly unknown) by so…
View article: Infinite Balanced Allocation via Finite Capacities
Infinite Balanced Allocation via Finite Capacities Open
We analyze the following infinite load balancing process, modeled as a classical balls-into-bins game: There are n bins (servers) with a limited capacity (buffer) of size c=c(n)∈N . Given a fixed arrival rate λ=λ(n)∈(0,1) , in every round …
View article: Fast Consensus via the Unconstrained Undecided State Dynamics
Fast Consensus via the Unconstrained Undecided State Dynamics Open
We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on …
View article: On Minimum Generalized Manhattan Connections
On Minimum Generalized Manhattan Connections Open
View article: On Greedily Packing Anchored Rectangles
On Greedily Packing Anchored Rectangles Open
Consider a set P of points in the unit square U = [1,0), one of them being the origin. For each point p ∈ P you may draw an axis-aligned rectangle in U with its lower-left corner being p. What is the maximum area such rectangles can cover …
View article: A Discrete and Continuous Study of the Max-Chain-Formation Problem
A Discrete and Continuous Study of the Max-Chain-Formation Problem Open
Most existing robot formation problems seek a target formation of a certain \emph{minimal} and, thus, efficient structure. Examples include the Gathering and the Chain-Formation problem. In this work, we study formation problems that try t…
View article: Optimal time and space leader election in population protocols
Optimal time and space leader election in population protocols Open
Full verions, including all proofs
View article: Tight & Simple Load Balancing
Tight & Simple Load Balancing Open
We consider the following load balancing process for m tokens distributed arbitrarily among n nodes connected by a complete graph. In each time step a pair of nodes is selected uniformly at random. Let ℓ 1 and ℓ 2 be their respective numbe…
View article: On the Complexity of Anchored Rectangle Packing
On the Complexity of Anchored Rectangle Packing Open
In the Anchored Rectangle Packing (ARP) problem, we are given a set of points P in the unit square [0,1]^2 and seek a maximum-area set of axis-aligned interior-disjoint rectangles S, each of which is anchored at a point p in P. In the most…
View article: A population protocol for exact majority with $O(\\log^{5/3} n)$ stabilization time and asymptotically optimal number of states.
A population protocol for exact majority with $O(\\log^{5/3} n)$ stabilization time and asymptotically optimal number of states. Open
A population protocol is a sequence of pairwise interactions of n agents. During one interaction, two randomly selected agents update their states by applying a deterministic transition function. The goal is to stabilize the system at a de…
View article: Simple Load Balancing
Simple Load Balancing Open
We consider the following load balancing process for $m$ tokens distributed arbitrarily among $n$ nodes connected by a complete graph: In each time step a pair of nodes is selected uniformly at random. Let $\ell_1$ and $\ell_2$ be their re…
View article: Majority & Stabilization in Population Protocols.
Majority & Stabilization in Population Protocols. Open
Population protocols are a distributed model focused on simplicity and robustness. A system of $n$ identical nodes must perform a global task like electing a unique leader or determining the majority opinion when each node has one of two o…
View article: Self-Stabilizing Balls and Bins in Batches
Self-Stabilizing Balls and Bins in Batches Open
This is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at: https://doi.org/10.1007/s00453-018-0411-z.
View article: Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs Open
International audience
View article: A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States Open
A population protocol is a sequence of pairwise interactions of n agents. During one interaction, two randomly selected agents update their states by applying a deterministic transition function. The goal is to stabilize the system at a de…
View article: Simple and Efficient Leader Election
Simple and Efficient Leader Election Open
We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on …
View article: Ignore or Comply?
Ignore or Comply? Open
In the Maximum Label Propagation Algorithm (Max-LPA), each vertex draws a distinct random label. In each subsequent round, each vertex updates its label to the label that is most frequent among its neighbours (including its own label), bre…
View article: Tight Load Balancing Via Randomized Local Search
Tight Load Balancing Via Randomized Local Search Open
We consider the following balls-into-bins process with $n$ bins and $m$ balls: each ball is equipped with a mutually independent exponential clock of rate 1. Whenever a ball's clock rings, the ball samples a random bin and moves there if t…
View article: Scheduling shared continuous resources on many-cores
Scheduling shared continuous resources on many-cores Open
View article: Ignore or Comply? On Breaking Symmetry in Consensus
Ignore or Comply? On Breaking Symmetry in Consensus Open
We study consensus processes on the complete graph of $n$ nodes. Initially, each node supports one from up to n opinions. Nodes randomly and in parallel sample the opinions of constant many nodes. Based on these samples, they use an update…