Dictionary of Algorithms and Data Structures (1998)

Just to mention one that&#x27;s usually quite ignored, I love the simplicity and usefulness of the Levenshtein distance: <a href="https:&#x2F;&#x2F;xlinux.nist.gov&#x2F;dads&#x2F;HTML&#x2F;Levenshtein.html" rel="nofollow">https:&#x2F;&#x2F;xlinux.nist.gov&#x2F;dads&#x2F;HTML&#x2F;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&#x2F; That Client With A Strange Name, Ltd. 2&#x2F; The Client With Strange Name, Ltd. 3&#x2F; That Client With A Strange Name 4&#x2F; [etc]<p>It worked really well and avoided lots of duplicated entries.

I often look up algorithms there, it&#x27;s a great resource. Unfortunately, you cannot search for parallel algorithms specifically and need to know what you&#x27;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?