432 search results - page 4 / 87 » Internally deterministic parallel algorithms can be fast |
ICPP
2003
IEEE
15 years 2 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
93
Voted
JCC
2006
14 years 9 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
102
Voted
JACM
2000
14 years 9 months ago
2000
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...