Scholar
Adam Polak
Google Scholar ID: 2oYJahUAAAAJ
Bocconi University
Algorithms
Computational Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
633
H-index
14
i10-index
18
Publications
20
Co-authors
47
list available
Publications
8 items
3SUM Is Really Hard: A Real-to-Integer Reduction
2026
Cited
0
TSP with Predictions: Heatmap to Tour with Provable Guarantees
2026
Cited
0
Warm-Starting All-Pairs Shortest Paths with Predictions
2026
Cited
0
The Planted Orthogonal Vectors Problem
2025
Cited
0
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
arXiv.org · 2024
Cited
0
3SUM in Preprocessed Universes: Faster and Simpler
SIAM Symposium on Simplicity in Algorithms · 2024
Cited
2
Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
arXiv.org · 2024
Cited
0
Parameterized algorithms for block-structured integer programs with large entries
ACM-SIAM Symposium on Discrete Algorithms · 2023
Cited
10
Co-authors
12 total
Antonios Antoniadis
Assistant Professor, DMMP group, University of Twente
Christian Coester
University of Oxford
Virginia Vassilevska Williams
MIT
Lars Rohwedder
Associate Professor at University of Southern Denmark (SDU)
Andrea Lincoln
Boston University
Yinzhan Xu
University of California San Diego
Grzegorz Gutowski
Jagiellonian University
Karol Węgrzycki
Max Planck Institute for Informatics
