The demand for high performance has driven acyclic computation accelerators into extensive use in modern embedded and desktop architectures. Accelerators that are ideal from a sof...
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...