62 search results - page 9 / 13 » Are Fibonacci Heaps Optimal |
SWAT
1992
Springer
13 years 11 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
POPL
2002
ACM
14 years 7 months ago
2002
ACM
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
PLDI
2003
ACM
14 years 22 days ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
IWMM
2007
Springer
14 years 1 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
PLDI
2010
ACM
14 years 16 days ago
2010
ACM
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...