Algorithm

From Scholarpedia

Public election of authors

Please, vote for the candidate(s) whom you would like to write this article (or whose version of the article you would like to read). Your vote is anonymous. You are not logged in. Your vote will be assigned to IP address 38.103.63.60 Anybody from the same IP address can change your vote. You need to login to avoid this problem. A soft-max (probabilistic) procedure will be used to choose the author based on the number of votes received.

Candidates are listed in the order they were nominated:

	Name/Email/Affiliation	Brief note
	Donald Knuth (edit) (taocpcs.stanford.edu) Stanford University	Knuth is Professor Emeritus at Stanford University. He is seen by numerous programmers as extremely knowledgeable of the subject of computers, and has a very influential literary production. Knuth not only was there when computer programming became a major scientific topic, but still dominates the subject as few people do, and more importantly: he is an excellent writer.
	C. Anthony R. Hoare (edit) (thoaremicrosoft.com) Microsoft Research/Oxford University	Tony Hoare is a Professor Emeritus at Oxford University and a senior researcher at Microsoft Research, Cambridge. He's probably most widely known for the Quicksort algorithm, but also for developing ALGOL 60 and the Hoare logic for program verification. He was awarded the ACM Turing Award in 1980 and the Kyoto Prize for Information Science in 2000.
	Christos Papadimitriou (edit) (christoscs,berkeley,edu) University of California, Berkeley	Christos Papdimitriou is author and co-author of many excellent textbooks in computer science, including his fantastic book on "Computational Complexity", and the forthcoming book "Algorithms" by Dasgupta, Papadimitriou and Vazirani.

(edit article category)