# Amir Abboud

According to our database

Collaborative distances:

^{1}, Amir Abboud authored at least 64 papers between 2013 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

ACM Trans. Algorithms, January, 2023

CoRR, 2023

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

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

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

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

Proceedings of the Approximation, 2023

2022

ACM Trans. Algorithms, 2022

J. Comput. Syst. Sci., 2022

CoRR, 2022

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

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

Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems.

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

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time.

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Theory Comput., 2021

ACM Trans. Algorithms, 2021

CoRR, 2021

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

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

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Fooling views: a new lower bound technique for distributed computations under congestion.

Distributed Comput., 2020

New hardness results for planar graph problems in p and an algorithm for sparsest cut.

Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Evaluation of intel 3D-xpoint NVDIMM technology for memory-intensive genomic workloads.

Proceedings of the International Symposium on Memory Systems, 2019

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

ACM Trans. Algorithms, 2018

SIAM J. Comput., 2018

SIAM J. Comput., 2018

SIAM J. Comput., 2018

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds.

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

PhD thesis, 2017

J. ACM, 2017

CoRR, 2017

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve.

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter.

CoRR, 2015

CoRR, 2015

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

IEEE Trans. Knowl. Data Eng., 2014

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Proceedings of the Applied Algorithms - First International Conference, 2014

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Proceedings of the Algorithms - ESA 2014, 2014

2013

CoRR, 2013

Proceedings of the First International Workshop on Big Dynamic Distributed Data, 2013

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013