Sciweavers

4536 search results - page 112 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
BMCBI
2010
106views more  BMCBI 2010»
13 years 9 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 7 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
PODC
2011
ACM
12 years 12 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 11 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu