Bounded size dictionary compression: SC:::k:::-completeness and NC algorithms

Sergio De Agostino, Riccardo Silvestri. Bounded size dictionary compression: SC:::k:::-completeness and NC algorithms. Inf. Comput., 180(2):101-112, 2003. [doi]

@article{AgostinoS03,
  title = {Bounded size dictionary compression: SC:::k:::-completeness and NC algorithms},
  author = {Sergio De Agostino and Riccardo Silvestri},
  year = {2003},
  doi = {10.1016/S0890-5401(02)00013-5},
  url = {http://dx.doi.org/10.1016/S0890-5401(02)00013-5},
  tags = {completeness},
  researchr = {https://researchr.org/publication/AgostinoS03},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {180},
  number = {2},
  pages = {101-112},
}