Jump to content

Talk:Timeline of algorithms

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mat-C (talk | contribs) at 22:26, 21 July 2004 (added turbo codes note). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

should add some important geometrical constructs such as besecting an angle, calculating the golden ratio, finding the centre of a polygon



I added "wait-free synchronization" to the list. I didn't even know it was possible until 2004. I stuck it at 1991, since that's the earliest paper I've seen so far:

Wait-Free Synchronization by Maurice Herlihy (1993) http://citeseer.ist.psu.edu/herlihy93waitfree.html (Is this the same as "Wait-Free Synchronization" by Maurice Herlihy (1991) _ACM Transactions on Programming Languages and Systems_ January 1991 ? ) http://c2.com/cgi/wiki?WaitFreeSynchronization

If anyone knows an earlier reference, please tell me and/or fix the article and drop a reference here. -- DavidCary 05:21, 30 May 2004 (UTC)[reply]


Other algorithms to add:

  • Bezier spline (?)
  • Do neural networks have a place here ?
  • The neural network back-propagation algorithm
  • Public-key encryption
  • Hamming codes
  • Reed-Solomon encoding (used by NASA to communicate with deep space probes; used by every audio CD player)
  • ...
  • ...

-- DavidCary 03:23, 2 Jun 2004 (UTC)

Turbo Codes too! - Used by NASA on more recent probes, and have stimulated research into repetitive/recursive decoding). Nice example of recent ground-breaking work. Mat-C 22:26, 21 Jul 2004 (UTC)