Searching runs in streams

DOI10.1007/978-3-030-32686-9_15zbMATH Open1539.68382MaRDI QIDQ6536256

Arseny M. Shur, Oleg Merkurev

Publication date: 19 April 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Space efficient search for maximal repetitions
• Computing runs on a general alphabet
• Near-optimal computation of runs over general alphabet via non-crossing LCE queries
• Detecting leftmost maximal periodicities
• Squares, cubes, and time-space efficient string searching
• Real-Time Streaming String-Matching
• Dynamic ordered sets with exponential search trees
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Efficient randomized pattern-matching algorithms
• Searching Long Repeats in Streams
• Uniqueness Theorems for Periodic Functions
• The “Runs” Theorem
• Faster Longest Common Extension Queries in Strings over General Alphabets
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.

This page was built for publication: Searching runs in streams