1. 2010. Graph500. http://www.graph500.org. 2010. Graph500. http://www.graph500.org.
2. Masab Ahmad Halit Dogan and Omer Khan. 2019. Speculative Task Parallel Algorithm for Single Source Shortest Path. (2019). Masab Ahmad Halit Dogan and Omer Khan. 2019. Speculative Task Parallel Algorithm for Single Source Shortest Path. (2019).
3. Group formation in large social networks
4. Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics 16, 1 ( 1958 ), 87–90. Richard Bellman. 1958. On a routing problem. Quarterly of applied mathematics 16, 1 (1958), 87–90.
5. Mariusz Bojarski , Davide Del Testa , Daniel Dworakowski , Bernhard Firner , Beat Flepp , Prasoon Goyal , Lawrence D Jackel , Mathew Monfort , Urs Muller , Jiakai Zhang , 2016. End to end learning for self-driving cars. arXiv preprint arXiv:1604.07316 (04 2016 ). Mariusz Bojarski, Davide Del Testa, Daniel Dworakowski, Bernhard Firner, Beat Flepp, Prasoon Goyal, Lawrence D Jackel, Mathew Monfort, Urs Muller, Jiakai Zhang, 2016. End to end learning for self-driving cars. arXiv preprint arXiv:1604.07316 (04 2016).