Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

as far as I know, Motwani & Raghavan, ”Randomized Algorithms”, Cambridge University Press, 1995 is the standard book for randomized algorithms. This is an excellent theoretical intro.

Which is another book (or book containing chapters) on applied randomized algorithms, especially on image processing, bioinformatics or pattern matching.

Thanks, Lucian

share|cite|improve this question
@Imsasu: Welcome, you may find this relevant:…, and help extending the list after you get some good answers! – Hsien-Chih Chang 張顯之 Jan 27 '11 at 9:24
Nick Harvey has a course on Randomized Algorithms. You could have a look at the recommended reading list he provides, which is broken down by topic. – Bob Fraser Jan 27 '11 at 13:57
Can you change the title of the question to make it more informative? – Tsuyoshi Ito Jan 27 '11 at 20:11
Three users have voted to close this question as a duplicate of What Books Should Everyone Read?, but I do not agree that it is a duplicate. – Tsuyoshi Ito Jan 27 '11 at 20:43
I also agree that this is not a duplicate: the key point is 'applied' – Suresh Venkat Jan 27 '11 at 21:39

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.