Search trees and bubble memories
RAIRO. Informatique théorique, Volume 19 (1985) no. 2, pp. 137-164.
     author = {Flajolet, Philippe and Ottmann, Thomas and Wood, Derick},
     title = {Search trees and bubble memories},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {137--164},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {2},
     year = {1985},
     mrnumber = {803995},
     zbl = {0569.68051},
     language = {en},
     url = {}
AU  - Flajolet, Philippe
AU  - Ottmann, Thomas
AU  - Wood, Derick
TI  - Search trees and bubble memories
JO  - RAIRO. Informatique théorique
PY  - 1985
SP  - 137
EP  - 164
VL  - 19
IS  - 2
PB  - EDP-Sciences
UR  -
LA  - en
ID  - ITA_1985__19_2_137_0
ER  - 
%0 Journal Article
%A Flajolet, Philippe
%A Ottmann, Thomas
%A Wood, Derick
%T Search trees and bubble memories
%J RAIRO. Informatique théorique
%D 1985
%P 137-164
%V 19
%N 2
%I EDP-Sciences
%G en
%F ITA_1985__19_2_137_0
Flajolet, Philippe; Ottmann, Thomas; Wood, Derick. Search trees and bubble memories. RAIRO. Informatique théorique, Volume 19 (1985) no. 2, pp. 137-164.

W. F. Beausoleil, D. T. Brown and B. E. Phelps, Magnetic Bubble Memory Organization, IBM Journal of Research and Development, vol. 16, 1972, pp. 587-591.

G. Bongiovanni and C. K. Wong, Tree Search in Major/Minor Loop Magnetic Bubble Memories IEEE Transactions on Computers, C-30, 1981, pp. 537-545. | MR | Zbl

P. I. Bonyhard and T. J. Nelson, Dynamic Data Reallocation in Bubble Memories, The Bell System Technical Journal, Vol. 52, 1973, pp. 307-317.

A. K. Chandra and C. K. Wong, The Movement and Permutation of Columns in Magnetic Bubble Lattice Files, IEEE Transactions on Computers, C-27, 1979, pp. 8-15. | Zbl

K. M. Chung, F. Luccio and C. K. Wong, A Tree Storage Scheme for Magnetic Bubble Memories, IEEE Transactions on Computers, C-29, 1980, pp. 553-562. | MR

K. M. Chung, F. Luccio and C. K. Wong, A New Permutation Algorithm for Bubble Memories, Information Processing Letters, Vol. 10, 1980. pp. 226-230. | MR | Zbl

R. E. Fairley, Random Entry Searching of Binary Trees, University of Colorado, Boulder, Computer Science Report CU-CS-035-73, 1973.

P. Flajolet, Analyse d'Algorithms de Manipulation d'Arbres et de Fichiers, Cahiers du B.U.R.O., Nos. 34-35, Paris, 1981.

P. Flajolet and A. Odlyzko, The Average Height of Binary Trees and Other Simple Trees, Journal of Computer and System Sciences, Vol. 25, 1982, pp. 171-213. | MR | Zbl

J. Francon, Combinatoire des Structures de Données, Doctoral dissertation, Université de Strasbourg, 1979.

D. E. Knuth, The Art of Computer Programming, Vol. I: Fundamental Algorithms, Addison-Wesley Publishing Co., Reading, Mass., 1968. | MR

J. Mühlbacher, Private communication, 1982.

A. L. Rosenberg, Data Encoding and Their Costs, Acta Informatica, Vol. 9, 1978, pp. 273-292. | MR | Zbl

A. L. Rosenberg and L. Snyder, Bounds on the Costs of Data Encodings, Mathematical Systems Theory, Vol. 12, 1978, pp. 9-39. | MR | Zbl

T. A. Standish, Data Structure Techniques, Addison-Wesley Publishing Co., Reading, Mass., 1980.

V. K. Vaishnavi and D. Wood, Encoding Search Trees in Lists, International Journal of Computer Mathematics, Vol. 10, 1982, pp. 237-246. | MR | Zbl

J. Vuillemin, A Unifying Look at Data Structures, Communications of the ACM, 28, 1980, pp. 229-239. | MR | Zbl

C. K. Wong, Algorithmic Studies in Mass Storage Systems, Springer-Verlag, Berlin, Heidelberg; New York, 1983. | MR | Zbl