4536 search results - page 670 / 908 » Contention-Sensitive Data Structures and Algorithms |
182
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
163
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: We consider the discovery of recombinant segments jointly with their origins within multilocus DNA sequences from bacteria representing heterogeneous populations of fa...
181
click to vote
COMPUTING
2008
15 years 6 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
221
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
182
click to vote
ISSTA
2000
ACM
15 years 11 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...