Red–black tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Red–black tree" in English language version.

Last modified: 22:47:40, 12 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1611doi.org

2^nd place

74princeton.edu

802^nd place

528^th place

65semanticscholar.org

15^th place

8^th place

64archive.org

6^th place

41mpg.de

1,722^nd place

1,710^th place

33web.archive.org

1^st place

32arxiv.org

49^th place

31^st place

21gnu.org

1,901^st place

1,743^rd place

21cmu.edu

2,125^th place

1,347^th place

11wisc.edu

891^st place

533^rd place

11auckland.ac.nz

3,907^th place

2,379^th place

11coursera.org

low place

11stackexchange.com

4,114^th place

3,027^th place

11springer.com

182^nd place

172^nd place

11uu.se

3,445^th place

3,148^th place

11worldcat.org

4^th place

11sedgewick.io

low place

11ibm.com

1,369^th place

968^th place

11idndx.com

low place

11stanford.edu

194^th place

182^nd place

11erikdemaine.org

low place

11coding-geek.com

low place

11duke.edu

1,851^st place

1,041^st place

11zbmath.org

2,089^th place

1,141^st place

archive.org (Global: 6^th place; English: 6^th place)

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Red–Black Trees". Introduction to Algorithms (2nd ed.). MIT Press. pp. 273–301. ISBN 978-0-262-03293-3.
Sedgewick, Robert (1983). Algorithms (1st ed.). Addison-Wesley. ISBN 978-0-201-06672-2.
Cormen, Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2022). "13. Red–Black Trees". Introduction to Algorithms (4th ed.). MIT Press. pp. 331–332. ISBN 978-0-262-04630-5.
Sedgewick, Robert (1998). Algorithms in C++. Addison-Wesley Professional. pp. 565–575. ISBN 978-0-201-35088-3.

arxiv.org (Global: 49^th place; English: 31^st place)

Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016). "Just Join for Parallel Ordered Sets" (PDF). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 253–264. arXiv:1602.02120. doi:10.1145/2935764.2935768. ISBN 978-1-4503-4210-0. S2CID 2897793..
Akhremtsev, Yaroslav; Sanders, Peter (2016). "Fast Parallel Operations on Search Trees". 2016 IEEE 23rd International Conference on High Performance Computing (HiPC). pp. 291–300. arXiv:1510.05433. doi:10.1109/HiPC.2016.042. ISBN 978-1-5090-5411-4.

auckland.ac.nz (Global: 3,907^th place; English: 2,379^th place)

cs.auckland.ac.nz

Morris, John (1998). "Red–Black Trees". Data Structures and Algorithms.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016). "Just Join for Parallel Ordered Sets" (PDF). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 253–264. arXiv:1602.02120. doi:10.1145/2935764.2935768. ISBN 978-1-4503-4210-0. S2CID 2897793..

coding-geek.com (Global: low place; English: low place)

"How does a HashMap work in JAVA". coding-geek.com.

coursera.org (Global: low place; English: low place)

Sedgewick, Robert (2012). Red–Black BSTs. Coursera. A lot of people ask why did we use the name red–black. Well, we invented this data structure, this way of looking at balanced trees, at Xerox PARC that was the home of the personal computer and many other innovations that we live with today entering[sic] graphic user interfaces, Ethernet and object-oriented programmings[sic] and many other things. But one of the things that was invented there was laser printing and we were very excited to have nearby color laser printer that could print things out in color and out of the colors the red looked the best. So, that's why we picked the color red to distinguish red links, the types of links, in three nodes. So, that's an answer to the question for people that have been asking.

doi.org (Global: 2^nd place; English: 2^nd place)

