This is a project on learning, designing and analysing cache oblivious algorithms data structures and algorithms, and exploring their use in graph algorithms.
References:
1] An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms - 2006 (Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro)
2] Cache-Oblivious Algorithms - 1999 (Harald Prokop)