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

Amit Kumar, Preeti Ranjan Panda, Smruti R. Sarangi (2012)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2012.249

access: open

type: Conference or Workshop Paper

metadata version: 2023-10-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/KumarPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/KumarPS12
Amit Kumar, Preeti Ranjan Panda, Smruti R. Sarangi:
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. FSTTCS 2012: 249-256

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.