Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Aoe J. (1990). A compendium of key search references. ACM SIGIR Forum. 24:3. (26-42). Online publication date: 1-Nov-1990.

    https://doi.org/10.1145/101306.101308

  • Gonnet G. (1983). Balancing binary trees by internal path reduction. Communications of the ACM. 26:12. (1074-1081). Online publication date: 1-Dec-1983.

    https://doi.org/10.1145/358476.358509

  • Leeuwen J and Overmars M. (1983). Stratified balanced search trees. Acta Informatica. 18:4. (345-359). Online publication date: 1-Jan-1983.

    https://doi.org/10.1007/BF00289574

  • Wong C. (1983). Magnetic Bubble Memory. Algorithmic Studies in Mass Storage Systems. 10.1007/978-3-642-69352-6_3. (225-406).

    http://link.springer.com/10.1007/978-3-642-69352-6_3

  • Bongiovanni G and Wong C. (1981). Tree Search in Major/Minor Loop Magnetic Bubble Memories. IEEE Transactions on Computers. 30:8. (537-545). Online publication date: 1-Aug-1981.

    https://doi.org/10.1109/TC.1981.1675838

  • Gudes E and Ganesh S. (1981). A Survey of File Organizations and Performance. Advances in Information Systems Science. 10.1007/978-1-4613-9883-7_1. (1-73).

    http://link.springer.com/10.1007/978-1-4613-9883-7_1

  • Ottmann T, Six H and Wood D. (1979). One-sided k-height-balanced treesEinseitigk-höhenbalanzierte Bäume. Computing. 10.1007/BF02265310. 22:4. (283-290). Online publication date: 1-Dec-1979.

    http://link.springer.com/10.1007/BF02265310

  • Räihä K and Zweben S. (1979). An optimal insertion algorithm for one-sided height-balanced binary search trees. Communications of the ACM. 22:9. (508-512). Online publication date: 1-Sep-1979.

    https://doi.org/10.1145/359146.359149

  • Vaishnavi V, Kriegel H and Wood D. (1979). Height balanced 2–3 treesHöhenbalancierte 2–3 Bäume. Computing. 10.1007/BF02253053. 21:3. (195-211). Online publication date: 1-Sep-1979.

    http://link.springer.com/10.1007/BF02253053

  • Ottmann T, Six H and Wood D. (1978). Right brother trees. Communications of the ACM. 21:9. (769-776). Online publication date: 1-Sep-1978.

    https://doi.org/10.1145/359588.359607

  • Wood D. (1978). One-sided height-balanced search trees. ACM SIGACT News. 10:2. (60-62). Online publication date: 1-Jul-1978.

    https://doi.org/10.1145/990524.990532