| The greedy approach to dictionary-based static text compression on a distributed system | 1 | 0.34 | 2015 |
| Weakly split graphs and regular cellulations of the 3-sphere. | 0 | 0.34 | 2013 |
| Binary Image Compression via Monochromatic Pattern Substitution: Sequential and Parallel Implementations. | 1 | 0.35 | 2013 |
| Lempel-Ziv Data Compression on Parallel and Distributed Systems | 0 | 0.34 | 2011 |
| Binary Image Compression Via Monochromatic Pattern Substitution: A Sequential Speed-Up | 1 | 0.36 | 2011 |
| Scalability and Communication in Parallel Low-Complexity Lossless Compression | 4 | 0.53 | 2010 |
| Binary Image Compression Via Monochromatic Pattern Substitution: Effectiveness And Scalability | 2 | 0.37 | 2010 |
| Compressing Bi-Level Images By Block Matching On A Tree Architecture | 1 | 0.35 | 2009 |
| Practical Parallel Algorithms for Dictionary Data Compression | 0 | 0.34 | 2009 |
| Lossless Image Compression By Block Matching On Practical Massively Parallel Architectures | 2 | 0.39 | 2008 |
| Speeding Up Lossless Image Compression: Experimental Results On A Parallel Machine | 1 | 0.35 | 2008 |
| A Parallel Decoder for Lossless Image Compression by Block Matching | 1 | 0.36 | 2007 |
| Lossless Image Compression by Block Matching on a Mesh of Trees | 4 | 0.44 | 2006 |
| Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic | 1 | 0.35 | 2005 |
| A Simple Lossless Compression Heuristic For Grey Scale Images | 4 | 0.40 | 2004 |
| A Simple Lossless Compression Heuristic for RGB Images | 1 | 0.36 | 2004 |
| A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching | 4 | 0.47 | 2003 |
| Almost Work-Optimal PRAM EREW Decoders of LZ Compressed Text | 2 | 0.36 | 2003 |
| A Note On The Spatiality Degree Of Graphs | 0 | 0.34 | 2002 |
| A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. | 0 | 0.34 | 2002 |
| Parallelism and dictionary based data compression | 2 | 0.36 | 2001 |
| Work-Optimal Parallel Decoders for LZ2 Data Compression | 2 | 0.37 | 2000 |
| Erratum to “P-complete Problems in Data Compression” | 0 | 0.34 | 2000 |
| Bounded size dictionary compression: SCk -completeness and NC algorithms | 4 | 0.40 | 1998 |
| The parallel complexity of approximating the high degree subgraph problem | 1 | 0.35 | 1998 |
| A worst-case analysis of the LZ2 compression algorithm | 2 | 0.36 | 1997 |
| An O(n³) Recognition Algorithm for Bithreshold Graphs | 0 | 0.34 | 1997 |
| On-line versus off-line computation in dynamic text compression | 15 | 0.98 | 1996 |
| A parallel decoding algorithm for LZ2 data compression | 7 | 0.72 | 1995 |
| Max Sat and Min Set Cover Approximation Algorithms are P-Complete | 1 | 0.38 | 1995 |
| P-complete problems in data compression | 18 | 1.17 | 1994 |
| On PVchunk Operations and Matrogenic Graphs | 1 | 0.35 | 1992 |
| Parallel algorithms for optimal compression using dictionaries with the prefix property | 15 | 2.48 | 1992 |
| Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods | 4 | 0.44 | 1990 |
