5 papers:
PLDI-2013-SwamyWSCL #higher-order #monad #source code #verification- Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
CASE-2012-LiuSJT #automation #hybrid #mobile- A Floyd-Dijkstra hybrid application for mobile robot path planning in life science automation (HL, NS, SJ, KT), pp. 279–284.
SAC-2006-AlmeidaG #algorithm #database #incremental #nearest neighbour #network #using- Using Dijkstra’s algorithm to incrementally find the k-Nearest Neighbors in spatial network databases (VTdA, RHG), pp. 58–62.
KBSE-1992-Terwilliger #design #process #simulation- Simulating the Gries/Dijkstra Design Process (RBT), p. 22.
SOSP-1973-Kosaraju #petri net- Limitations of Dijkstra’s Semaphore Primitives and Petri Nets (SRK), pp. 122–136.
