1099 search results - page 106 / 220 » On the Complexity of Computing Evolutionary Trees |
HPCC
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
CCGRID
2009
IEEE
15 years 4 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
IPPS
1994
IEEE
15 years 2 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
SPAA
1993
ACM
15 years 2 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...