All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier F Grandoni, GF Italian, A ¨©ukasiewicz, N Parotsidis, P Uznański Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ¡¦, 2021 | 17 | 2021 |
An efficient noisy binary search in graphs via median approximation D Dereniowski, A ¨©ukasiewicz, P Uznański Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa ¡¦, 2021 | 11 | 2021 |
Noisy searching: simple, fast and correct D Dereniowski, A ¨©ukasiewicz, P Uznański arXiv preprint arXiv:2107.05753, 2021 | 8 | 2021 |
Cardinality estimation using Gumbel distribution A ¨©ukasiewicz, P Uznański arXiv preprint arXiv:2008.07590, 2020 | 3 | 2020 |
Tight vector bin packing with few small items via fast exact matching in multigraphs A Lassota, A ¨©ukasiewicz, A Polak arXiv preprint arXiv:2203.10077, 2022 | 2 | 2022 |
Intermediate complexity problems–new upper and lower bounds A ¨©ukasiewicz | | |