Fundamental algorithms such as sorting or hashing are used trillions of times on any given
day. As demand for computation grows, it has become critical for these algorithms to be as …

The design and analysis of adaptive sorting algorithms has made important contributions to
both theory and practice. The main contributions from the theoretical point of view are: the …

DNA loop extrusion emerges as a key process establishing genome structure and function.
We introduce MoDLE, a computational tool for fast, stochastic modeling of molecular …

We introduce new stable natural merge sort algorithms, called 2-merge sort and α-merge
sort. We prove upper and lower bounds for several merge sort algorithms, including Timsort …

Indexing in modern data systems facilitates efficient query processing when the selection
predicate is on an indexed key. As new data is ingested, indexes are gradually populated …

A sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than
random sequences, where the distance is determined by some measure of presortedness …

The weak heap is a priority queue that was introduced as a competitive structure for sorting.
Its array-based form supports the operations find-min in O (1) worst-case time, and insert …

We give an algorithm which in O (n log 2 n) time counts all distinct squares in a labeled tree.
There are two main obstacles to overcome. The first one is that the number of distinct …

Branch mispredictions is an important factor affecting the running time in practice. In this
paper we consider tradeoffs between the number of branch mispredictions and the number …

Two new adaptive sorting algorithms are introduced which perform an optimal number of
comparisons with respect to the number of inversions in the input. The first algorithm is …