BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
monad (1)
simul (1)
floyd (1)
network (1)
primit (1)

Stem dijkstra$ (all stems)

5 papers:

PLDIPLDI-2013-SwamyWSCL #higher-order #monad #source code #verification
Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
CASECASE-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.
SACSAC-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.
ASEKBSE-1992-Terwilliger #design #process #simulation
Simulating the Gries/Dijkstra Design Process (RBT), p. 22.
SOSPSOSP-1973-Kosaraju #petri net
Limitations of Dijkstra’s Semaphore Primitives and Petri Nets (SRK), pp. 122–136.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.