Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Background: Biological evolution conserves protein residues that are important for structure and function. Both protein stability and function often require a certain degree of st...
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...