{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:03:37Z","timestamp":1769846617942,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00236-023-00452-6","type":"journal-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T09:02:08Z","timestamp":1711702928000},"page":"199-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting 2\u20133 red\u2013black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6043-1820","authenticated-orcid":false,"given":"Kamaledin","family":"Ghiasi-Shirazi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4561-827X","authenticated-orcid":false,"given":"Taraneh","family":"Ghandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Taghizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Rahimi-Baigi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"452_CR1","doi-asserted-by":"publisher","unstructured":"Andersson, A.: Balanced search trees made simple. In: Workshop on Algorithms and Data Structures. Springer, pp. 60\u201371 (1993) https:\/\/doi.org\/10.1007\/3-540-57155-8_236","DOI":"10.1007\/3-540-57155-8_236"},{"issue":"2","key":"452_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01237235","volume":"28","author":"A Andersson","year":"1990","unstructured":"Andersson, A., Icking, C., Klein, R., et al.: Binary search trees of almost optimal height. Acta Inform. 28(2), 165\u2013178 (1990). https:\/\/doi.org\/10.1007\/BF01237235","journal-title":"Acta Inform."},{"key":"452_CR3","doi-asserted-by":"publisher","unstructured":"Bayer, R,: Binary B-trees for virtual memory. In: Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, pp. 219\u2013235 (1971). https:\/\/doi.org\/10.1145\/1734714.1734731","DOI":"10.1145\/1734714.1734731"},{"issue":"4","key":"452_CR4","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inform. 1(4), 290\u2013306 (1972). https:\/\/doi.org\/10.1007\/BF00289509","journal-title":"Acta Inform."},{"key":"452_CR5","doi-asserted-by":"publisher","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, pp. 107\u2013141 (1970). https:\/\/doi.org\/10.1145\/1734663.1734671","DOI":"10.1145\/1734663.1734671"},{"issue":"3","key":"452_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Inform. 1(3), 173\u2013189 (1972). https:\/\/doi.org\/10.1007\/BF00288683","journal-title":"Acta Inform."},{"issue":"4","key":"452_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.jpdc.2012.12.010","volume":"73","author":"J Besa","year":"2013","unstructured":"Besa, J., Eterovic, Y.: A concurrent red\u2013black tree. J. Parallel Distrib. Comput. 73(4), 434\u2013449 (2013). https:\/\/doi.org\/10.1016\/j.jpdc.2012.12.010","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"452_CR8","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/S0022-0000(05)80075-3","volume":"49","author":"J Boyar","year":"1994","unstructured":"Boyar, J., Larsen, K.S.: Efficient rebalancing of chromatic search trees. J. Comput. Syst. Sci. 49(3), 667\u2013682 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80075-3","journal-title":"J. Comput. Syst. Sci."},{"key":"452_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., et al.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"issue":"4","key":"452_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0956796814000227","volume":"24","author":"K Germane","year":"2014","unstructured":"Germane, K., Might, M.: Deletion: the curse of the red\u2013black tree. J. Funct. Program. 24(4), 423\u2013433 (2014). https:\/\/doi.org\/10.1017\/S0956796814000227","journal-title":"J. Funct. Program."},{"key":"452_CR11","doi-asserted-by":"publisher","unstructured":"Guibas, LJ., Sedgewick, R.: A dichromatic framework for balanced trees. In: 19th Annual Symposium on Foundations of Computer Science (1979), IEEE, pp. 8\u201321 (1978). https:\/\/doi.org\/10.1109\/SFCS.1978.3","DOI":"10.1109\/SFCS.1978.3"},{"issue":"16","key":"452_CR12","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1002\/cpe.3157","volume":"26","author":"PW Howard","year":"2014","unstructured":"Howard, P.W., Walpole, J.: Relativistic red\u2013black trees. Concurr. Comput. Pract. Exp. 26(16), 2684\u20132712 (2014). https:\/\/doi.org\/10.1002\/cpe.3157","journal-title":"Concurr. Comput. Pract. Exp."},{"issue":"8","key":"452_CR13","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00236-002-0086-3","volume":"38","author":"KS Larsen","year":"2002","unstructured":"Larsen, K.S.: Relaxed red\u2013black trees with group updates. Acta Inform. 38(8), 565\u2013586 (2002). https:\/\/doi.org\/10.1007\/s00236-002-0086-3","journal-title":"Acta Inform."},{"issue":"4","key":"452_CR14","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1017\/S0956796899003494","volume":"9","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Red\u2013black trees in a functional setting. J. Funct. Program. 9(4), 471\u2013477 (1999). https:\/\/doi.org\/10.1017\/S0956796899003494","journal-title":"J. Funct. Program."},{"issue":"1\u20132","key":"452_CR15","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0304-3975(00)00287-5","volume":"262","author":"H Park","year":"2001","unstructured":"Park, H., Park, K.: Parallel algorithms for red\u2013black trees. Theor. Comput. Sci. 262(1\u20132), 415\u2013435 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00287-5","journal-title":"Theor. Comput. Sci."},{"key":"452_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2012.11.027","volume":"482","author":"S Roura","year":"2013","unstructured":"Roura, S.: Fibonacci BSTs: a new balancing method for binary search trees. Theor. Comput. Sci. 482, 48\u201359 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.11.027","journal-title":"Theor. Comput. Sci."},{"key":"452_CR17","unstructured":"Sedgewick, R.: Left-leaning red\u2013black trees. In: Dagstuhl Workshop on Data Structures, p. 17 (2008). https:\/\/sedgewick.io\/wp-content\/themes\/sedgewick\/papers\/2008LLRB.pdf"},{"issue":"4","key":"452_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2903142","volume":"12","author":"S Sen","year":"2016","unstructured":"Sen, S., Tarjan, R.E., Kim, D.H.K.: Deletion without rebalancing in binary search trees. ACM Trans. Algorithms 12(4), 1\u201331 (2016). https:\/\/doi.org\/10.1145\/2903142","journal-title":"ACM Trans. Algorithms"},{"key":"452_CR19","unstructured":"Wayne, K., Sedgewick, R.: Algorithms, part I. (2012). https:\/\/www.coursera.org\/learn\/algorithms-part1"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00452-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-023-00452-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00452-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T10:02:56Z","timestamp":1723629776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-023-00452-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,29]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s00236-023-00452-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,29]]},"assertion":[{"value":"21 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}