De novo assembly of a human genome using nanopore long-read sequences has been
reported, but it used more than 150,000 CPU hours and weeks of wall-clock time. To enable …

We present a novel approach to remesh a surface into an isotropic triangular or quad-
dominant mesh using a unified local smoothing operator that optimizes both the edge …

A concurrent object is a data structure shared by concurrent processes. Conventional
techniques for implementing concurrent objects typically rely on critical sections; ensuring …

Performance for the Java™ Platform has evolved in stages. Early VM's were interpreter-only.
Later VM's were interpreter plus template generated code, and finally interpreter plus …

Motivation Pangenome variation graphs model the mutual alignment of collections of DNA
sequences. A set of pairwise alignments implies a variation graph, but there are no scalable …

Lock-free data structures implement concurrent objects without the use of mutual exclusion.
This approach can avoid performance problems due to unpredictable delays while …

This paper describes the first complete implementation of a non-blocking binary search tree
in an asynchronous shared-memory system using single-word compare-and-swap …

Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a
practical programming language based on rules. This book, written by the creator of CHR …

We are int crested in implementing data structures on shared memory multiprocessors. A
natural model for these machines is an asynchronous parallel machine, in which the …

Most multiprocessors are multiprogrammed to achieve acceptable response time and to
increase their utilization. Unfortunately, inopportune preemption may significantly degrade …