Author:
Ernst Hartmut,Schmidt Jochen,Beneken Gerd
Publisher
Springer Fachmedien Wiesbaden
Reference28 articles.
1. [AV62] G. Adelson-Velskii und E. M. Landis. An Algorithm for the Organization of Information. Soviet Mathematics-Doklady, 3:1259–1263, 1962. Übersetzung des russischen Originals aus Proc. of the USSR Academy of Sciences 146:263–266, 1962.
2. [Bay70] R. Bayer und E. McCreight. Organization and Maintenance of Large Ordered Indices. In Proc. of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET ’70, S. 107–141. ACM, New York, NY, USA, 1970.
3. [Bay71] R. Bayer. Binary B-trees for Virtual Memory. In Proc. of the 1971 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET ’71, S. 219–235. ACM, New York, NY, USA, 1971.
4. [Cor22] T. H. Cormen, C. E. Leiserson, R. L. Rivest und C. Stein. Introduction to Algorithms. The MIT Press, 4. Aufl., 2022.
5. [Dec85] R. Dechter und J. Pearl. Generalized Best-first Search Strategies and the Optimality of A*. J. ACM, 32(3):505–536, Juli 1985.