Just to mention one that's usually quite ignored, I love the simplicity and usefulness of the Levenshtein distance:
<a href="https://xlinux.nist.gov/dads/HTML/Levenshtein.html" rel="nofollow">https://xlinux.nist.gov/dads/HTML/Levenshtein.html</a><p>I once implemented it in typical scenario where sales people had to look for a client, but it could be written as:
1/ That Client With A Strange Name, Ltd.
2/ The Client With Strange Name, Ltd.
3/ That Client With A Strange Name
4/ [etc]<p>It worked really well and avoided lots of duplicated entries.
I often look up algorithms there, it's a great resource. Unfortunately, you cannot search for parallel algorithms specifically and need to know what you're looking for anyway.<p>I was wondering whether someone could recommend similar resources (or books) for <i>parallel algorithms</i>. These are still very underrepresented on websites and in books, often just an addition or mentioned in passing by.<p>Any recommendations?