Cited By
View all- Adamaszek ACzumaj AEnglert MRäcke H(2022)Almost Tight Bounds for Reordering Buffer ManagementSIAM Journal on Computing10.1137/20M132616751:3(701-722)Online publication date: 24-May-2022
- Albers SSchraink S(2020)Tight Bounds for Online Coloring of Basic Graph ClassesAlgorithmica10.1007/s00453-020-00759-783:1(337-360)Online publication date: 25-Aug-2020
- Englert MRacke HStotz R(2019)Polylogarithmic Guarantees for Generalized Reordering Buffer Management2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2019.00012(38-59)Online publication date: Nov-2019
- Show More Cited By