Red-black Trees

Red-Black Trees is a self-balancing binary search tree in which each node is assigned a color (red or black) and constrained by specific coloring rules to ensure logarithmic height and efficient dynamic set operations.

50

Publications

3.5K

Citations

103

Authors

66

Institutions

Publications per year

2017–2026

6

Authors

103

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    4 publications · 121 citations

    4

    h-index

  2. WV
    Willem Visser

    Stellenbosch University, South Africa

    3 publications · 637 citations

    3

    h-index

  3. BE
    Bor-Yuh Evan Chang

    University of Colorado Boulder, United States

    3 publications · 199 citations

    3

    h-index

  4. SK
    Sarfraz Khurshid

    The University of Texas at Austin, United States

    3 publications · 875 citations

    3

    h-index

  5. CS
    Corina S. Păsăreanu

    Ames Research Center, United States

    3 publications · 637 citations

    3

    h-index

1–5 of 103

Venues

  1. ACM SIGPLAN Notices

    4 publications · 119 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 45 citations

    2

    h-index

  3. Journal of Functional Programming

    2 publications · 139 citations

    2

    h-index

  4. 2

    h-index

  5. International Journal of Foundations of Computer Science

    IJFCS · 1 publications · 20 citations

    1

    h-index

1–5