Cooperating Sequential Processes

 Home > Browse Our Collection > Books > Technological University Eindhoven > Cooperating Sequential Processes
 

This is a book relating to a series of lectures which were intended to teach those who wanted to be involved in the problems that arise in either the design or the more advanced applications of digital information processing equipment. 

Edsger Dijkstra came up with 'Dijkstra's algorithm' which is used for finding the shortest path between nodes on a graph. 

We are extremely grateful to both Dawn and Kim Wakefield for the kind donation of the collection of their late father Richard Wakefield

ISBN :

Publisher : Technological University Eindhoven

Author : Prof. Dr. E. W. Dijkstra

Format : Paperback

This exhibit has a reference ID of CH15637. Please quote this reference ID in any communication with the Centre for Computing History.
 
Cooperating Sequential Processes Click on the Images For Detail

Help support the museum by buying from the museum shop

View all items

Founding Sponsors
redgate Google ARM Real VNC Microsoft Research
Heritage Lottery Funded
Heritage Lottery Fund
Accredited Museum