( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.

, , и . STOC, стр. 391-404. ACM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Abboud Abboud

Amir Rahima-Al-Abboud Abdul

Ali Abboud

Joseph Abboud

Fahim Abboud

 

Другие публикации лиц с тем же именем

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , и . STOC, стр. 375-388. ACM, (2016)The 4/3 additive spanner exponent is tight., и . STOC, стр. 351-361. ACM, (2016)Reachability Preservers: New Extremal Bounds and Approximation Algorithms., и . SODA, стр. 1865-1883. SIAM, (2018)More Applications of the Polynomial Method to Algorithm Design., , и . SODA, стр. 218-230. SIAM, (2015)APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time., , и . FOCS, стр. 1135-1146. IEEE, (2021)On Diameter Approximation in Directed Graphs., , , и . ESA, том 274 из LIPIcs, стр. 2:1-2:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Impossibility Results for Grammar-Compressed Linear Algebra., , , и . NeurIPS, (2020)Listing 4-Cycles., , , и . FSTTCS, том 284 из LIPIcs, стр. 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)New hardness results for planar graph problems in p and an algorithm for sparsest cut., , и . STOC, стр. 996-1009. ACM, (2020)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , и . STOC, стр. 1487-1500. ACM, (2022)