| Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks | 0 | 0.34 | 2004 |
| Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability | 2 | 0.89 | 2003 |
| Sortability of Multi-partitions | 2 | 0.43 | 2002 |
| When is Individual Testing Optimal for Nonadaptive Group Testing? | 7 | 0.75 | 2001 |
| A new index of component importance | 7 | 1.02 | 2001 |
| On Multirate Rearrangeable Clos Networks | 15 | 1.14 | 1998 |
| Choosing the best log/sub k/(N, m, P) strictly nonblocking networks | 0 | 0.34 | 1998 |
| Wide-sense nonblocking for multirate 3-stage Clos networks | 8 | 0.89 | 1997 |
| A new decomposition algorithm for rearrangeable Clos interconnection networks | 9 | 1.07 | 1996 |
| Comment/reply: some recent papers on consecutively-connected systems. | 0 | 0.34 | 1996 |
| An isomorphic factorization of the complete graph | 2 | 0.67 | 1995 |
| Cutting numbers for the forward loop backward hop network | 1 | 0.51 | 1994 |
| Most Reliable Double-Loop Networks In Survival Reliability | 3 | 0.42 | 1993 |
| Reducing the Steiner problem in a normal space | 18 | 1.93 | 1992 |
| The shortest network under a given topology | 17 | 2.76 | 1992 |
| A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization | 1 | 0.48 | 1991 |
| The Hamiltonian property of generalized de Bruijn digraphs | 25 | 1.87 | 1991 |
| A primer of the Euclidean Steiner problem | 4 | 0.50 | 1991 |
| Using combinatorial designs to construct partial concentrators | 2 | 0.55 | 1991 |
| On the cutoff point for pairwise enabling for infinite users in a multiaccess system | 0 | 0.34 | 1990 |
| An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio | 25 | 11.08 | 1990 |
| Optimal assignment of components to a two-stage k-out-of-n system | 7 | 6.47 | 1989 |
| A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels | 0 | 0.34 | 1989 |
| Asymptotic results for partial concentrators | 7 | 0.89 | 1988 |
| Optimal detection of two defectives with a parity check device | 6 | 0.95 | 1988 |
| Stronger players win more balanced knockout tournaments. | 4 | 1.28 | 1988 |
| A fundamental monotonicity in group testing | 1 | 0.48 | 1988 |
| Cutoff points for roll call protocols in multiple access systems | 1 | 0.98 | 1987 |
| Double loop networks with minimum delay | 25 | 3.50 | 1987 |
| Optimal consecutive-2-out-of-n systems | 12 | 7.30 | 1986 |
| On A Conjecture Of Trietsch And Handler On The Flow-Dependent Steiner Ratio | 2 | 0.74 | 1986 |
| Doubly Linked Ring Networks | 27 | 5.13 | 1985 |
| Optimal Consecutive-2 Systems Of Lines And Cycles | 1 | 0.36 | 1985 |
| The steiner ratio conjecture is true for five points | 13 | 8.18 | 1985 |
| A multiplication theorem for balanced howell rotations | 2 | 0.72 | 1984 |
| A short proof of a result of Pollak on Steiner minimal trees | 14 | 15.66 | 1982 |
| A Group Testing Problem | 1 | 0.40 | 1980 |
| Maximum Wealth Trees | 0 | 0.34 | 1980 |
| The Connection Patterns of Two Complete Binary Trees | 2 | 0.53 | 1980 |
| Largest Minimal Rectilinear Steiner Trees For A Set Of N Points Enclosed In A Rectangle With Given Perimeter | 23 | 8.71 | 1979 |
| Construction Of Balanced Switching-Networks | 1 | 0.47 | 1979 |
| Link Designs And Probability Analyses For A Class Of Connecting Networks | 2 | 1.41 | 1978 |
| Problem On Blocking Probabilities In Connecting Networks | 1 | 1.20 | 1977 |
| Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units | 3 | 1.11 | 1977 |
| New constructions for balanced Howell rotations | 4 | 1.31 | 1976 |
| Hypergeometric group testing algorithms | 0 | 0.34 | 1973 |
| Rearrangeability of multi-connection three-stage clos networks | 25 | 3.42 | 1972 |
