The following pages link to Sergio De Agostino (Q205205):
Displaying 27 items.
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- On-line versus off-line computation in dynamic text compression (Q671415) (← links)
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- (Q1111394) (redirect page) (← links)
- Parallelism and the feedback vertex set problem (Q1111395) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- P-complete problems in data compression (Q1325842) (← links)
- A worst-case analysis of the LZ2 compression algorithm (Q1383148) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files (Q1662611) (← links)
- Adaptive vector quantization for lossy compression of image sequences (Q1662716) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations (Q2254061) (← links)
- PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS (Q3348414) (← links)
- BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC (Q3421843) (← links)
- ON PV<sub>chunk</sub> OPERATIONS AND MATROGENIC GRAPHS (Q4020277) (← links)
- (Q4454544) (← links)
- (Q4677836) (← links)
- (Q5243995) (← links)
- (Q5397225) (← links)
- (Q5461521) (← links)
- A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES (Q5714659) (← links)
- (Q5754708) (← links)
- Parallelism and dictionary based data compression (Q5944436) (← links)
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing (Q6184325) (← links)
- The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)
