Æȷοì
Aleksander ¨©ukasiewicz
Aleksander ¨©ukasiewicz
Institute of Computer Science, University of Wroc©©aw
cs.uni.wroc.plÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
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
172021
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
112021
Noisy searching: simple, fast and correct
D Dereniowski, A ¨©ukasiewicz, P Uznański
arXiv preprint arXiv:2107.05753, 2021
82021
Cardinality estimation using Gumbel distribution
A ¨©ukasiewicz, P Uznański
arXiv preprint arXiv:2008.07590, 2020
32020
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
22022
Intermediate complexity problems–new upper and lower bounds
A ¨©ukasiewicz
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–6