A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

The predecessor problem is a key component of the fundamental sorting-and-searching
core of algorithmic problems. While binary search is the optimal solution in the comparison …

viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

Concurrent hash tables are one of the most important concurrent data structures, which are
used in numerous applications. For some applications, it is common that hash table …

The systematic development of efficient algorithms has become a key technology for all
kinds of ambitious and innovative computer applications. With major parts of algorithmic …

For a text T [1, n], a Longest Common Extension (LCE) query lce_T (i, j) asks for the length of
the longest common prefix of the suffixes T [i, n] and T [j, n] identified by their starting …

We discuss how string sorting algorithms can be parallelized on modern multi-core shared
memory machines. As a synthesis of the best sequential string sorting algorithms and …