#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2008

2018

- This year (8)
- Last 5 years (42)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Amir Abboud, Virginia Vassilevska Williams
- 2014 IEEE 55th Annual Symposium on Foundations ofâ€¦
- 2014

We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory ofâ€¦ (More)

Measuring the importance of a node in a network is a major goal in the analysis of social networks, biological systems, transportation networks etc. Different centrality measures have been proposedâ€¦ (More)

A recent, active line of work achieves tight lower bounds for fundamental problems under the Strong Exponential Time Hypothesis (SETH). A celebrated result of Backurs and Indyk (STOCâ€™15) proves thatâ€¦ (More)

The radius and diameter are fundamental graph parameters, with several natural definitions for directed graphs. Each definition is well-motivated in a variety of applications. All versions ofâ€¦ (More)

- Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
- 2015 IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequencesâ€¦ (More)

Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequencesâ€¦ (More)

- Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu
- SIAM J. Comput.
- 2018

- Amir Abboud, Virginia Vassilevska Williams, Oren Weimann
- ICALP
- 2014

The Local Alignment problem is a classical problem with applications in biology. Given two input strings and a scoring function on pairs of letters, one is asked to find the substrings of the twoâ€¦ (More)

- Amir Abboud, Richard Ryan Williams, Huacheng Yu
- SODA
- 2015

In low-depth circuit complexity, the polynomial method is a way to prove lower bounds by translating weak circuits into low-degree polynomials, then analyzing properties of these polynomials.â€¦ (More)

- Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
- 2015 IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer scienceâ€¦ (More)