According to Leslie Lamport (2002), Dijkstra "started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem." Source: Internet
ActiveTrack 3.0 selects a subject to follow automatically, employing 3D mapping tech and revamped path-finding algorithms to better recognize subjects, avoid obstacles, and re-engage when subjects occlude. Source: Internet
According to a NIST retrospective about DES, :The DES can be said to have "jump started" the nonmilitary study and development of encryption algorithms. Source: Internet
A complete description of the algorithms can be found in Burrows and Wheeler's paper, or in a number of online sources. Source: Internet
Additionally, some cryptographic algorithms have export restrictions (see export of cryptography ). Source: Internet
Additionally, this result implies that proving independence from PA or ZFC using currently known techniques is no easier than proving the existence of efficient algorithms for all problems in NP. Source: Internet