On the Data Expansion of the Huffman Compression Algorithm.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 137, doi. 10.1093/comjnl/41.3.137
- By:
- Publication type:
- Article
Works matching IS 00104620 AND DT 1998 AND VI 41 AND IP 3
Results: 6
1
2
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 201, doi. 10.1093/comjnl/41.3.201
- By:
- Publication type:
- Article
3
Fault-Tolerant Broadcasting on the Arrangement Graph.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 171, doi. 10.1093/comjnl/41.3.171
- By:
- Publication type:
- Article
4
Sequential Diagnosis with Asymmetrical Tests.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 163, doi. 10.1093/comjnl/41.3.163
- By:
- Publication type:
- Article
5
Formal Specification of Concurrent Systems: A Structured Approach.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 145, doi. 10.1093/comjnl/41.3.145
- By:
- Publication type:
- Article
6
A Quadtree-Based Dynamic Attribute Indexing Method.
- Published in:
- Computer Journal, 1998, v. 41, n. 3, p. 185, doi. 10.1093/comjnl/41.3.185
- By:
- Publication type:
- Article