Approximate consistency for transformations on words and trees

DOI10.1016/j.tcs.2016.01.032zbMath1336.68060OpenAlexW2263992963MaRDI QIDQ264563

Michel de Rougemont, Adrien Vieilleribière

Publication date: 31 March 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.032

zbMATH Keywords

complexityapproximationdatabase theory

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate membership for regular languages modulo the edit distance
• Property testing of regular tree languages
• Sublinear DTD Validity
• Approximate Satisfiability and Equivalence
• Property testing and its connection to learning and approximation
• XML data exchange
• Random sampling with a reservoir
• Probability Inequalities for Sums of Bounded Random Variables
• On Context-Free Languages
• Efficient testing of large graphs

This page was built for publication: Approximate consistency for transformations on words and trees