10 citations · 43 across the 22 of their papers we have counts for
4 papers · 1 filter
Ergodic Effects in Token Circulation
Adrian Kosowski, Przemysław Uznański
We consider a dynamical process in a network which distributes all particles (tokens) located at a node among its neighbors, in a round-robin manner. We show that in the recurrent…
A note on distance labeling in planar graphs
Paweł Gawrychowski, Przemysław Uznański
A distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their label…
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Paweł Gawrychowski, Oleg Merkurev, Arseny M. Shur +1
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-one and we do not have random access to the input. While computing the answer exa…
Randomized algorithms for finding a majority element
Paweł Gawrychowski, Jukka Suomela, Przemysław Uznański
Given colored balls, we want to detect if more than of them have the same color, and if so find one ball with such majority color. We are only allowed to c…