scientific article; zbMATH DE number 7758337
From MaRDI portal
Publication:6062160
DOI10.4230/lipics.approx/random.2020.35arXiv1907.04405MaRDI QIDQ6062160
Unnamed Author, Przemysław Uznański, Tatiana Starikovskaya
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/1907.04405
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal sampling from sliding windows
- How to catch \(L_2\)-heavy-hitters on sliding windows
- Pseudorandom generators for space-bounded computation
- Fast algorithms for approximately counting mismatches
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Counting distinct items over update streams
- \(L_{1}\) pattern matching lower bound
- Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
- Effective Computations on Sliding Windows
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Generalized String Matching
- A Method for Simulating Stable Random Variables
- The k-mismatch problem revisited
- Approximate Hamming Distance in a Stream
- Streaming Pattern Matching with d Wildcards
- Maintaining Stream Statistics over Sliding Windows
- An Approximate L1 -Difference Algorithm for Massive Data Streams
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
- Hamming Distance Completeness
- Approximating Approximate Pattern Matching
- Approximating text-to-pattern Hamming distances
- Exact and Approximate Pattern Matching in the Streaming Model
- The streaming k-mismatch problem
- Zero-One Laws for Sliding Windows and Universal Sketches
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Combinatorial Pattern Matching
- Algorithms - ESA 2003
This page was built for publication:
