Aleksander Łukasiewicz 个人学术档案

202020212022202320241 9 10 9 11

开放获取的出版物数量

2 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

Przemysław UznańskiPathway在 pathway.com 的电子邮件经过验证
Dariusz DereniowskiGdańsk University of Technology在 eti.pg.edu.pl 的电子邮件经过验证
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, Switzerland在 idsia.ch 的电子邮件经过验证
Nikos ParotsidisGoogle Research在 google.com 的电子邮件经过验证
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, Italy在 luiss.it 的电子邮件经过验证
Adam PolakBocconi University在 unibocconi.it 的电子邮件经过验证
Alexandra LassotaPostDoc at EPFL在 epfl.ch 的电子邮件经过验证

Aleksander Łukasiewicz

Institute of Computer Science, University of Wrocław

在 cs.uni.wroc.pl 的电子邮件经过验证


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
All-Pairs LCA in DAGs: Breaking through the O(n^2.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	16	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

系统目前无法执行此操作，请稍后再试。

文章 1–6

每年引用数