Bayer, Rudolf (1972). "Symmetric binary B-Trees: Data structure and maintenance algorithms". Acta Informatica. 1 (4): 290–306. doi:10.1007/BF00289509. S2CID 28836825.
Guibas, Leonidas J.; Sedgewick, Robert (1978). "A Dichromatic Framework for Balanced Trees". Proceedings of the 19th Annual Symposium on Foundations of Computer Science. pp. 8–21. doi:10.1109/SFCS.1978.3.
Andersson, Arne (1993-08-11). "Balanced search trees made simple". In Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue (eds.). Algorithms and Data Structures (Proceedings). Lecture Notes in Computer Science. Vol. 709. Springer-Verlag Berlin Heidelberg. pp. 60–71. doi:10.1007/3-540-57155-8_236. ISBN 978-3-540-57155-1. Archived from the original on 2018-12-08. Alt URL
Okasaki, Chris (1999-01-01). "Red–black trees in a functional setting". Journal of Functional Programming. 9 (4): 471–477. doi:10.1017/S0956796899003494. ISSN 1469-7653. S2CID 20298262.
Mehlhorn, Kurt; Sanders, Peter (2008). "7. Sorted Sequences" (PDF). Algorithms and Data Structures: The Basic Toolbox. Berlin/Heidelberg: Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.
Demaine, E. D.; Harmon, D.; Iacono, J.; Pătraşcu, M. (2007). "Dynamic Optimality—Almost" (PDF). SIAM Journal on Computing. 37 (1): 240. doi:10.1137/S0097539705447347. S2CID 1480961.
Tarjan, Robert Endre (April 1985). "Amortized Computational Complexity" (PDF). SIAM Journal on Algebraic and Discrete Methods. 6 (2): 306–318. doi:10.1137/0606031.
Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016). "Just Join for Parallel Ordered Sets" (PDF). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 253–264. arXiv:1602.02120. doi:10.1145/2935764.2935768. ISBN 978-1-4503-4210-0. S2CID 2897793..
Park, Heejin; Park, Kunsoo (2001). "Parallel algorithms for red–black trees". Theoretical Computer Science. 262 (1–2): 415–435. doi:10.1016/S0304-3975(00)00287-5. Our parallel algorithm for constructing a red–black tree from a sorted list of $n$ items runs in $O(1)$ time with $n$ processors on the CRCW PRAM and runs in $O(\log \log n)$ time with $n/\log \log n$ processors on the EREW PRAM.
Sanders, Peter (2019). Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (eds.). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer eBooks. Cham: Springer. pp. 252–253. doi:10.1007/978-3-030-25209-0. ISBN 978-3-030-25209-0. S2CID 201692657.
Akhremtsev, Yaroslav; Sanders, Peter (2016). "Fast Parallel Operations on Search Trees". 2016 IEEE 23rd International Conference on High Performance Computing (HiPC). pp. 291–300. arXiv:1510.05433. doi:10.1109/HiPC.2016.042. ISBN 978-1-5090-5411-4.

duke.edu (Global: 1,851^st place; English: 1,041^st place)

cs.duke.edu

Tarjan, Robert Endre (April 1985). "Amortized Computational Complexity" (PDF). SIAM Journal on Algebraic and Discrete Methods. 6 (2): 306–318. doi:10.1137/0606031.

erikdemaine.org (Global: low place; English: low place)

Demaine, E. D.; Harmon, D.; Iacono, J.; Pătraşcu, M. (2007). "Dynamic Optimality—Almost" (PDF). SIAM Journal on Computing. 37 (1): 240. doi:10.1137/S0097539705447347. S2CID 1480961.

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

ftp.gnu.org

The same partitioning is found in Ben Pfaff. Ben Pfaff: An Introduction to Binary Search Trees and Balanced Trees. Free Software Foundation, Boston 2004, ftp.gnu.org (PDF gzip; 1662 kB)

ibm.com (Global: 1,369^th place; English: 968^th place)

developer.ibm.com

"IBM Developer". developer.ibm.com. Retrieved 25 May 2024.

idndx.com (Global: low place; English: low place)

"The Implementation of epoll (1)". Datong's Random Thoughts. September 2014. Archived from the original on 2020-10-11. Retrieved 2018-06-25.

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). "7. Sorted Sequences" (PDF). Algorithms and Data Structures: The Basic Toolbox. Berlin/Heidelberg: Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.

princeton.edu (Global: 802^nd place; English: 528^th place)

algs4.cs.princeton.edu

Sedgewick, Robert; Wayne, Kevin. "RedBlackBST.java". algs4.cs.princeton.edu. Retrieved 7 April 2018.
Sedgewick, Robert; Wayne, Kevin (2011). Algorithms (4th ed.). Addison-Wesley Professional. ISBN 978-0-321-57351-3.

cs.princeton.edu

"Robert Sedgewick" (PDF). Cs.princeton.edu. 4 June 2020. Retrieved 26 March 2022.
"Balanced Trees" (PDF). Cs.princeton.edu. Retrieved 26 March 2022.

sedgewick.io (Global: low place; English: low place)

Sedgewick, Robert (2008). "Left-leaning Red–Black Trees" (PDF).

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Bayer, Rudolf (1972). "Symmetric binary B-Trees: Data structure and maintenance algorithms". Acta Informatica. 1 (4): 290–306. doi:10.1007/BF00289509. S2CID 28836825.
Okasaki, Chris (1999-01-01). "Red–black trees in a functional setting". Journal of Functional Programming. 9 (4): 471–477. doi:10.1017/S0956796899003494. ISSN 1469-7653. S2CID 20298262.
Demaine, E. D.; Harmon, D.; Iacono, J.; Pătraşcu, M. (2007). "Dynamic Optimality—Almost" (PDF). SIAM Journal on Computing. 37 (1): 240. doi:10.1137/S0097539705447347. S2CID 1480961.
Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016). "Just Join for Parallel Ordered Sets" (PDF). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 253–264. arXiv:1602.02120. doi:10.1145/2935764.2935768. ISBN 978-1-4503-4210-0. S2CID 2897793..
Sanders, Peter (2019). Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (eds.). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer eBooks. Cham: Springer. pp. 252–253. doi:10.1007/978-3-030-25209-0. ISBN 978-3-030-25209-0. S2CID 201692657.

