Adam Polak

According to our database, Adam Polak authored at least 29 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized algorithms for block-structured integer programs with large entries.

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On Dynamic Graph Algorithms with Predictions.

Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Deterministic 3SUM-Hardness.

Nick Fischer, Piotr Kaliciak, Adam Polak

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Online Metric Algorithms with Untrusted Predictions.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

ACM Trans. Algorithms, April, 2023

Connectivity Oracles for Predictable Vertex Failures.

Bingbing Hu, Evangelos Kosinas, Adam Polak

CoRR, 2023

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.

Kim-Manuel Klein, Adam Polak, Lars Rohwedder

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Mixing Predictions for Online Metric Algorithms.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

Paging with Succinct Predictions.

Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths.

Tomasz Kociumaka, Adam Polak

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Bellman-Ford is optimal for shortest hop-bounded paths.

Adam Polak

CoRR, 2022

Learning-Augmented Maximum Flow.

Adam Polak, Maksym Zub

CoRR, 2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.

Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost.

Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Nearly-Tight and Oblivious Algorithms for Explainable Clustering.

Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees.

Adam Polak, Adrian Siwiec, Michal Stobierski

Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

Robust Learning-Augmented Caching: An Experimental Study.

Jakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Tomasz Zolna

Proceedings of the 38th International Conference on Machine Learning, 2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths.

Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Knapsack and Subset Sum with Small Items.

Adam Polak, Lars Rohwedder, Karol Wegrzycki

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Algorithms and Lower Bounds for the Worker-Task Assignment Problem.

Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein

CoRR, 2020

Equivalences between triangle and range query problems.

Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Monochromatic Triangles, Intermediate Matrix Products, and Convolutions.

Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Online Coloring of Short Intervals.

Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak

Proceedings of the Approximation, 2020

2019

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.

Lech Duraj, Marvin Künnemann, Adam Polak

Algorithmica, 2019

2018

On an Extremal Problem for Poset Dimension.

Grzegorz Guspiel, Piotr Micek, Adam Polak

Order, 2018

Why is it hard to beat <i>O</i>(<i>n</i>²) for Longest Common Weakly Increasing Subsequence?

Adam Polak

Inf. Process. Lett., 2018

2017

Why is it hard to beat O(n²) for Longest Common Weakly Increasing Subsequence?

Adam Polak

CoRR, 2017

2016

Counting Triangles in Large Graphs on GPU.

Adam Polak

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

2012

Real Time Object Tracking on GPGPU.

Maciej Chociej, Adam Polak

Proceedings of the VISAPP 2012, 2012