Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.

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.

Amon^ the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent version of the top down implementation of skew heaps can be produced from previously published sequential versions using almost mechanical transformations. This implementation requires O(log n] time to enqueue or dequeue an item, but it allows new operations to begin after orily 0(1) time on a MIMD machine. Thus, there is potential for significant concurrency when multiple processes share a queue. Appilications to problems in graph theory and simulation are discussed in this article.

Reduced instruction set computer (RISC) architectures have attracted considerable interest during the past decade.The ultimate RISC architecture presented here is an extreme yet simple illustration of such an architecture. It has only one instruction, move memory to memory, yet it is useful.

Internet voting is unachievable for the foreseeable future and therefore not inevitable.