Real Time Object Tracking on GPGPU. - Maciej Chociej; Adam Polak 001 (VISAPP (2), 2012)

Counting Triangles in Large Graphs on GPU. - Adam Polak 001 (IPDPS Workshops, 2016)

Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence? - Adam Polak 001 (CoRR, 2017)

Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence? - Adam Polak 001 (Inf. Process. Lett., 2018)

On an Extremal Problem for Poset Dimension. - Grzegorz Guspiel; Piotr Micek; Adam Polak 001 (Order, 2018)

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. - Lech Duraj; Marvin Künnemann; Adam Polak 001 (Algorithmica, 2019)

Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. - Andrea Lincoln; Adam Polak 001; Virginia Vassilevska Williams (ITCS, 2020)

Equivalences between triangle and range query problems. - Lech Duraj; Krzysztof Kleiner; Adam Polak 001; Virginia Vassilevska Williams (SODA, 2020)

Algorithms and Lower Bounds for the Worker-Task Assignment Problem. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (CoRR, 2020)

Knapsack and Subset Sum with Small Items. - Adam Polak 001; Lars Rohwedder; Karol Wegrzycki (ICALP, 2021)

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. - Yuzhou Gu; Adam Polak 001; Virginia Vassilevska Williams; Yinzhan Xu (ICALP, 2021)

Robust Learning-Augmented Caching: An Experimental Study. - Jakub Chledowski; Adam Polak 001; Bartosz Szabucki; Konrad Tomasz Zolna (ICML, 2021)

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees. - Adam Polak 001; Adrian Siwiec; Michal Stobierski (IPDPS, 2021)

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (NeurIPS, 2021)

Nearly-Tight and Oblivious Algorithms for Explainable Clustering. - Buddhima Gamlath; Xinrui Jia 001; Adam Polak 001; Ola Svensson (NeurIPS, 2021)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (ICALP, 2022)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. - Alexandra Lassota; Aleksander Lukasiewicz; Adam Polak 001 (ICALP, 2022)

Bellman-Ford is optimal for shortest hop-bounded paths. - Adam Polak 001 (CoRR, 2022)

Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. - Tomasz Kociumaka; Adam Polak 001 (ESA, 2023)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Mixing Predictions for Online Metric Algorithms. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. - Kim-Manuel Klein; Adam Polak 001; Lars Rohwedder (SODA, 2023)

Online Metric Algorithms with Untrusted Predictions. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ACM Trans. Algorithms, 2023)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. - Karl Bringmann; Anita Dürr; Adam Polak 001 (ESA, 2024)

Connectivity Oracles for Predictable Vertex Failures. - Bingbing Hu; Evangelos Kosinas; Adam Polak 001 (ESA, 2024)

Deterministic 3SUM-Hardness. - Nick Fischer; Piotr Kaliciak; Adam Polak 001 (ITCS, 2024)

On Dynamic Graph Algorithms with Predictions. - Jan van den Brand; Sebastian Forster; Yasamin Nazari; Adam Polak 001 (SODA, 2024)

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. - Bingbing Hu; Adam Polak 001 (CoRR, 2024)

Online coloring of short intervals. - Joanna Chybowska-Sokól; Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Patryk Mikos; Adam Polak 001 (Eur. J. Comb., 2024)

Learning-augmented maximum flow. - Adam Polak 001; Maksym Zub (Inf. Process. Lett., 2024)

Approximation algorithms for combinatorial optimization with predictions. - Antonios Antoniadis 001; Marek Eliás 001; Adam Polak 001; Moritz Venzin (ICLR, 2025)

3SUM in Preprocessed Universes: Faster and Simpler. - Shashwat Kasliwal; Adam Polak 001; Pratyush Sharma (SOSA, 2025)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. - Jakob Nogler; Adam Polak 001; Barna Saha; Virginia Vassilevska Williams; Yinzhan Xu; Christopher Ye 001 (STOC, 2025)

The Planted Orthogonal Vectors Problem. - David Kühnemann; Adam Polak 001; Alon Rosen (IACR Cryptol. ePrint Arch., 2025)

Parameterized algorithms for block-structured integer programs with large entries. - Jana Cslovjecsek; Martin Koutecký; Alexandra Lassota; Michal Pilipczuk; Adam Polak 001 (TheoretiCS, 2025)