Author:
Brodal Gerth Stølting,Nielsen Jesper Sindahl,Truelsen Jakob
Publisher
Springer International Publishing
Reference12 articles.
1. Lecture Notes in Computer Science;GS Brodal,2013
2. Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 39–48 (2002)
3. Lecture Notes in Computer Science;GS Brodal,2012
4. Brodal, G.S., Nielsen, J.S., Truelsen, J.: Strictly implicit priority queues: On the number of moves and worst-case time (2015). CoRR, abs/1505.00147
5. Lecture Notes in Computer Science;S Carlsson,1988
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimizing Binary Heaps;Theory of Computing Systems;2017-04-21