10 citations · 43 across the 22 of their papers we have counts for
4 papers · 1 filter
Approximating Approximate Pattern Matching
Jan Studený, Przemysław Uznański
Given a text of length and a pattern of length , the approximate pattern matching problem asks for computation of a particular \emph{distance} function between a…
Faster Algorithms for All-Pairs Bounded Min-Cuts
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano +5
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum - cut (or just its value) for all pairs of vertices . We study this problem in directed…
Almost logarithmic-time space optimal leader election in population protocols
Leszek Gąsieniec, Grzegorz Stachowiak, Przemysław Uznański
The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\em agents}. The agents communicate and perform computation…
Faster Approximate(d) Text-to-Pattern L1 Distance
Przemysław Uznański
The problem of finding \emph{distance} between \emph{pattern} of length and \emph{text} of length is a typical way of generalizing pattern matching to incorporate dissimila…