Aleksander Lukasiewicz

collaborators

3 papers

cs.DS2020

Cardinality estimation using Gumbel distribution

Aleksander Łukasiewicz, Przemysław Uznański

Cardinality estimation is the task of approximating the number of distinct elements in a large dataset with possibly repeating elements. LogLog and HyperLogLog (c.f. Durand and Fla…

cs.DS2020

All-Pairs LCA in DAGs: Breaking through the $O (n^{2.5})$ barrier

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Łukasiewicz +2

Let $G = (V, E)$ be an $n$ -vertex directed acyclic graph (DAG). A lowest common ancestor (LCA) of two vertices $u$ and $v$ is a common ancestor $w$ of $u$ and $v$ such that no descend…

cs.DS2020

An Efficient Noisy Binary Search in Graphs via Median Approximation

Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański

Consider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a…

Cardinality estimation using Gumbel distribution

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier

An Efficient Noisy Binary Search in Graphs via Median Approximation

All-Pairs LCA in DAGs: Breaking through the $O (n^{2.5})$ barrier