Self-adjusting binary search trees
Journal of the ACM (JACM)
Journal of Algorithms
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
A locally adaptive data compression scheme
Communications of the ACM
Arithmetic coding for data compression
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Systolic implementations of a move-to-front text compressor
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
ACM Computing Surveys (CSUR)
Systolic implementations of a move-to-front text compressor
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
ACM SIGMOD Record
Delta algorithms: an empirical analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Transactions on Information Systems (TOIS)
Splay trees for data compression
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Self-organized dynamic Huffman coding without frequency counts
DCC '95 Proceedings of the Conference on Data Compression
Profiling of lossless-compression algorithms for a novel biomedical-implant architecture
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Compression of concatenated web pages using XBW
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Image adaptive selective encryption of vector quantization index compression
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Research: Debugging tool for distributed Estelle programs
Computer Communications
| Hi-index | 48.22 |
The splay-prefix algorithm is one of the simplest and fastest adaptive data compression algorithms based on the use of a prefix code. The data structures used in the splay-prefix algorithm can also be applied to arithmetic data compression. Applications of these algorithms to encryption and image processing are suggested.