Bounded size dictionary compression: SCk-completeness and NC algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 522-532

  De Agostino, Sergio ^a   Silvestri, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SIZE; COMPLETE PROBLEMS; COMPRESSION ALGORITHMS; DICTIONARY COMPRESSION; P-COMPLETE; PARALLEL COMPLEXITY; POLYNOMIAL-TIME;

COMPUTER SCIENCE; DATA COMPRESSION; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; POLYNOMIAL APPROXIMATION;

HEURISTIC ALGORITHMS;

EID: 0004791170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028587     Document Type: Conference Paper

References (19)

1. Bell, T.C., J.G. Cleary and I.H. Witten [1990]. Text Compression, Prentice Hall.
2. Borodin, A. [1977]. "On Relating Time and Space to Size and Depth", SIAM Journal on Computing 6, 733-744.
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.
4. Cook, S.A. [1981]. "Towards a Complexity Theory of Synchronous Parallel Computation", Enseignement Mathematique 27, 99-124.
5. Cook, S.A. [1985]. "A Taxonomy of Problems with Fast Parallel Algorithms", Information and Control 64, 2-22.
6. Crochemore, M. and W. Rytter [1991]. "Efficient Parallel Algorithms to Test Square-freeness and Factorize Strings", Information Processing Letters 38, 57-60.
7. De Agostino, S. [1994]. "P-complete Problems in Data Compression", Theoretical Computer Science 127, 181-186.
8. Dessmark, A., A. Lingas and A. Maheshwari [1995]. "Multi-list Layering: Complexity and Applications", Theoretical Computer Science 141, 337-350.
9. Dymond, P.W. and S.A. Cook [1989]. "Complexity Theory of Parallel Time and Hardware", Information and Computation 80, 205-226.
10. Greenlaw, R., H.J. Hoover and W.L. Ruzzo [1995]. Limits to Parallel Computation, Oxford University Press.
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.
12. Lempel, A. and J. Ziv [1977]. "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory 23, 337-343.
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.
14. Pippenger, N. [1979]. "On Simultaneous Resource Bounds", 20th Ann. Symposium on Foundations of Computer Science, 307-311.
15. Pippenger, N. and M.J. Fischer [1979]. "Relations Among Complexity Measures", Journal of the ACM 26, 361-381.
16. Ruzzo, W.L. [1981]. "On Uniform Circuit Complexity", Journal of Computer and System Sciences 22, 365-383.
17. Storer, J.A. [1988]. Data Compression: Methods and Theory (Computer Science Press).
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.
19. Ziv, J. and A. Lempel [1978]. "Compression of Individual Sequences via Variable Rate Coding", IEEE Transactions on Information Theory 24, 530-536.