• Publications
  • Influence
Combinatorial Optimization of Group Key Management
A new key management framework based on a combinatorial formulation of the group multicast key management problem that is applicable to the general problem of managing keys for any type of trusted group communication, regardless of the underlying transmission method between group participants is presented. Expand
On the Tape Complexity of Deterministic Context-Free Languages
A tape hardest deterministic context-free language is described and the best upper bound known on the tape complexity of (deterministic) context- free languages is (log(n) 2). Expand
The Vertex Separation and Search Number of a Graph
Algorithms that, for any tree T, compute vs ( T ) in linear time and compute an optimal layout with respect to vertex separation in time O ( n log n) are given. Expand
Min Cut is NP-Complete for Edge Weighted Treees
The Min Cut Linear Arrangement Problem is NP-complete for trees with polynomial size edge weights and this is used to show the NP-completeness of Search Number, Vertex Separation, Progressive Black/White Pebble Demand, and Topological Bandwidth for planar graphs with maximum vertex degree 3. Expand
Three disjoint path paradigms in star networks
Star networks have been recently proposed as an attractive choice for interconnection networks. They have sublogarithmic node degree and diameter and, like hypercubes, have a highly recursiveExpand
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
The equivalence of the following statements, for 0 g ~ < 1, m shown by describing a log(n)-complete hnear language, is shown. Expand
Difference bases and sparse sensor arrays
Several new analytical difference base structures that result in near optimal low-redundancy sensor arrays are introduced and extensions to the idea of difference bases that may yield useful results for sensor array design are discussed. Expand
Block sorting is hard
It is shown that optimizing block sorting is NP-hard, and new non-trivial lower bounds are given which can be computed efficiently. Expand
On the Diameter of the Pancake Network
It is shown that, the conjectured hardest stack of burnt pancakes, can be sorted in (3(n+1))/2 steps, for all n?3 (mod4) andn?23, which implies that both the “burnt” and “unbur burnt” pancake networks of dimensionn have diameter at most ( 3(n-1)/2. Expand