E. N. Hanson. The interval skip list: a data structure for finding all intervals that overlap a point. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes Comput. Sci., pages 153–164. Springer-Verlag, 1991.

W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668–676, 1990.