Efficient on-line algorithm for maintaining k-cover of sparse bit-strings.

DOI10.4230/LIPICS.FSTTCS.2012.249zbMath1354.68304OpenAlexW2246675034MaRDI QIDQ2957500

Amit Kumar, Preeti Ranjan Panda, Unnamed Author

Publication date: 26 January 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.249

zbMATH Keywords

online algorithmsstring algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

This page was built for publication: Efficient on-line algorithm for maintaining k-cover of sparse bit-strings.