11 citations · 26 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Upper and lower bounds for dynamic data structures on strings
Raphael Clifford, Allan Grønlund, Kasper Green Larsen +1
We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the patte…
cs.DS2015★ 11 cited
New Unconditional Hardness Results for Dynamic and Online Problems
Raphael Clifford, Allan Grønlund, Kasper Green Larsen
There has been a resurgence of interest in lower bounds whose truth rests on the conjectured hardness of well known computational problems. These conditional lower bounds have beco…