12 citations · 24 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
Efficiently Correcting Matrix Products
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas +2
We study the problem of efficiently correcting an erroneous product of two matrices over a ring. Among other things, we provide a randomized algorithm for correcting a…
cs.DS2013★ 1 cited
Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer +5
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders…