Testing periodicity

DOI10.1007/s00453-009-9351-yzbMath1215.68280OpenAlexW2912684911MaRDI QIDQ534782

Ilan Newman, Oded Lachish

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9351-y

zbMATH Keywords

periodicityproperty testing

Mathematics Subject Classification ID

Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (3)

Unnamed Item ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Periodicity in data streams with wildcards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Property testing and its connection to learning and approximation
• Near-optimal sparse fourier representations via sampling
• Simple Analytic Proof of the Prime Number Theorem
• Simple Constructions of Almost k-wise Independent Random Variables
• Robust Characterizations of Polynomials with Applications to Program Testing
• LATIN 2004: Theoretical Informatics

This page was built for publication: Testing periodicity