On the compression of search trees

F Claude, PK Nicholson, D Seco - Information processing & management, 2014 - Elsevier
Abstract Let X= x 1, x 2,…, xn be a sequence of non-decreasing integer values. Storing a
compressed representation of X that supports access and search is a problem that occurs in …