Follow
Adam Polak
Adam Polak
Bocconi University
Verified email at unibocconi.it - Homepage
Title
Cited by
Cited by
Year
Online metric algorithms with untrusted predictions
A Antoniadis, C Coester, M Eliáš, A Polak, B Simon
ACM Transactions on Algorithms 19 (2), 1-34, 2023
1672023
Counting triangles in large graphs on GPU
A Polak
2016 IEEE International Parallel and Distributed Processing Symposium …, 2016
542016
Knapsack and Subset Sum with Small Items
A Polak, L Rohwedder, K Węgrzycki
arXiv preprint arXiv:2105.04035, 2021
342021
Monochromatic triangles, intermediate matrix products, and convolutions
A Lincoln, A Polak, VV Williams
arXiv preprint arXiv:2009.14479, 2020
312020
Nearly-tight and oblivious algorithms for explainable clustering
B Gamlath, X Jia, A Polak, O Svensson
Advances in Neural Information Processing Systems 34, 28929-28939, 2021
252021
Faster monotone min-plus product, range mode, and single source replacement paths
Y Gu, A Polak, VV Williams, Y Xu
arXiv preprint arXiv:2105.02806, 2021
232021
Robust Learning-Augmented Caching: An Experimental Study
J Chłędowski, A Polak, B Szabucki, KT Żołna
International Conference on Machine Learning, 1920-1930, 2021
192021
Equivalences between triangle and range query problems
L Duraj, K Kleiner, A Polak, VV Williams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
192020
Paging with succinct predictions
A Antoniadis, J Boyar, M Eliás, LM Favrholdt, R Hoeksma, KS Larsen, ...
International Conference on Machine Learning, 952-968, 2023
182023
Learning-augmented dynamic power management with multiple states via new ski rental bounds
A Antoniadis, C Coester, M Eliás, A Polak, B Simon
Advances in Neural Information Processing Systems 34, 16714-16726, 2021
182021
Tight conditional lower bounds for longest common increasing subsequence
L Duraj, M Künnemann, A Polak
Algorithmica 81, 3968-3992, 2019
152019
Why is it hard to beat O(n^2) for Longest Common Weakly Increasing Subsequence?
A Polak
Information Processing Letters 132, 1-5, 2018
122018
Learning-augmented maximum flow
A Polak, M Zub
Information Processing Letters 186, 106487, 2024
112024
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
KM Klein, A Polak, L Rohwedder
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
112023
Mixing predictions for online metric algorithms
A Antoniadis, C Coester, M Eliás, A Polak, B Simon
International Conference on Machine Learning, 969-983, 2023
102023
On dynamic graph algorithms with predictions
J Brand, S Forster, Y Nazari, A Polak
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
92024
Parameterized algorithms for block-structured integer programs with large entries
J Cslovjecsek, M Koutecký, A Lassota, M Pilipczuk, A Polak
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
82024
Online coloring of short intervals
J Chybowska-Sokół, G Gutowski, K Junosza-Szaniawski, P Mikos, ...
European Journal of Combinatorics 118, 103919, 2024
7*2024
Bellman-Ford is optimal for shortest hop-bounded paths
T Kociumaka, A Polak
arXiv preprint arXiv:2211.07325, 2022
72022
Deterministic 3SUM-Hardness
N Fischer, P Kaliciak, A Polak
arXiv preprint arXiv:2310.12913, 2023
52023
The system can't perform the operation now. Try again later.
Articles 1–20