1710 search results - page 143 / 342 » Parallelism in Structured Newton Computations |
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
127
click to vote
PODC
2011
ACM
14 years 25 days ago
2011
ACM
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...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
COORDINATION
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We show how principles of separation of Coordination from Computation can be used to endow the Problem Frames approach to problem analysis with representation schemes. Th...
HIPC
1999
Springer
15 years 2 months ago
1999
Springer
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...