Sergio De Agostino

Discret. Appl. Math., January, 2024

2023

A Worst Case Analysis of the LZ2 Compression Algorithm with Bounded Size Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2023, 2023

2017

Adaptive Vector Quantization for Lossy Compression of Image Sequences.

[BibT_eX]

[DOI]

Raffaele Pizzolante

Bruno Carpentieri

Algorithms, 2017

Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files.

[BibT_eX]

[DOI]

Bruno Carpentieri

Raffaele Pizzolante

Algorithms, 2017

2015

The greedy approach to dictionary-based static text compression on a distributed system.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Approximating dictionary-based optimal data compression on a distributed system.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM International Conference on Computing Frontiers, 2015

2013

Binary Image Compression via Monochromatic Pattern Substitution: Sequential and Parallel Implementations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2013

Weakly split graphs and regular cellulations of the 3-sphere.

[BibT_eX]

Ars Comb., 2013

2012

LZW Data Compression on Large Scale and Extreme Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2012, 2012

2011

Lempel-Ziv Data Compression on Parallel and Distributed Systems.

[BibT_eX]

[DOI]

Algorithms, 2011

Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

2010

Scalability and Communication in Parallel Low-Complexity Lossless Compression.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009

Compressing Bi-Level Images by Block Matching on a Tree Architecture.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Practical Parallel Algorithms for Dictionary Data Compression.

[BibT_eX]

[DOI]

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008

Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

2007

A Parallel Decoder for Lossless Image Compression by Block Matching.

[BibT_eX]

[DOI]

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006

Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Lossless Image Compression by Block Matching on a Mesh of Trees.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005

A simple lossless compression heuristic for grey scale images.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

An extended self-organizing map (ESOM) for hierarchical clustering.

[BibT_eX]

[DOI]

Ray R. Hashemi

Mahmood Bahar

Proceedings of the IEEE International Conference on Systems, 2005

2004

Almost work-optimal pram erew decoders of LZ compressed text.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2004

A Simple Lossless Compression Heuristic for RGB Images.

[BibT_eX]

[DOI]

Franco Liberati

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching.

[BibT_eX]

Franco Liberati

Nord. J. Comput., 2003

Bounded size dictionary compression: SC<sup>k</sup>-completeness and NC algorithms.

[BibT_eX]

[DOI]

Riccardo Silvestri

Inf. Comput., 2003

2002

A note on the spatiality degree of graphs.

[BibT_eX]

Pierluigi Crescenzi

Riccardo Silvestri

Ars Comb., 2002

A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

A Parallel Algorithm for Lossless Image Compression by Block Matching.

[BibT_eX]

[DOI]

Franco Liberati

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

Parallelism and dictionary based data compression.

[BibT_eX]

[DOI]

Inf. Sci., 2001

LZ1 Compression of Binary Images Using a Simple Rectangle Greedy Matching Technique.

[BibT_eX]

[DOI]

Eernesto Grande

Proceedings of the Data Compression Conference, 2001

2000

Erratum to "P-complete Problems in Data Compression".

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Work-Optimal Parallel Decoders for LZ2 Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

1998

The Parallel Complexity of Approximating the High Degree Subgraph Problem.

[BibT_eX]

[DOI]

Alexander E. Andreev

Andrea E. F. Clementi

Theor. Comput. Sci., 1998

Pattern Matching in Text Compressed with the ID Heuristic.

[BibT_eX]

[DOI]

Piera Barcaccia

Antonella Cresti

Proceedings of the Data Compression Conference, 1998

1997

A Worst-Case Analysis of the LZ2 Compression Algorithm.

[BibT_eX]

[DOI]

Riccardo Silvestri

Inf. Comput., 1997

An O(n³) Recognition Algorithm for Bithreshold Graphs.

[BibT_eX]

[DOI]

Andrea Sterbini

Algorithmica, 1997

A parallel decoder for LZ2 compression using the ID update heuristic.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996

On-Line Versus Off-Line Computation in Dynamic Text Compression.

[BibT_eX]

[DOI]

James A. Storer

Inf. Process. Lett., 1996

1995

Max Sat and Min Set Cover Approximation Algorithms are P-Complete.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

Pierluigi Crescenzi

Parallel Process. Lett., 1995

A Parallel Decoding Algorithm for LZ2 Data Compression.

[BibT_eX]

[DOI]

Parallel Comput., 1995

Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture.

[BibT_eX]

[DOI]

D. Belinskaya

James A. Storer

Proceedings of the IEEE Data Compression Conference, 1995

1994

P-complete Problems in Data Compression.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1992

On PV<sub>chunk</sub> Operations and Matrogenic Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Parallel Algorithms for Optimal Compression Using Dictionaries with the Prefix Property.

[BibT_eX]

[DOI]

James A. Storer

Proceedings of the IEEE Data Compression Conference, 1992

1990

Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

1988

Parallelism and the Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Daniel P. Bovet