65 citations · 68 across the 4 of their papers we have counts for
4 papers
LCPan: efficient variation graph construction using Locally Consistent Parsing
Akmuhammet Ashyralyyev, Zülal Bingöl, Begüm Filiz Öz +5
Efficient and consistent string processing is critical in the exponentially growing genomic data era. Locally Consistent Parsing (LCP) addresses this need by partitioning an input…
Empirical Challenge for NC Theory
Ananth Hari, Uzi Vishkin
Horn-satisfiability or Horn-SAT is the problem of deciding whether a satisfying assignment exists for a Horn formula, a conjunction of clauses each with at most one positive litera…
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks
Avi Schwarzschild, Eitan Borgnia, Arjun Gupta +4
Deep neural networks are powerful machines for visual pattern recognition, but reasoning tasks that are easy for humans may still be difficult for neural models. Humans possess the…
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
Samir Khuller, Uzi Vishkin, Neal Young
The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).