Searching runs in streams

DOI10.1007/978-3-030-32686-9_15MaRDI QIDQ6536256zbMATH OpenFDO

Authors Oleg Merkurev, Arseny M. Shur

Publication date 19 April 2024

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Algorithms on strings (68W32)

Recommendations

• Computing the maximum exponent in a stream
• Streaming periodicity with mismatches
• Fast and Practical Algorithms for Computing All the Runs in a String
• The number of runs in a string
• Searching Long Repeats in Streams

Cites work

• scientific article; zbMATH DE number 6512979 (Why is no real title available?)
• Computing runs on a general alphabet
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Detecting leftmost maximal periodicities
• Dynamic ordered sets with exponential search trees
• Efficient randomized pattern-matching algorithms
• Faster longest common extension queries in strings over general alphabets
• Near-optimal computation of runs over general alphabet via non-crossing LCE queries
• Real-time streaming string-matching
• Searching Long Repeats in Streams
• Space efficient search for maximal repetitions
• Squares, cubes, and time-space efficient string searching
• Streaming for aibohphobes: longest palindrome with mismatches
• The ``runs theorem
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
• Uniqueness Theorems for Periodic Functions

Cited in

(1)

• Quasi-Periodicity in Streams

This page was built for publication: Searching runs in streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536256)