POLAK, ADAM TEODOR
POLAK, ADAM TEODOR
Dipartimento di Scienze della Computazione
3SUM in Preprocessed Universes: Faster and Simpler
2025 Kasliwal, Shashwat; Polak, Adam; Sharma, Pratyush
3SUM in Preprocessed Universes: Faster and Simpler
2025 Kasliwal, Shashwat; Polak, Adam; Sharma, Pratyush
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION WITH PREDICTIONS
2025 Antoniadis, A.; Elias, M.; Polak, A.; Venzin, M.
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths
2023 Kociumaka, Tomasz; Polak, Adam
Connectivity Oracles for Predictable Vertex Failures
2024 Hu, Bingbing; Kosinas, Evangelos; Polak, Adam
Counting triangles in large graphs on GPU
2016 Polak, Adam
Deterministic 3SUM-Hardness
2024 Fischer, Nick; Kaliciak, Piotr; Polak, Adam
Distributed tasks: introducing distributed computing to programming competitions
2016 Karczmarz, Adam; Lacki, Jacjub; Polak, Adam; Radoszewski, Jakub; Wojtaszczyk, Jakub O.
Equivalences between triangle and range query problems
2020 Duraj, Lech; Kleiner, Krzysztof; Polak, Adam; Williams, Virginia Vassilevska
Euler meets GPU: practical graph algorithms with theoretical guarantees
2021 Polak, Adam; Siwiec, Adrian; Stobierski, Michal
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
2024 Bringmann, Karl; Dürr, Anita; Polak, Adam
Faster monotone min-plus product, range mode, and single source replacement paths
2021 Gu, Yuzhou; Polak, Adam; Williams, Virginia Vassilevska; Xu, Yinzhan
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
2025 Nogler, J.; Polak, A.; Saha, B.; Vassilevska Williams, V.; Xu, Y.; Ye, C.
Knapsack and subset sum with small items
2021 Polak, Adam; Rohwedde, Lars; Wegrzycki, Karol
Learning-augmented dynamic power management with multiple states via new ski rental bounds
2021 Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand
Learning-augmented maximum flow
2024 Polak, Adam; Zub, Maksym
Memoryless worker-task assignment with polylogarithmic switching cost
2022 Berger, Aaron; Kuszmaul, William; Polak, Adam; Tidor, Jonathan; Wein, Nicole
Mixing predictions for online metric algorithms
2023 Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand
Monochromatic triangles, intermediate matrix products, and convolutions
2020 Lincoln, Andrea; Polak, Adam; Williams, Virginia Vassilevska
Nearly-tight and oblivious algorithms for explainable clustering
2021 Gamlath, Buddhima; Jia, Xinrui; Polak, Adam; Svensson, Ola
| Titolo | Data di pubblicazione | Autore(i) | Rivista | Editore |
|---|---|---|---|---|
| 3SUM in Preprocessed Universes: Faster and Simpler | 1-gen-2025 | Kasliwal, Shashwat; Polak, Adam; Sharma, Pratyush | THEORETICS | - |
| 3SUM in Preprocessed Universes: Faster and Simpler | 1-gen-2025 | Kasliwal, Shashwat; Polak, Adam; Sharma, Pratyush | - | (seleziona...) |
| APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION WITH PREDICTIONS | 1-gen-2025 | Antoniadis, A.; Elias, M.; Polak, A.; Venzin, M. | - | (seleziona...) |
| Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths | 1-gen-2023 | Kociumaka, Tomasz; Polak, Adam | - | (seleziona...) |
| Connectivity Oracles for Predictable Vertex Failures | 1-gen-2024 | Hu, Bingbing; Kosinas, Evangelos; Polak, Adam | - | (seleziona...) |
| Counting triangles in large graphs on GPU | 1-gen-2016 | Polak, Adam | - | (seleziona...) |
| Deterministic 3SUM-Hardness | 1-gen-2024 | Fischer, Nick; Kaliciak, Piotr; Polak, Adam | - | (seleziona...) |
| Distributed tasks: introducing distributed computing to programming competitions | 1-gen-2016 | Karczmarz, Adam; Lacki, Jacjub; Polak, Adam; Radoszewski, Jakub; Wojtaszczyk, Jakub O. | OLYMPIADS IN INFORMATICS | - |
| Equivalences between triangle and range query problems | 1-gen-2020 | Duraj, Lech; Kleiner, Krzysztof; Polak, Adam; Williams, Virginia Vassilevska | - | Association for Computing Machinery |
| Euler meets GPU: practical graph algorithms with theoretical guarantees | 1-gen-2021 | Polak, Adam; Siwiec, Adrian; Stobierski, Michal | - | (seleziona...) |
| Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing | 1-gen-2024 | Bringmann, Karl; Dürr, Anita; Polak, Adam | - | (seleziona...) |
| Faster monotone min-plus product, range mode, and single source replacement paths | 1-gen-2021 | Gu, Yuzhou; Polak, Adam; Williams, Virginia Vassilevska; Xu, Yinzhan | - | (seleziona...) |
| Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence | 1-gen-2025 | Nogler, J.; Polak, A.; Saha, B.; Vassilevska Williams, V.; Xu, Y.; Ye, C. | - | Association for Computing Machinery |
| Knapsack and subset sum with small items | 1-gen-2021 | Polak, Adam; Rohwedde, Lars; Wegrzycki, Karol | - | (seleziona...) |
| Learning-augmented dynamic power management with multiple states via new ski rental bounds | 1-gen-2021 | Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand | - | (seleziona...) |
| Learning-augmented maximum flow | 1-gen-2024 | Polak, Adam; Zub, Maksym | INFORMATION PROCESSING LETTERS | - |
| Memoryless worker-task assignment with polylogarithmic switching cost | 1-gen-2022 | Berger, Aaron; Kuszmaul, William; Polak, Adam; Tidor, Jonathan; Wein, Nicole | - | (seleziona...) |
| Mixing predictions for online metric algorithms | 1-gen-2023 | Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand | - | (seleziona...) |
| Monochromatic triangles, intermediate matrix products, and convolutions | 1-gen-2020 | Lincoln, Andrea; Polak, Adam; Williams, Virginia Vassilevska | - | (seleziona...) |
| Nearly-tight and oblivious algorithms for explainable clustering | 1-gen-2021 | Gamlath, Buddhima; Jia, Xinrui; Polak, Adam; Svensson, Ola | - | Association for Computing Machinery |