18 citations · 79 across the 27 of their papers we have counts for
3 papers · 1 filter
Conditional Lower Bounds for Space/Time Tradeoffs
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein +1
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showi…
How Hard is it to Find (Honest) Witnesses?
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein +1
In recent years much effort was put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lin…
Streaming Pattern Matching with d Wildcards
Shay Golan, Tsvi Kopelowitz, Ely Porat
In the pattern matching with wildcards problem one is given a text of length and a pattern of length that contains wildcard characters, each denoted by a sp…