scientific article; zbMATH DE number 7758348
From MaRDI portal
Publication:6084405
DOI10.4230/lipics.approx/random.2020.46arXiv2006.13673MaRDI QIDQ6084405
Tsvi Kopelowitz, Ely Porat, Shay Golan, Przemysław Uznański, Tomasz Kociumaka
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/2006.13673
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The communication complexity of the Hamming distance problem
- The space complexity of approximating the frequency moments
- Fast algorithms for approximately counting mismatches
- Streaming pattern matching with \(d\) wildcards
- Streaming \(k\)-mismatch with error correcting and applications
- Nonembeddability theorems via Fourier analysis
- Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
- Periodicity and Cyclic Shifts via Linear Sketches
- Improved Sketching of Hamming Distance with Error Correcting
- Generalized String Matching
- Efficient randomized pattern-matching algorithms
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- The k-mismatch problem revisited
- Approximate Hamming Distance in a Stream
- Error Detecting and Error Correcting Codes
- Faster algorithms for string matching with k mismatches
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
- Approximating text-to-pattern Hamming distances
- Exact and Approximate Pattern Matching in the Streaming Model
- The streaming k-mismatch problem
- Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Streaming algorithms for embedding and computing edit distance in the low distance regime
- Homomorphic fingerprints under misalignments
- Low distortion embeddings for edit distance
This page was built for publication:
