If the current Clique algorithms are optimal, so is Valiant's parserAmir AbboudArturs Backurset al.2018SIAM Journal on Computing
Fast algorithms for parsing sequences of parentheses with few errorsArturs BackursKrzysztof Onak2016SIGMOD/PODS 2016
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketchingArturs BackursPiotr Indyket al.2016SODA 2016