springer.com (Global: 182^nd place; English: 172^nd place)

Andersson, Arne (1993-08-11). "Balanced search trees made simple". In Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue (eds.). Algorithms and Data Structures (Proceedings). Lecture Notes in Computer Science. Vol. 709. Springer-Verlag Berlin Heidelberg. pp. 60–71. doi:10.1007/3-540-57155-8_236. ISBN 978-3-540-57155-1. Archived from the original on 2018-12-08. Alt URL

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

programmers.stackexchange.com

"Where does the term "Red/Black Tree" come from?". programmers.stackexchange.com. Retrieved 2015-09-02.

stanford.edu (Global: 194^th place; English: 182^nd place)

Pfaff 2004 Pfaff, Ben (June 2004). "Performance Analysis of BSTs in System Software" (PDF). Stanford University.

uu.se (Global: 3,445^th place; English: 3,148^th place)

user.it.uu.se

Andersson, Arne (1993-08-11). "Balanced search trees made simple". In Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue (eds.). Algorithms and Data Structures (Proceedings). Lecture Notes in Computer Science. Vol. 709. Springer-Verlag Berlin Heidelberg. pp. 60–71. doi:10.1007/3-540-57155-8_236. ISBN 978-3-540-57155-1. Archived from the original on 2018-12-08. Alt URL

web.archive.org (Global: 1^st place; English: 1^st place)

"Red Black Trees". eternallyconfuzzled.com. Archived from the original on 2007-09-27. Retrieved 2015-09-02.
Andersson, Arne (1993-08-11). "Balanced search trees made simple". In Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue (eds.). Algorithms and Data Structures (Proceedings). Lecture Notes in Computer Science. Vol. 709. Springer-Verlag Berlin Heidelberg. pp. 60–71. doi:10.1007/3-540-57155-8_236. ISBN 978-3-540-57155-1. Archived from the original on 2018-12-08. Alt URL
"The Implementation of epoll (1)". Datong's Random Thoughts. September 2014. Archived from the original on 2020-10-11. Retrieved 2018-06-25.

wisc.edu (Global: 891^st place; English: 533^rd place)

pages.cs.wisc.edu

Paton, James. "Red–Black Trees".

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Okasaki, Chris (1999-01-01). "Red–black trees in a functional setting". Journal of Functional Programming. 9 (4): 471–477. doi:10.1017/S0956796899003494. ISSN 1469-7653. S2CID 20298262.

zbmath.org (Global: 2,089^th place; English: 1,141^st place)

Jájá, Joseph (1992). An introduction to parallel algorithms. Reading, Mass. [u.a.]: Addison-Wesley. pp. 65–70. ISBN 0-201-54856-9. Zbl 0781.68009.

Red–black tree (English Wikipedia)

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

auckland.ac.nz (Global: 3,907th place; English: 2,379th place)

cs.auckland.ac.nz

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

coding-geek.com (Global: low place; English: low place)

coursera.org (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

duke.edu (Global: 1,851st place; English: 1,041st place)

cs.duke.edu

erikdemaine.org (Global: low place; English: low place)

gnu.org (Global: 1,901st place; English: 1,743rd place)

ftp.gnu.org

ibm.com (Global: 1,369th place; English: 968th place)

developer.ibm.com

idndx.com (Global: low place; English: low place)

mpg.de (Global: 1,722nd place; English: 1,710th place)

people.mpi-inf.mpg.de

princeton.edu (Global: 802nd place; English: 528th place)

algs4.cs.princeton.edu

cs.princeton.edu

sedgewick.io (Global: low place; English: low place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 182nd place; English: 172nd place)

stackexchange.com (Global: 4,114th place; English: 3,027th place)

programmers.stackexchange.com

stanford.edu (Global: 194th place; English: 182nd place)

uu.se (Global: 3,445th place; English: 3,148th place)

user.it.uu.se

web.archive.org (Global: 1st place; English: 1st place)

wisc.edu (Global: 891st place; English: 533rd place)

pages.cs.wisc.edu

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

zbmath.org (Global: 2,089th place; English: 1,141st place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

auckland.ac.nz (Global: 3,907^th place; English: 2,379^th place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

duke.edu (Global: 1,851^st place; English: 1,041^st place)

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

ibm.com (Global: 1,369^th place; English: 968^th place)

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

springer.com (Global: 182^nd place; English: 172^nd place)

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

stanford.edu (Global: 194^th place; English: 182^nd place)

uu.se (Global: 3,445^th place; English: 3,148^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

wisc.edu (Global: 891^st place; English: 533^rd place)

worldcat.org (Global: 4^th place; English: 4^th place)

zbmath.org (Global: 2,089^th place; English: 1,141^st place)