Author:
Demaine Erik D.,Gopal Vineet,Hasenplaugh William
Publisher
Springer International Publishing
Reference8 articles.
1. Arge, L., Bender, M.A., Demaine, E.D., Holland-Minkley, B., Munro, J.I.: Cache-oblivious priority queue and graph algorithm applications. In: STOC (2002)
2. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica (1972)
3. Bender, M.A., Demaine, E., Farach-Colton, M.: Cache-oblivious B-trees. In: FOCS, pp. 399–409 (2000)
4. Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: A comparison of sorting algorithms for the connection machine CM-2. In: SPAA (1991)
5. Lecture Notes in Computer Science;GS Brodal,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cache Oblivious Sparse Matrix Multiplication;LATIN 2018: Theoretical Informatics;2018