The following pages link to Amir Abboud (Q1660915):
Displaying 46 items.
- Near-linear lower bounds for distributed distance computations, even in sparse networks (Q1660917) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Losing Weight by Gaining Edges (Q2921387) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q2941487) (← links)
- Subtree Isomorphism Revisited (Q4554355) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← links)
- Error Amplification for Pairwise Spanner Lower Bounds (Q4575639) (← links)
- Subtree Isomorphism Revisited (Q4575669) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4575773) (← links)
- (Q4607916) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q4608011) (← links)
- (Q4638059) (← links)
- The 4/3 Additive Spanner Exponent Is Tight (Q4640279) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- (Q5002674) (← links)
- Smaller Cuts, Higher Lower Bounds (Q5035874) (← links)
- (Q5091155) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- New hardness results for planar graph problems in p and an algorithm for sparsest cut (Q5144984) (← links)
- New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs (Q5146764) (← links)
- (Q5158499) (← links)
- Consequences of Faster Alignment of Sequences (Q5167729) (← links)
- Dynamic set cover: improved algorithms and lower bounds (Q5212753) (← links)
- More consequences of falsifying SETH and the orthogonal vectors conjecture (Q5230294) (← links)
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path (Q5236184) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- The 4/3 additive spanner exponent is tight (Q5361843) (← links)
- Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (Q5361845) (← links)
- More Applications of the Polynomial Method to Algorithm Design (Q5363029) (← links)
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter (Q5363057) (← links)
- Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond (Q6083603) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
- On the fine-grained complexity of approximating \(k\)-center in sparse graphs (Q6539120) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
- Improved approximation algorithms and lower bounds for search-diversification problems (Q6560790) (← links)
- Friendly cut sparsifiers and faster Gomory-Hu trees (Q6575224) (← links)
- Worst-case to expander-case reductions (Q6610261) (← links)
- The time complexity of fully sparse matrix multiplication (Q6645537) (← links)
- On diameter approximation in directed graphs (Q6656937) (← links)
- Can you solve closest string faster than exhaustive search? (Q6656939) (← links)
- What else can Voronoi diagrams do for diameter in planar graphs? (Q6656940) (← links)
- On complexity of 1-center in various metrics (Q6663010) (← links)
