This article relies largely or entirely upon a single source. Please help improve this article by introducing appropriate citations of additional sources. (May 2008)
This article needs additional citations for verification.
Please help improve this article by adding reliable references. Unsourced material may be challenged and removed. (May 2008)
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions are available. (May 2008)

The Algorithm BSTW is a data compression algorithm, named after its designers, Bentley, Sleator, Tarjan and Wei in 1986. BSTW is a dictionary-based algorithm that uses a move-to-front transform to keep recently-seen dictionary entries at the front of the dictionary. Dictionary references are then encoded using any of a number of encoding methods, usually Elias delta coding or Elias gamma coding.

References

• Algorithm BSTW

O(n log n) This algorithms-related article is a stub. You can help Wikipedia by expanding it.