This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
February 2007 (vol. 8 no. 2)
pp. 1
A Jerusalem College of Technology course teaches flexible algorithms to beginning computer science students. In this department, the author describes the notation?s main features and presents fragments from the course.
Index Terms:
flexible algorithms, parallelism, sequential algorithms
Citation:
R.B. Yehezkael, "Flexible Algorithms: Fragments from a Beginners' Course," IEEE Distributed Systems Online, vol. 8, no. 2, pp. 1, Feb. 2007, doi:10.1109/MDSO.2007.9
Usage of this product signifies your acceptance of the Terms of Use.