1 citations · 2 across the 3 of their papers we have counts for
5 papers
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
Alexandra Lassota, Aleksander Łukasiewicz, Adam Polak
We solve the Bin Packing problem in time, where is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the…
Noisy (Binary) Searching: Simple, Fast and Correct
Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
This work considers the problem of the noisy binary search in a sorted array. The noise is modeled by a parameter that dictates that a comparison can be incorrect with probabil…
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…
All-Pairs LCA in DAGs: Breaking through the barrier
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Łukasiewicz +2
Let be an -vertex directed acyclic graph (DAG). A lowest common ancestor (LCA) of two vertices and is a common ancestor of and such that no descend…
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…