Skip to main content
SpringerLink
Log in

Bounded size dictionary compression: SCk-completeness and NC algorithms

  • Complexity III
  • Conference paper
  • First Online:
STACS 98 (STACS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1373))

Included in the following conference series:

Abstract

We study the parallel complexity of a bounded size dictionary version (LRU deletion heuristic) of the LZ2 compression algorithm. The unbounded version was shown to be P-complete. When the size of the dictionary is O(logk n), the algorithm is shown to be hard for the class of problems solvable simultaneously in polynomial time and O(logk n) space (that is, SCk). We also introduce a variation of this heuristic that turns out to be the first natural SCk-complete problem (the original heuristic belongs to SCk+1). In virtue of these results, we argue that there are no practical parallel algorithms for LZ2 compression with LRU deletion heuristic or any other heuristic deleting dictionary elements in a continuous way. For simpler heuristics (SWAP, RESTART, FREEZE), practical parallel algorithms are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bell, T.C., J.G. Cleary and I.H. Witten [1990]. Text Compression, Prentice Hall.

    Google Scholar 

  2. Borodin, A. [1977]. “On Relating Time and Space to Size and Depth”, SIAM Journal on Computing 6, 733–744.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cook, S.A. [1979]. “Deterministic CFL's are accepted simultaneously in Polynomial Time and Log Squared Space”, 11th Ann. ACM Symposium on Theory of Computing, 338–345.

    Google Scholar 

  4. Cook, S.A. [1981]. “Towards a Complexity Theory of Synchronous Parallel Computation”, Enseignement Mathematique 27, 99–124.

    MATH  MathSciNet  Google Scholar 

  5. Cook, S.A. [1985]. “A Taxonomy of Problems with Fast Parallel Algorithms”, Information and Control 64, 2–22.

    Article  MATH  MathSciNet  Google Scholar 

  6. Crochemore, M. and W. Rytter [1991]. “Efficient Parallel Algorithms to Test Square-freeness and Factorize Strings”, Information Processing Letters 38, 57–60.

    Article  MATH  MathSciNet  Google Scholar 

  7. De Agostino, S. [1994]. “P-complete Problems in Data Compression”, Theoretical Computer Science 127, 181–186.

    Article  MATH  MathSciNet  Google Scholar 

  8. Dessmark, A., A. Lingas and A. Maheshwari [1995]. “Multi-list Layering: Complexity and Applications”, Theoretical Computer Science 141, 337–350.

    Article  MATH  MathSciNet  Google Scholar 

  9. Dymond, P.W. and S.A. Cook [1989]. “Complexity Theory of Parallel Time and Hardware”, Information and Computation 80, 205–226.

    Article  MATH  MathSciNet  Google Scholar 

  10. Greenlaw, R., H.J. Hoover and W.L. Ruzzo [1995]. Limits to Parallel Computation, Oxford University Press.

    Google Scholar 

  11. Johnson, D.S. [1990]. “A Catalog of Complexity Classes” Handbook of Theoretical Computer Science: Algorithms and Complexity, MIT Press/Elsevier (van Leeuwen J., editor), 67–162.

    Google Scholar 

  12. Lempel, A. and J. Ziv [1977]. “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory 23, 337–343.

    Article  MATH  MathSciNet  Google Scholar 

  13. Olariu, S., J.L. Schwing and J. Zhang [1992]. “Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals”, IEEE Transactions on Parallel and Distributed Systems 3, 364–374.

    Article  MathSciNet  Google Scholar 

  14. Pippenger, N. [1979]. “On Simultaneous Resource Bounds”, 20th Ann. Symposium on Foundations of Computer Science, 307–311.

    Google Scholar 

  15. Pippenger, N. and M.J. Fischer [1979]. “Relations Among Complexity Measures”, Journal of the ACM 26, 361–381.

    Article  MATH  MathSciNet  Google Scholar 

  16. Ruzzo, W.L. [1981]. “On Uniform Circuit Complexity”, Journal of Computer and System Sciences 22, 365–383.

    Article  MATH  MathSciNet  Google Scholar 

  17. Storer, J.A. [1988]. Data Compression: Methods and Theory (Computer Science Press).

    Google Scholar 

  18. Storer, J.A. [1992]. “Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression” Image and Text Compression, Kluwer Accademic Publishers (Storer J.A., editor), 159–178.

    Google Scholar 

  19. Ziv, J. and A. Lempel [1978]. “Compression of Individual Sequences via Variable Rate Coding”, IEEE Transactions on Information Theory 24, 530–536.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Università di Roma “La Sapienza”, Via Salaria 113, 00198, Roma, Italy

    Sergio De Agostino & Riccardo Silvestri

Authors
  1. Sergio De Agostino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Riccardo Silvestri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

De Agostino, S., Silvestri, R. (1998). Bounded size dictionary compression: SCk-completeness and NC algorithms. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028587

Download citation

  • DOI: https://doi.org/10.1007/BFb0028587

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64230-5

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation