Periodicity and cyclic shifts via linear sketches
DOI10.1007/978-3-642-22935-0_14zbMATH Open1343.68193OpenAlexW1673624119MaRDI QIDQ3088091FDOQ3088091
Authors: Michael S. Crouch, Andrew McGregor 
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_14
Recommendations
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32) Sampling theory in information and communication theory (94A20)
Cites Work
- The space complexity of approximating the frequency moments
- Data Streams: Algorithms and Applications
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Title not available (Why is that?)
- Near-optimal sparse fourier representations via sampling
- An improved data stream summary: the count-min sketch and its applications
- On the exact space complexity of sketching and streaming small norms
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Exact and Approximate Pattern Matching in the Streaming Model
- Periodicity in streams
- Pseudorandom generators for space-bounded computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- 1-pass relative-error \(L_p\)-sampling with applications
- Periodicity testing with sublinear samples and space
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)
