Dijkstra

E79781
academic computer scientist human software engineer

Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (6)

Label Occurrences
Dijkstra shortest path first algorithm 4
Dijkstra canonical 3
Dijkstra algorithm 2

Statements (63)

Predicate Object
instanceOf academic ⓘ
computer scientist ⓘ
human ⓘ
software engineer ⓘ
academicAdvisor Adriaan van Wijngaarden ⓘ
awardReceived ACM PODC Influential Paper Award (named in his honor) ⓘ
Turing Award ⓘ
surface form: ACM Turing Award

AFIPS Harry Goode Memorial Award ⓘ
IEEE Computer Society Computer Pioneer Award ⓘ
surface form: IEEE Computer Pioneer Award

Turing Award ⓘ
birthCountry Netherlands ⓘ
birthDate 1930-05-11 ⓘ
birthPlace Rotterdam ⓘ
burialPlace Netherlands ⓘ
citizenship Netherlands ⓘ
deathDate 2002-08-06 ⓘ
educatedAt University of Leiden ⓘ
surface form: Leiden University
employer Burroughs Corporation ⓘ
Eindhoven University of Technology ⓘ
University of Texas at Austin ⓘ
familyName Dijkstra self-link ⓘ
fieldOfWork algorithms ⓘ
computer science ⓘ
concurrent computing ⓘ
formal methods ⓘ
programming methodology ⓘ
software engineering ⓘ
givenName Edsger W. Dijkstra ⓘ
surface form: Edsger
hasAbbreviation Edsger W. Dijkstra ⓘ
surface form: EWD (for his manuscript series)
influenced concurrent programming ⓘ
formal verification ⓘ
programming methodology ⓘ
software engineering ⓘ
knownFor Dijkstra self-linksurface differs ⓘ
surface form: Dijkstra's shortest path algorithm

Edsger W. Dijkstra ⓘ
surface form: EWD manuscripts

THE multiprogramming system ⓘ
discipline of programming ⓘ
mutual exclusion algorithms ⓘ
semaphores ⓘ
structured programming ⓘ
weakest precondition calculus ⓘ
language Dutch ⓘ
English ⓘ
name Edsger W. Dijkstra ⓘ
surface form: Edsger Wybe Dijkstra
nationality Dutch ⓘ
notableConcept Banker's algorithm ⓘ
surface form: banker's algorithm

guarded commands ⓘ
mutual exclusion ⓘ
semaphore (programming) ⓘ
shunting-yard algorithm ⓘ
structured programming ⓘ
Hoare logic ⓘ
surface form: weakest precondition
notableWork A Discipline of Programming ⓘ
Notes on Structured Programming ⓘ
positionHeld Burroughs research fellow ⓘ
Schlumberger Centennial Chair in Computer Sciences ⓘ
professor of mathematics ⓘ
TuringAwardFor design of operating systems ⓘ
fundamental contributions to programming languages ⓘ
programming methodology ⓘ
TuringAwardYear 1972 ⓘ
workLocation Austin ⓘ
surface form: Austin, Texas

Eindhoven ⓘ

Referenced by (12)

Full triples — surface form annotated when it differs from this entity's canonical label.

Edsger W. Dijkstra → familyName → Dijkstra ⓘ
Edsger W. Dijkstra → knownFor → Dijkstra ⓘ
this entity surface form: Dijkstra's algorithm
OSPFv3 → uses → Dijkstra ⓘ
this entity surface form: Dijkstra shortest path first algorithm
IS-IS for IPv6 → uses → Dijkstra ⓘ
this entity surface form: Dijkstra shortest path first algorithm
Dijkstra → familyName → Dijkstra self-link ⓘ
Dijkstra → knownFor → Dijkstra self-linksurface differs ⓘ
this entity surface form: Dijkstra's shortest path algorithm
Rineke Dijkstra → familyName → Dijkstra ⓘ
OSPF → usesAlgorithm → Dijkstra ⓘ
this entity surface form: Dijkstra shortest path first algorithm
ISO 10589 → usesAlgorithm → Dijkstra ⓘ
this entity surface form: Dijkstra algorithm
RFC 1195 → uses → Dijkstra ⓘ
this entity surface form: Dijkstra shortest path first algorithm
RFC 5340 → usesAlgorithm → Dijkstra ⓘ
this entity surface form: Dijkstra shortest-path-first
Viterbi algorithm → relatedTo → Dijkstra ⓘ
this entity surface form: Dijkstra algorithm