Pages that link to "Item:Q1325842"
From MaRDI portal
The following pages link to P-complete problems in data compression (Q1325842):
Displaying 12 items.
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- On compressing complete designs (Q1298922) (← links)
- Inequalities and algorithms for universal data compression (Q1389278) (← 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)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC (Q3421843) (← links)
- Compression and hadamard power inequalities (Q3728157) (← 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)