7 citations · 26 across the 17 of their papers we have counts for
23 papers
Property Testing for Recursive Query Languages
Isolde Adler, Carsten Lutz, Quentin Manière +2
In the context of database querying, property testing provides a framework for testing query answers with high confidence while inspecting only a sublinear part of the database, th…
Constant time testability of first-order logic with modulo counting on finitary graphs
Isolde Adler, Jenny Stimpson
This paper studies algorithmic meta theorems for property testing with \emph{constant running time} in the bounded degree model. In (Adler, Harwath 2018) it was shown that on graph…
Monotonicity of the cops and robber game for bounded depth treewidth
Isolde Adler, Eva Fluck
We study a variation of the cops and robber game characterising treewidth, where in each play at most q cops can be placed in order to catch the robber, where q is a parameter of t…
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing
Isolde Adler, Noleen Köhler, Pan Peng
We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that…
GSF-locality is not sufficient for proximity-oblivious testing
Isolde Adler, Noleen Köhler, Pan Peng
In Property Testing, proximity-oblivious testers (POTs) form a class of particularly simple testing algorithms, where a basic test is performed a number of times that may depend on…
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…