613 search results - page 45 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
141
click to vote
PODC
2011
ACM
14 years 16 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
92
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
74
Voted
PODC
2003
ACM
15 years 2 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
77
Voted
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...