ملف الباحث
Virginia Vassilevska Williams
ورقتان في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
Tight Hardness Results for LCS and Other Sequence Similarity Measures
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 are central tasks in a variety of …
-
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
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 …