Periodicity and cyclic shifts via linear sketches
From MaRDI portal
Publication:3088091
Recommendations
Cites work
- scientific article; zbMATH DE number 1615297 (Why is no real title available?)
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 5764818 (Why is no real title available?)
- 1-pass relative-error \(L_p\)-sampling with applications
- An improved data stream summary: the count-min sketch and its applications
- Data Streams: Algorithms and Applications
- Exact and Approximate Pattern Matching in the Streaming Model
- Near-optimal sparse fourier representations via sampling
- On the exact space complexity of sketching and streaming small norms
- Periodicity in streams
- Periodicity testing with sublinear samples and space
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandom generators for space-bounded computation
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- The space complexity of approximating the frequency moments
Cited in
(6)
This page was built for publication: Periodicity and cyclic shifts via linear sketches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088091)