5100 search results - page 864 / 1020 » The Linear Complexity of a Graph |
139
click to vote
PADS
2005
ACM
15 years 11 months ago
2005
ACM
Parallel and distributed simulations enable the analysis of complex systems by concurrently exploiting the aggregate computation power and memory of clusters of execution units. I...
169
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
164
Voted
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
197
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
172
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...