11213 search results - page 135 / 2243 » Low-contention data structures |
128
click to vote
ISCA
1993
IEEE
15 years 8 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
127
click to vote
FECS
2006
15 years 5 months ago
2006
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
164
click to vote
ITA
2007
15 years 3 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
119
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
119
click to vote
PARA
2004
Springer
15 years 9 months ago
2004
Springer
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...