Adam Polak

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 52

Top Topics

Theoretical Guarantees

Top Venues

Publications

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. SODA (2024)
Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online coloring of short intervals. Eur. J. Comb. 118 (2024)
Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
On Dynamic Graph Algorithms with Predictions. SODA (2024)
Karl Bringmann, Anita Dürr, Adam Polak
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. CoRR (2024)
Nick Fischer, Piotr Kaliciak, Adam Polak
Deterministic 3SUM-Hardness. ITCS (2024)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms 19 (2) (2023)
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. CoRR (2023)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Mixing predictions for online metric algorithms. CoRR (2023)
Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
On Dynamic Graph Algorithms with Predictions. CoRR (2023)
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. SODA (2023)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. ICML (2023)
Bingbing Hu, Evangelos Kosinas, Adam Polak
Connectivity Oracles for Predictable Vertex Failures. CoRR (2023)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Mixing Predictions for Online Metric Algorithms. ICML (2023)
Tomasz Kociumaka, Adam Polak
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ESA (2023)
Nick Fischer, Piotr Kaliciak, Adam Polak
Deterministic 3SUM-Hardness. CoRR (2023)
Adam Polak
Bellman-Ford is optimal for shortest hop-bounded paths. CoRR (2022)
Adam Polak, Maksym Zub
Learning-Augmented Maximum Flow. CoRR (2022)
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. ICALP (2022)
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. CoRR (2022)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP (2022)
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. CoRR (2022)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. CoRR (2022)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS (2021)
Adam Polak, Adrian Siwiec, Michal Stobierski
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees. IPDPS (2021)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. CoRR (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. ICALP (2021)
Adam Polak, Adrian Siwiec, Michal Stobierski
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees. CoRR (2021)
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS (2021)
Jakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Zolna
Robust Learning-Augmented Caching: An Experimental Study. CoRR (2021)
Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP (2021)
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR (2021)
Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR (2021)
Jakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Tomasz Zolna
Robust Learning-Augmented Caching: An Experimental Study. ICML (2021)
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. CoRR (2020)
Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals. APPROX-RANDOM (2020)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR (2020)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions. CoRR (2020)
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems. SODA (2020)
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions. ICML (2020)
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. ITCS (2020)
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems. CoRR (2019)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica 81 (10) (2019)
Grzegorz Guspiel, Piotr Micek, Adam Polak
On an Extremal Problem for Poset Dimension. Order 35 (3) (2018)
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak, Joanna Sokól
Online Coloring of Short Intervals. CoRR (2018)
Adam Polak
) for Longest Common Weakly Increasing Subsequence? Inf. Process. Lett. 132 (2018)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. CoRR (2017)
Adam Polak
) for Longest Common Weakly Increasing Subsequence? CoRR (2017)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. IPEC (2017)
Grzegorz Guspiel, Piotr Micek, Adam Polak
On an extremal problem for poset dimension. CoRR (2017)
Adam Polak
Counting Triangles in Large Graphs on GPU. IPDPS Workshops (2016)
Adam Polak
Counting Triangles in Large Graphs on GPU. CoRR (2015)
Maciej Chociej, Adam Polak
Real Time Object Tracking on GPGPU. VISAPP (2) (2012)