All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2020)

An Efficient Noisy Binary Search in Graphs via Median Approximation. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (IWOCA, 2021)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (SODA, 2021)

Noisy searching: simple, fast and correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (CoRR, 2021)

Cardinality Estimation Using Gumbel Distribution. - Aleksander Lukasiewicz; Przemyslaw Uznanski (ESA, 2022)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. - Alexandra Lassota; Aleksander Lukasiewicz; Adam Polak 001 (ICALP, 2022)

Noisy (Binary) Searching: Simple, Fast and Correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (STACS, 2025)

SplineSketch: Even More Accurate Quantiles with Error Guarantees. - Aleksander Lukasiewicz; Jakub Tetek; Pavel Veselý 001 (CoRR, 2025)