Adam Polak - RankMe

69 papers A* 16A 8B 1Journal 40Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	3SUM in Preprocessed Universes: Faster and Simpler. SOSA Shashwat Kasliwal, Adam Polak, Pratyush Sharma
2025	J	`jnl`	3SUM in Preprocessed Universes: Faster and Simpler. TheoretiCS Shashwat Kasliwal, Adam Polak, Pratyush Sharma
2025	A*	`conf`	Approximation algorithms for combinatorial optimization with predictions. ICLR Antonios Antoniadis, Marek Eliás, Adam Polak, Moritz Venzin
2025	A*	`conf`	Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. STOC Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye
2025	A	`conf`	Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. ESA Bingbing Hu, Adam Polak
2025	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. TheoretiCS Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2025	A	`conf`	The Planted Orthogonal Vectors Problem. ESA David Kühnemann, Adam Polak, Alon Rosen
2025	J	`jnl`	The Planted Orthogonal Vectors Problem. CoRR David Kühnemann, Adam Polak, Alon Rosen
2025	J	`jnl`	The Planted Orthogonal Vectors Problem. IACR Cryptol. ePrint Arch. David Kühnemann, Adam Polak, Alon Rosen
2024	J	`jnl`	3SUM in Preprocessed Universes: Faster and Simpler. CoRR Shashwat Kasliwal, Adam Polak, Pratyush Sharma
2024	J	`jnl`	Approximation Algorithms for Combinatorial Optimization with Predictions. CoRR Antonios Antoniadis, Marek Eliás, Adam Polak, Moritz Venzin
2024	A	`conf`	Connectivity Oracles for Predictable Vertex Failures. ESA Bingbing Hu, Evangelos Kosinas, Adam Polak
2024	A	`conf`	Deterministic 3SUM-Hardness. ITCS Nick Fischer, Piotr Kaliciak, Adam Polak
2024	A	`conf`	Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. ESA Karl Bringmann, Anita Dürr, Adam Polak
2024	J	`jnl`	Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. CoRR Karl Bringmann, Anita Dürr, Adam Polak
2024	J	`jnl`	Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. CoRR Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye
2024	J	`jnl`	Learning-augmented maximum flow. Inf. Process. Lett. Adam Polak, Maksym Zub
2024	J	`jnl`	Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. CoRR Bingbing Hu, Adam Polak
2024	A*	`conf`	On Dynamic Graph Algorithms with Predictions. SODA Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2024	J	`jnl`	Online coloring of short intervals. Eur. J. Comb. Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
2024	A*	`conf`	Parameterized algorithms for block-structured integer programs with large entries. SODA Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2023	A	`conf`	Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ESA Tomasz Kociumaka, Adam Polak
2023	J	`jnl`	Connectivity Oracles for Predictable Vertex Failures. CoRR Bingbing Hu, Evangelos Kosinas, Adam Polak
2023	J	`jnl`	Deterministic 3SUM-Hardness. CoRR Nick Fischer, Piotr Kaliciak, Adam Polak
2023	A*	`conf`	Mixing Predictions for Online Metric Algorithms. ICML Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023	J	`jnl`	Mixing predictions for online metric algorithms. CoRR Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023	J	`jnl`	On Dynamic Graph Algorithms with Predictions. CoRR Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2023	A*	`conf`	On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. SODA Kim-Manuel Klein, Adam Polak, Lars Rohwedder
2023	J	`jnl`	Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023	A*	`conf`	Paging with Succinct Predictions. ICML Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2023	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. CoRR Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2022	J	`jnl`	Bellman-Ford is optimal for shortest hop-bounded paths. CoRR Adam Polak
2022	J	`jnl`	Learning-Augmented Maximum Flow. CoRR Adam Polak, Maksym Zub
2022	A*	`conf`	Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
2022	J	`jnl`	On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. CoRR Kim-Manuel Klein, Adam Polak, Lars Rohwedder
2022	J	`jnl`	Paging with Succinct Predictions. CoRR Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2022	A*	`conf`	Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. ICALP Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
2022	J	`jnl`	Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. CoRR Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
2021	A	`conf`	Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees. IPDPS Adam Polak, Adrian Siwiec, Michal Stobierski
2021	J	`jnl`	Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees. CoRR Adam Polak, Adrian Siwiec, Michal Stobierski
2021	A*	`conf`	Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
2021	J	`jnl`	Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
2021	A*	`conf`	Knapsack and Subset Sum with Small Items. ICALP Adam Polak, Lars Rohwedder, Karol Wegrzycki
2021	J	`jnl`	Knapsack and Subset Sum with Small Items. CoRR Adam Polak, Lars Rohwedder, Karol Wegrzycki
2021	A*	`conf`	Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2021	J	`jnl`	Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2021	A*	`conf`	Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2021	J	`jnl`	Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2021	A*	`conf`	Robust Learning-Augmented Caching: An Experimental Study. ICML Jakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Tomasz Zolna
2021	J	`jnl`	Robust Learning-Augmented Caching: An Experimental Study. CoRR Jakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Zolna
2020	J	`jnl`	Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
2020	A*	`conf`	Equivalences between triangle and range query problems. SODA Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
2020	A	`conf`	Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. ITCS Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
2020	J	`jnl`	Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. CoRR Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
2020	—	`conf`	Online Coloring of Short Intervals. APPROX-RANDOM Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
2020	A*	`conf`	Online metric algorithms with untrusted predictions. ICML Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2020	J	`jnl`	Online metric algorithms with untrusted predictions. CoRR Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2019	J	`jnl`	Equivalences between triangle and range query problems. CoRR Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
2019	J	`jnl`	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica Lech Duraj, Marvin Künnemann, Adam Polak
2018	J	`jnl`	On an Extremal Problem for Poset Dimension. Order Grzegorz Guspiel, Piotr Micek, Adam Polak
2018	J	`jnl`	Online Coloring of Short Intervals. CoRR Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak, Joanna Sokól
2018	J	`jnl`	Why is it hard to beat Inf. Process. Lett. Adam Polak
2017	J	`jnl`	On an extremal problem for poset dimension. CoRR Grzegorz Guspiel, Piotr Micek, Adam Polak
2017	B	`conf`	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. IPEC Lech Duraj, Marvin Künnemann, Adam Polak
2017	J	`jnl`	Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. CoRR Lech Duraj, Marvin Künnemann, Adam Polak
2017	J	`jnl`	Why is it hard to beat O(n CoRR Adam Polak
2016	—	`conf`	Counting Triangles in Large Graphs on GPU. IPDPS Workshops Adam Polak
2015	J	`jnl`	Counting Triangles in Large Graphs on GPU. CoRR Adam Polak
2012	—	`conf`	Real Time Object Tracking on GPGPU. VISAPP (2) Maciej Chociej, Adam Polak