I agree that this site is using cookies. You can find further informations here.
X
Abboud, Amir
52  results:
Articles (Online) X
Search for persons X
?
1

Reachability Preservers: New Extremal Bounds and Approximat..:

Abboud, Amir ; Bodwin, Greg
SIAM Journal on Computing.  53 (2024)  2 - p. 221-246 , 2024
Link: https://doi.org/10.1137/..
 
?
2

Subcubic Equivalences between Graph Centrality Problems, AP..:

Abboud, Amir ; Grandoni, Fabrizio ; Vassilevska Williams, Virginia
ACM Transactions on Algorithms.  19 (2023)  1 - p. 1-30 , 2023
Link: https://doi.org/10.1145/..
 
?
3

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms.  18 (2022)  1 - p. 1-22 , 2022
Link: https://doi.org/10.1145/..
 
?
4

Scheduling lower bounds via AND subset sum:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
Journal of Computer and System Sciences.  127 (2022)  - p. 29-40 , 2022
Link: https://doi.org/10.1016/..
 
?
5

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms (TALG).  18 (2022)  1 - p. 1-22 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

Smaller Cuts, Higher Lower Bounds:

Abboud, Amir ; Censor-Hillel, Keren ; Khoury, Seri.
ACM Transactions on Algorithms (TALG).  17 (2021)  4 - p. 1-40 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Smaller Cuts, Higher Lower Bounds:

Abboud, Amir ; Censor-Hillel, Keren ; Khoury, Seri.
ACM Transactions on Algorithms.  17 (2021)  4 - p. 1-40 , 2021
Link: https://doi.org/10.1145/..
 
?
8

Fooling views: a new lower bound technique for distributed ..:

Abboud, Amir ; Censor-Hillel, Keren ; Khoury, Seri.
Distributed Computing.  33 (2020)  6 - p. 545-559 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms (TALG).  14 (2018)  3 - p. 1-23 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

If the Current Clique Algorithms Are Optimal, so Is Valiant..:

Abboud, Amir ; Backurs, Arturs ; Williams, Virginia Vassilevska
SIAM Journal on Computing.  47 (2018)  6 - p. 2527-2555 , 2018
Link: https://doi.org/10.1137/..
 
?
11

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms.  14 (2018)  3 - p. 1-23 , 2018
Link: https://doi.org/10.1145/..
 
?
12

A Hierarchy of Lower Bounds for Sublinear Additive Spanners:

Abboud, Amir ; Bodwin, Greg ; Pettie, Seth
SIAM Journal on Computing.  47 (2018)  6 - p. 2203-2236 , 2018
Link: https://doi.org/10.1137/..
 
?
13

Matching Triangles and Basing Hardness on an Extremely Popu..:

Abboud, Amir ; Williams, Virginia Vassilevska ; Yu, Huacheng
SIAM Journal on Computing.  47 (2018)  3 - p. 1098-1122 , 2018
Link: https://doi.org/10.1137/..
 
?
14

The 4/3 Additive Spanner Exponent Is Tight:

Abboud, Amir ; Bodwin, Greg
Journal of the ACM.  64 (2017)  4 - p. 1-20 , 2017
Link: https://doi.org/10.1145/..
 
?
15

The 4/3 Additive Spanner Exponent Is Tight:

Abboud, Amir ; Bodwin, Greg
Journal of the ACM (JACM).  64 (2017)  4 - p. 1-20 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15