62 search results - page 5 / 13 » Are Fibonacci Heaps Optimal |
126
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Garbage collection can be a performance bottleneck in large distributed, multi-threaded applications. Applications may produce millions of objects during their lifetimes and may i...
130
Voted
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
113
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
112
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
130
click to vote
CLUSTER
2003
IEEE
15 years 9 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...