Author:
Babka Martin,Bulánek Jan,Čunát Vladimír,Koucký Michal,Saks Michael
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bulánek, J., Koucký, M., Saks, M.: Tight lower bounds for the online labeling problem. In: Karloff, H.J., Pitassi, T. (eds.) Proc. of 66th Symp. of Theory of Computation (STOC 2012), pp. 1185–1198. ACM (2012)
2. Lecture Notes in Computer Science;M.A. Bender,2002
3. Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious b-trees. Journal on Computing 35(2), 341–358 (2005)
4. Bender, M.A., Duan, Z., Iacono, J., Wu, J.: A locality-preserving cache-oblivious dynamic dictionary. Journal of Algorithms 53(2), 115–136 (2004)
5. Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: Eppstein, D. (ed.) Proc. of 13th ACM-SIAM Symp. on Discrete Algorithms. SODA, pp. 39–48. ACM/SIAM (2002)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online List Labeling: Breaking the \({\log^2 n}\) Barrier;SIAM Journal on Computing;2024-04-11
2. Online List Labeling: Breaking the log2n Barrier;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. On Online Labeling with Large Label Set;SIAM Journal on Discrete Mathematics;2019-01
4. Online Labeling: Algorithms, Lower Bounds and Open Questions;Computer Science – Theory and Applications;2018
5. Tight Lower Bounds for the Online Labeling Problem;SIAM Journal on Computing;2015-01