2 papers
cs.DB2021
Towards Approximate Query Enumeration with Sublinear Preprocessing Time
Isolde Adler, Polly Fahey
This paper aims at providing extremely efficient algorithms for approximate query enumeration on sparse databases, that come with performance and accuracy guarantees. We introduce…
cs.LO2020
Faster Property Testers in a Variation of the Bounded Degree Model
Isolde Adler, Polly Fahey
Property testing algorithms are highly efficient algorithms, that come with probabilistic accuracy guarantees. For a property P, the goal is to distinguish inputs that have P from…