Computing the maximum exponent in a stream

DOI10.1007/s00453-021-00883-yOpenAlexW3209439553MaRDI QIDQ2118207

Oleg Merkurev, Arseny M. Shur

Publication date: 22 March 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00883-y

zbMATH Keywords

exponentstringologystreaming algorithmgapped repeatperiodic string

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Combinatorics on words (68R15) Online algorithms; streaming algorithms (68W27) Graph theory (05Cxx) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Growth properties of power-free languages
• Surpassing the information theoretic bound with fusion trees
• Near-optimal computation of runs over general alphabet via non-crossing LCE queries
• Uniformly growing k-th power-free homomorphisms
• Optimal bounds for computing \({\alpha}\)-gapped repeats
• Real-Time Streaming String-Matching
• Dynamic ordered sets with exponential search trees
• Growth of Power-Free Languages over Large Alphabets
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Searching Long Repeats in Streams
• Searching of Gapped Repeats and Subrepetitions in a Word
• Exact and Approximate Pattern Matching in the Streaming Model

This page was built for publication: Computing the maximum exponent in a stream