| Publication | Date of Publication | Type |
|---|
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
Discrete Applied Mathematics | 2024-01-24 | Paper |
The parallel complexity of approximating the High Degree Subgraph problem
| 2023-03-21 | Paper |
Extended split graphs and the 3-sphere regular cellulation conjecture
| 2019-11-19 | Paper |
Lempel-Ziv data compression on parallel and distributed systems
Algorithms | 2019-03-26 | Paper |
Adaptive vector quantization for lossy compression of image sequences
Algorithms | 2018-08-20 | Paper |
Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
Algorithms | 2018-08-20 | Paper |
The greedy approach to dictionary-based static text compression on a distributed system
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
Mathematics in Computer Science | 2015-02-04 | Paper |
scientific article; zbMATH DE number 6260075 (Why is no real title available?)
| 2014-02-19 | Paper |
Scalability and communication in parallel low-complexity lossless compression
Mathematics in Computer Science | 2011-02-19 | Paper |
A conjecture on biconnected graphs and regular cellulation of the 3-sphere
| 2007-08-23 | Paper |
BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
scientific article; zbMATH DE number 2188419 (Why is no real title available?)
| 2005-07-26 | Paper |
scientific article; zbMATH DE number 2170340 (Why is no real title available?)
| 2005-05-23 | Paper |
scientific article; zbMATH DE number 2052915 (Why is no real title available?)
| 2004-03-08 | Paper |
Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
Information and Computation | 2003-08-19 | Paper |
Parallelism and dictionary based data compression
Information Sciences | 2001-10-10 | Paper |
The parallel complexity of approximating the high degree subgraph problem
Theoretical Computer Science | 1999-01-12 | Paper |
A worst-case analysis of the LZ2 compression algorithm
Information and Computation | 1998-09-08 | Paper |
An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
Algorithmica | 1997-08-20 | Paper |
On-line versus off-line computation in dynamic text compression
Information Processing Letters | 1997-02-27 | Paper |
P-complete problems in data compression
Theoretical Computer Science | 1995-01-26 | Paper |
ON PVchunk OPERATIONS AND MATROGENIC GRAPHS
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
Parallelism and the feedback vertex set problem
Information Processing Letters | 1988-01-01 | Paper |
