H. K. Dai Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. [Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:228-236 [Conf]
H. K. Dai The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. [Citation Graph (0, 0)][DBLP] Euro-Par, Vol. I, 1996, pp:234-242 [Conf]
H. K. Dai Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators. [Citation Graph (0, 0)][DBLP] ICCI, 1993, pp:41-47 [Conf]
H. K. Dai The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth. [Citation Graph (0, 0)][DBLP] ICCI, 1993, pp:48-54 [Conf]
H. K. Dai On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators. [Citation Graph (0, 0)][DBLP] IPPS, 1993, pp:406-412 [Conf]
H. K. Dai Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters. [Citation Graph (0, 0)][DBLP] ISPAN, 1999, pp:22-27 [Conf]
H. K. Dai An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks. [Citation Graph (0, 0)][DBLP] PARLE, 1994, pp:214-225 [Conf]
H. K. Dai The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1997, v:8, n:3, pp:237-252 [Journal]