Aleksander Lukasiewicz

According to our database, Aleksander Lukasiewicz authored at least 8 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

SplineSketch: Even More Accurate Quantiles with Error Guarantees.

Aleksander Lukasiewicz, Jakub Tetek, Pavel Veselý

CoRR, April, 2025

Noisy (Binary) Searching: Simple, Fast and Correct.

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.

Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Cardinality Estimation Using Gumbel Distribution.

Aleksander Lukasiewicz, Przemyslaw Uznanski

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Noisy searching: simple, fast and correct.

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski

CoRR, 2021

All-Pairs LCA in DAGs: Breaking through the <i>O</i>(<i>n</i>^2.5) barrier.

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

An Efficient Noisy Binary Search in Graphs via Median Approximation.

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

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

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2020