Author:
Hanke Sabine,Soisalon-Soininen Eljas
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. G.M Adel’son-Vels'kii and E.M. Landis. An algorithm for the organisation of information. Soviet Math. Dokl., 3:1259–1262, 1962.
2. J. Boyar, R. Fagerberg, and K. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504–521, 1997.
3. M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594–614, 1980.
4. C. Faloutsos and S. Christodoulakis. Design of a signature file method that accounts for non-uniform occurrence and query frequencies. In Proc. Intern. Conf. on Very Large Data Bases, pages 165–180, 1985.
5. Lect Notes Comput Sci;C. Faloutsos,1992