R. Bayer and E. M. Mccreight, Organization and maintenance of large ordered indexes, Acta Informatica, vol.146, issue.3, pp.173-189, 1972.
DOI : 10.1007/BF00288683

J. Boyar, R. Fagerberg, and K. S. Larsen, Amortization Results for Chromatic Search Trees, with an Application to Priority Queues, Journal of Computer and System Sciences, vol.55, issue.3, pp.504-521, 1997.
DOI : 10.1006/jcss.1997.1511

J. Boyar and K. S. Larsen, Efficient rebalancing of chromatic search trees, Journal of Computer and System Sciences, vol.49, issue.3, pp.667-682, 1994.
DOI : 10.1016/S0022-0000(05)80075-3

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

R. I. Davis, Scheduling slack time in fixed priority preemptive systems, 1993.

L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pp.8-21, 1978.
DOI : 10.1109/SFCS.1978.3

S. Hanke, The Performance of Concurrent Red-Black Tree Algorithms, Algorithm Engineering, pp.287-301, 1999.
DOI : 10.1007/3-540-48318-7_23

D. Masson and S. Midonnet, Slack time evaluation with RTSJ, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.322-323, 2008.
DOI : 10.1145/1363686.1363769

URL : https://hal.archives-ouvertes.fr/hal-00620348

O. Nurmi and E. Soisalon-soininen, Uncoupling updating and rebalancing in chromatic binary search trees, Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '91, pp.192-198, 1991.
DOI : 10.1145/113413.113430

O. Nurmi and E. Soisalon-soininen, Chromatic binary search trees, Acta Informatica, vol.33, issue.6, pp.547-557, 1996.
DOI : 10.1007/s002360050057

S. R. Thuel and J. P. Lehoczky, Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing, Proceedings Real-Time Systems Symposium REAL-94, pp.22-33, 1994.
DOI : 10.1109/REAL.1994.342733

D. Wood, Data structures, algorithms, and performance, 1993.