4 citations · 10 across the 24 of their papers we have counts for
4 papers · 1 filter
Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas +1
We consider geometric problems on planar -point sets in the congested clique model. Initially, each node in the -clique network holds a batch of distinct points in the…
On Truly Parallel Time in Population Protocols
Artur Czumaj, Andrzej Lingas
The {\em parallel time} of a population protocol is defined as the average number of required interactions that an agent in the protocol participates, i.e., the quotient between th…
Efficient Assignment of Identities in Anonymous Populations
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos +1
We consider the fundamental problem of assigning distinct labels to agents in the probabilistic model of population protocols. Our protocols operate under the assumption that the s…
A fast parallel algorithm for minimum-cost small integral flows
Andrzej Lingas, Mia Persson
We present a new approach to the minimum-cost integral flow problem for small values of the flow. It reduces the problem to the tests of simple multi-variate polynomials over a fin…