Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …

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

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 …

Despite decades of innovation, existing hash tables fail to achieve peak performance on
modern hardware. Built around a relatively simple computation, ie, a hash function, which in …

The tree edit distance (TED) has been found in a wide spectrum of applications in artificial
intelligence, bioinformatics, and other areas, which serves as a metric to quantify the …

In this paper, parallel processing techniques are employed to improve the performance of
the stochastic dynamic programming applied to the long term operation planning of …

Dynamic programming (DP) is a framework used in multiple disciplines to solve decision-
making problems. In particular, in computer science and operations research (OR), DP …

This paper presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize
hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur …

Background RNA secondary structure prediction is a compute intensive task that lies at the
core of several search algorithms in bioinformatics. Fortunately, the RNA folding …

Polyhedral compilation techniques have proven to be a powerful tool for optimization of
dense array codes. In particular, their ability to tile imperfectly nested loops has provided …