• DocumentCode
    2427804
  • Title

    Parallel algorithms for balancing threaded binary search trees

  • Author

    Haq, Enamul ; Zheng, Si-Qing

  • Author_Institution
    Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
  • fYear
    1989
  • fDate
    22-24 March 1989
  • Firstpage
    286
  • Lastpage
    290
  • Abstract
    Parallel algorithms for balancing any threaded binary search tree of 2/sup n-1/-1>
  • Keywords
    computational complexity; parallel algorithms; trees (mathematics); balancing; constant time complexity; parallel algorithms; threaded binary search trees; Arithmetic; Binary search trees; Computer science; Logic; Parallel algorithms; Read-write memory; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
  • Conference_Location
    Scottsdale, AZ, USA
  • Print_ISBN
    0-8186-1918-x
  • Type

    conf

  • DOI
    10.1109/PCCC.1989.37401
  • Filename
    37401
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2427804