Artykuły udostępnione publicznie: - Amir AbboudWięcej informacji
Dostępne w jakimś miejscu: 38
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
A Abboud, VV Williams, J Wang
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Upoważnienia: US National Science Foundation
Subcubic equivalences between graph centrality problems, APSP and diameter
A Abboud, F Grandoni, VV Williams
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
Upoważnienia: Swiss National Science Foundation, European Commission
If the current clique algorithms are optimal, so is Valiant's parser
A Abboud, A Backurs, VV Williams
SIAM Journal on Computing 47 (6), 2527-2555, 2018
Upoważnienia: US National Science Foundation
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
A Abboud, TD Hansen, VV Williams, R Williams
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Upoważnienia: US National Science Foundation
The 4/3 additive spanner exponent is tight
A Abboud, G Bodwin
Journal of the ACM (JACM) 64 (4), 1-20, 2017
Upoważnienia: US National Science Foundation
SETH-based lower bounds for subset sum and bicriteria path
A Abboud, K Bringmann, D Hermelin, D Shabtay
ACM Transactions on Algorithms (TALG) 18 (1), 1-22, 2022
Upoważnienia: US National Science Foundation, European Commission
Distributed PCP theorems for hardness of approximation in P
A Abboud, A Rubinstein, R Williams
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 25-36, 2017
Upoważnienia: US National Science Foundation
A hierarchy of lower bounds for sublinear additive spanners
A Abboud, G Bodwin, S Pettie
SIAM Journal on Computing 47 (6), 2203-2236, 2018
Upoważnienia: US National Science Foundation
Near-linear lower bounds for distributed distance computations, even in sparse networks
A Abboud, K Censor-Hillel, S Khoury
International Symposium on Distributed Computing, 29-42, 2016
Upoważnienia: US National Science Foundation
Popular conjectures as a barrier for dynamic planar graph algorithms
A Abboud, S Dahlgaard
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Upoważnienia: US National Science Foundation, Danish Council for Independent Research
Subtree isomorphism revisited
A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
Upoważnienia: US National Science Foundation, Carlsberg Foundation DK
More consequences of falsifying SETH and the orthogonal vectors conjecture
A Abboud, K Bringmann, H Dell, J Nederlof
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Upoważnienia: Netherlands Organisation for Scientific Research
Subquadratic high-dimensional hierarchical clustering
A Abboud, V Cohen-Addad, H Houdrouge
Advances in Neural Information Processing Systems 32, 2019
Upoważnienia: Agence Nationale de la Recherche
Dynamic set cover: improved algorithms and lower bounds
A Abboud, R Addanki, F Grandoni, D Panigrahi, B Saha
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Upoważnienia: US National Science Foundation, Swiss National Science Foundation
Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve
A Abboud, A Backurs, K Bringmann, M Künnemann
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Upoważnienia: US National Science Foundation
Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time
A Abboud, R Krauthgamer, J Li, D Panigrahi, T Saranurak, O Trabelsi
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Upoważnienia: US National Science Foundation, US Department of Defense, Netherlands …
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond
A Abboud, K Bringmann, S Khoury, O Zamir
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Upoważnienia: US Department of Defense, European Commission
Fooling views: a new lower bound technique for distributed computations under congestion
A Abboud, K Censor-Hillel, S Khoury, C Lenzen
Distributed Computing 33 (6), 545-559, 2020
Upoważnienia: European Commission
Towards hardness of approximation for polynomial time problems
A Abboud, A Backurs
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 11 …, 2017
Upoważnienia: US National Science Foundation
Stronger 3-sum lower bounds for approximate distance oracles via additive combinatorics
A Abboud, K Bringmann, N Fischer
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 391-404, 2023
Upoważnienia: European Commission
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy