Author:
Besa Juan,Eterovic Yadran
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference12 articles.
1. Efficient rebalancing of chromatic search trees;Boyar;Journal of Computer and System Sciences,1994
2. A practical concurrent binary search tree;Bronson;SIGPLAN Notices,2010
3. L.J. Guibas, R. Sedgewick, A dichromatic framework for balanced trees, in: Proceedings of the 19th IEEE Symp. Foundations of Computer Science, Ann Arbor, MI, USA, 1978, pp. 8–21.
4. The performance of concurrent red–black tree algorithms;Hanke,1999
5. Relaxed balanced red–black trees;Hanke;Lecture Notes in Computer Science,1997
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献