Computing the maximum exponent in a stream
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Dynamic ordered sets with exponential search trees
- Efficient randomized pattern-matching algorithms
- Exact and Approximate Pattern Matching in the Streaming Model
- Fast Pattern Matching in Strings
- Growth of power-free languages over large alphabets
- Growth properties of power-free languages
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Real-time streaming string-matching
- Searching Long Repeats in Streams
- Searching of Gapped Repeats and Subrepetitions in a Word
- Surpassing the information theoretic bound with fusion trees
- Uniformly growing k-th power-free homomorphisms
Cited in
(4)
This page was built for publication: Computing the maximum exponent in a stream
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118207)