Frank Kwang-ming Hwang
#110,464
Most Influential Person Now
Frank Kwang-ming Hwang's AcademicInfluence.com Rankings
Frank Kwang-ming Hwangengineering Degrees
Engineering
#3174
World Rank
#4208
Historical Rank
Electrical Engineering
#664
World Rank
#726
Historical Rank

Frank Kwang-ming Hwangcomputer-science Degrees
Computer Science
#4160
World Rank
#4376
Historical Rank
Theoretical Computer Science
#57
World Rank
#57
Historical Rank
Database
#1395
World Rank
#1468
Historical Rank

Download Badge
Engineering Computer Science
Frank Kwang-ming Hwang's Degrees
- PhD Electrical Engineering Stanford University
- Masters Electrical Engineering Stanford University
- Bachelors Electrical Engineering National Taiwan University
Why Is Frank Kwang-ming Hwang Influential?
(Suggest an Edit or Addition)Frank Kwang-ming Hwang's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Combinatorial Group Testing and Its Applications (1993) (1027)
- Steiner tree problems (1992) (447)
- On Steiner Minimal Trees with Rectilinear Distance (1976) (429)
- Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing (2006) (261)
- The Steiner Tree Problem (2012) (220)
- Computing in Euclidean Geometry (1995) (219)
- A Method for Detecting all Defective Members in a Population by Group Testing (1972) (180)
- Fast Solutions for Consecutive-k-out-of-n: F System (1982) (158)
- A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets (1972) (157)
- The Mathematical Theory of Nonblocking Switching Networks (1998) (151)
- An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees (1979) (127)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (1992) (125)
- Reliabilities of Consecutive-k Systems (2011) (121)
- Generalized de Bruijn digraphs (1988) (112)
- A linear time algorithm for full steiner trees (1986) (109)
- A survey on multi-loop networks (2003) (106)
- Rectilinear steiner trees: Efficient special-case algorithms (1977) (97)
- Use of steiner's problem in suboptimal routing in rectilinear metric (1976) (87)
- The rectilinear steiner arborescence problem (1992) (86)
- A complementary survey on double-loop networks (2001) (78)
- New Concepts in Seeding Knockout Tournaments (1982) (77)
- An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio (1990) (76)
- An o(nlogn) algorithm for suboptimal rectilinear steiner trees (1979) (75)
- Group testing with a dilution effect (1976) (70)
- Simplified reliabilities for consecutive- k -out-of- n systems (1986) (68)
- On Nonblocking Multiconnection Networks (1986) (66)
- A Polynomial Time Algorithm for Shaped Partition Problems (1999) (65)
- Reliabilities for (n,f,k) systems (1999) (65)
- A Generalized Binomial Group Testing Problem (1975) (65)
- Control Algorithms for Rearrangeable Clos Networks (1983) (61)
- Multistate consecutively-connected systems (1989) (60)
- The Network Model (2000) (60)
- A Lower Bound for the Steiner Tree Problem (1978) (59)
- A survey on nonadaptive group testing algorithms through the angle of decoding (2008) (58)
- Steiner minimal trees for regular polygons (1987) (56)
- Rearrangeability of multi-connection three-stage clos networks (1972) (53)
- Competitive Group Testing (1993) (53)
- Diameters of Weighted Double Loop Networks (1988) (51)
- A new bound for the steiner ratio (1983) (50)
- The Shortest Network under a Given Topology (1992) (49)
- A Construction of Pooling Designs with Some Happy Surprises (2005) (49)
- The Steiner Ratio Conjecture Is True for Five Points (1985) (49)
- The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter (1979) (46)
- The Hamiltonian property of generalized de Bruijn digraphs (1991) (46)
- Optimal Consecutive-2-Out-of-n Systems (1986) (45)
- Double loop networks with minimum delay (1987) (42)
- The Steiner ratio conjecture of Gilbert and Pollak is true. (1990) (42)
- Exploring the missing link among d-separable, d_-separable and d-disjunct matrices (2007) (41)
- Failure Distributions of Consecutive-k-out-of-n:F Systems (1985) (41)
- An improved algorithm for steiner trees (1990) (40)
- The Hamiltonian property of consecutive-d digraphs (1993) (40)
- Steiner minimal trees on sets of four points (1987) (39)
- Constructions for Some Classes of Neighbor Designs (1973) (38)
- Partition-Optimization with Schur Convex Sum Objective Functions (2005) (38)
- A new decomposition algorithm for rearrangeable Clos interconnection networks (1996) (38)
- Hexagonal coordinate systems and steiner minimal trees (1986) (38)
- A new competitive algorithm for group testing (1992) (37)
- Doubly Linked Ring Networks (1985) (35)
- Reducing the Steiner Problem in a Normed Space (1992) (34)
- A tale of two coins (1987) (34)
- Choosing the best logk(N, m, P) strictly nonblocking networks (1998) (33)
- Do Stronger Players Win More Knockout Tournaments (1978) (33)
- The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics) (2004) (32)
- Computing in Euclidean Geometry: (2nd Edition) (1995) (31)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (2008) (31)
- Optimal Set Partitioning (1985) (31)
- Steiner minimal trees on zig-zag lines (1983) (30)
- A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n:F system (1998) (30)
- Group testing with two defectives (1982) (29)
- NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM (1999) (29)
- Optimal merging of 2 elements with n elements (1971) (29)
- Survival Reliability of Some Double-Loop Networks and Chordal Rings (1995) (28)
- A Boundary Problem for Group Testing (1981) (28)
- A Short Proof of a Result of Pollak on Steiner Minimal Trees (1982) (28)
- Three-stage multiconnection networks which are nonblocking in the wide sense (1979) (27)
- On Multirate Rearrangeable Clos Networks (1999) (27)
- An Optimum Nested Procedure in Binomial Group Testing (1976) (27)
- A Group Testing Problem on Two Disjoint Sets (1981) (27)
- Construction of d(H)-disjunct matrix for group testing in hypergraphs (2006) (27)
- New Construction for Transversal Design (2006) (27)
- Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders (1993) (26)
- Structure importance of consecutive-k-out-of-n systems (1999) (26)
- The Structural Birnbaum Importance of Consecutive-k Systems (2002) (26)
- Optimal partitions (1981) (25)
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions (1996) (25)
- Optimal Sequencing of Items In a Consecutive-2-out-of-n System (1983) (24)
- Constructions for Balanced Howell Rotations for Bridge Tournaments (1972) (24)
- The Minimum Distance Diagram of Double-Loop Networks (2000) (23)
- Enumerating Nested and Consecutive Partitions (1995) (23)
- A Survey on Double Loop Networks (1989) (22)
- Reliability of Computer and Communication Networks (1991) (22)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (2007) (22)
- An O(k/sup 3/spl middot/log(n/k)) algorithm for the consecutive-k-out-of-n:F system (1995) (22)
- Isolating a Single Defective Using Group Testing (1974) (22)
- Error-Tolerant Pooling Designs with Inhibitors (2003) (21)
- Some permutation routing algorithms for low-dimensional hypercubes (2002) (21)
- A survey of nonblocking multicast three-stage Clos networks (2003) (21)
- Wide-sense nonblocking multicast Log2(N, m, p) networks (2003) (21)
- A direct algorithm for computing reliability of a consecutive-k cycle (1988) (20)
- On Finding a Single Defective in Binomial Group Testing (1974) (20)
- Lower bounds for wide-sense nonblocking Clos network (2001) (20)
- Comments on "Reliability and component importance of a consecutive-k-out-of-n system" by Zuo (2000) (19)
- Redundant consecutive-k systems (1987) (19)
- Robust Group Testing (1984) (19)
- Characterizing bit permutation networks (1999) (19)
- A New Competitive Algorithm for the Counterfeit Coin Problem (1994) (19)
- An isomorphic factorization of the complete graph (1995) (18)
- A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks (2005) (18)
- Steiner minimal tree for points on a circle (1985) (18)
- Localizing combinatorial properties of partitions (1996) (17)
- The optimal consecutive-k-out-of-n:G line for n⩽2k (2005) (17)
- The Hamiltonian property of linear functions (1987) (17)
- On optimal nested group testing algorithms (1990) (17)
- Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks (1997) (16)
- Invariant permutations for consecutive k-out-of-n cycles (1989) (16)
- The Time Complexity of Deterministic Broadcast Radio Networks (1995) (16)
- Optimal Assembly of an s-Stage k-OUT-OF-n System (1990) (16)
- Minimizing a Combinatorial Function (1982) (16)
- The state of the art in Steiner ratio problems (1992) (16)
- Hypergeometric and Generalized Hypergeometric Group Testing (1981) (16)
- Majorization on a partially ordered set (1979) (15)
- A primer of the Euclidean Steiner problem (1991) (15)
- A d-move Local Permutation Routing for the d-cube (1997) (15)
- On nonblocking multicast three-stage Clos networks (2000) (15)
- Generalized Huffman Trees (1979) (14)
- An Optimal Hierarchical Procedure for a Modified Binomial Group-Testing Problem (1981) (14)
- A Direct Method to Construct Triple Systems (1974) (14)
- When is Individual Testing Optimal for Nonadaptive Group Testing? (2001) (14)
- RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS (2000) (14)
- Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies (2004) (14)
- A general construction for nonblocking crosstalk-free photonic switching networks (2001) (13)
- Partition polytopes over 1-dimensional points (1999) (13)
- Detecting and locating electrical shorts using group testing (1989) (13)
- A novel use of t-packings to construct d-disjunct matrices (2006) (13)
- On Noninterruptive Rearrangeable Networks (2006) (13)
- Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules (1994) (13)
- On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out (2006) (12)
- A decomposition theorem on Euclidean Steiner minimal trees (1988) (12)
- A Permutation Routing Algorithm for Double Loop Networks (1997) (12)
- Neighbor Designs (1977) (12)
- Optimal Assignment of Components to a Two-Stage k-Out-of-n System (1989) (12)
- Strictly Nonblocking f-Cast Logd(N, m, p) Networks (2007) (12)
- A Fundamental Monotonicity in Group Testing (1988) (12)
- Routing Algorithms for Double Loop Networks (1992) (12)
- CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM” (2000) (11)
- Comments on "Reliable Loop Topologies for Large Local Computer Networks" (1987) (11)
- Relayed consecutive-k-out-of-n:F lines (1988) (11)
- Selecting Non-consecutive Balls Arranged in Many Lines (1984) (11)
- Representations and characterizations of vertices of bounded-shape partition polytopes (1998) (11)
- A simple and direct derivation for the number of noncrossing partitions (1998) (11)
- A Generalization of the Karlin-McGregor Theorem on Coincidence Probabilities and an Application to Clustering (1977) (11)
- Reliabilities of Double-Loop Networks (1991) (11)
- A two-stage network with dual partial concentrators (1993) (11)
- Asymptotic results for partial concentrators (1988) (11)
- Optimal consecutive-2 systems of lines and cycles (1985) (11)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (2005) (11)
- Reliabilities of chordal rings (1992) (11)
- Efficient realization techniques for network flow patterns (1981) (10)
- Opinions on consecutive-k-out-of-n:F systems (1994) (10)
- Stronger players win more balanced knockout tournaments (1988) (10)
- Optimal Merging of 3 Elements with n Elements (1980) (10)
- A Group Testing Problem (1980) (10)
- Three Versions of a Group Testing Game (1984) (10)
- A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization (1991) (10)
- Most reliable double loop networks in survival reliability (1993) (10)
- Latin Squares and Superqueens (1983) (10)
- Steiner Minimal Trees on Chinese Checkerboards (1991) (10)
- Linear-shaped partition problems (2000) (10)
- An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system (1993) (10)
- Decomposing complete graphs into Kr×Kc's (2004) (10)
- Optimal assignments for consecutive-2 graphs (1987) (10)
- Partitions: Optimality and Clustering (2011) (10)
- Minimum range sequences of all k-subsets of a set (1977) (9)
- Random Pooling Designs Under Various Structures (2003) (9)
- On blocking probabilities for switching networks (1977) (9)
- Comments on "Network Resilience: A Measure of Network Fault Tolerance" (1994) (9)
- A generalization of takagl's theorem on optimal channel graphs (1978) (9)
- Optimality of Nested Partitions and Its Application to Cluster Analysis (1996) (9)
- Existence of invariant series consecutive-k-out-of-n:G systems (1999) (9)
- Reliabilities of Consecutive-2 Graphs (1987) (9)
- Pooling designs for clone library screening in the inhibitor complex model (2011) (9)
- Selecting k Objects from a Cycle with p Pairs of Separation s (1984) (9)
- Sortabilities of Partition Properties (1998) (9)
- Optimal Detection of Two Defectives with a Parity Check Device (1988) (9)
- BROADCASTING IN A THREE-STAGE POINT-TO-POINT NONBLOCKING NETWORK (1995) (8)
- The identification of positive clones in a general inhibitor model (2007) (8)
- Exact reliabilities of most reliable double‐loop networks (1997) (8)
- On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks (1997) (8)
- New Constructions for Balanced Howell Rotations (1976) (8)
- A probability inequality and its Application to switching networks (1977) (8)
- The Lifetime Distribution (2000) (8)
- Steiner minimal trees for bar waves (1987) (8)
- CONNECTIVITY RELIABILITIES AND HAMILTONIAN RELIABILITIES OF LINEAR AND CIRCULAR CONSECUTIVE-2 LINK SYSTEMS (1994) (7)
- Optimal Consecutive-k-out-of-(2k+1): G Cycle (2001) (7)
- Crisscross Latin Squares (1979) (7)
- Extremal Permutations with Respect to Weak Majorizations (1996) (7)
- A Modification to a Decomposition Algorithm of Gordon and Srikanthan (1997) (7)
- The consecutive-4 digraphs are Hamiltonian (1999) (7)
- Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget (1988) (7)
- Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation (1999) (7)
- Monotone Routing in Multirate Rearrangeable Clos Networks (2001) (7)
- A Class of Merging Algorithms (1973) (7)
- Computing In Euclidean Geometry: Volume 1 (1992) (7)
- Exact reliabilities of most reliable double-loop networks (1997) (7)
- New Classes of Complete Balanced Howell Rotations (1976) (7)
- The hamiltonian property of the consecutive-3 digraph (1997) (7)
- On Macula's error-correcting pool designs (2003) (7)
- A Reversible Model for Consecutive-2-out-of-n: F Systems with Node and Link Failures (1994) (6)
- A Note on Hypergeometric Group Testing Procedures (1978) (6)
- An explicit solution for the number of minimal p-cutsequences in a consecutive-k-out of-n:F system (1991) (6)
- A Problem of Lines and Intersections With an Application to Switching Networks (1985) (6)
- Sortability of vector partitions (2003) (6)
- Enumerating Consecutive and Nested Partitions for Graphs (1998) (6)
- Cycle Polynomials (1981) (6)
- Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks (2001) (6)
- A class of full Steiner minimal trees (1983) (6)
- Individual Testing of Independent Items in Optimal Group Testing (1988) (6)
- A competitive algorithm to find all defective edges in a graph (2005) (6)
- Detection of a Defective Coin with Partial Weight Information (1984) (6)
- On the Failure Rates of Consecutive−k−out−of−n Systems (1990) (6)
- On blocking probabilities for a class of linear graphs (1978) (6)
- On Beneš rearrangeable networks (1971) (6)
- On the number of separable partitions (2011) (6)
- The Connection Patterns of Two Complete Binary Trees (1980) (6)
- Wide-sense nonblocking for multi-logdN networks under various routing strategies (2006) (6)
- An explicit expression for the cost of a class of Huffman trees (1980) (6)
- Do local majorities force a global majority? (1986) (6)
- Optimal relayed mobile communication systems (1989) (5)
- A problem on blocking probabilities in connecting networks (1977) (5)
- The Capacity of the Subarray Partial Concentrators (1992) (5)
- Knockout tournaments with diluted Bradley-Terry preference schemes (1991) (5)
- Majorization and Schur Convexity with Respect to Partial Orders (1993) (5)
- Complete Balanced Howell Rotations for 16k + 12 Partnerships (1984) (5)
- Wide-sense Nonblocking for 3-stage Clos Networks (2001) (5)
- A Simple Relation between the Pattern Probability and the Rate of False Signals in Control Charts (1996) (5)
- Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability (2003) (5)
- Partitions: Optimality and ClusteringVol I: Single-Parameter (2011) (5)
- Comment on "Strict consecutive-k-out-of-n:F systems (1991) (5)
- Improved construction for pooling design (2008) (5)
- Cutoff points for roll-call protocols in multiple-access systems (1984) (5)
- Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case (2000) (5)
- Sequential construction of a circular consecutive-2 system (2000) (5)
- THE EXPECTED NUMBERS OF UNRESOLVED POSITIVE CLONES FOR VARIOUS RANDOM POOL DESIGNS (2001) (5)
- On optimal routing trees (1988) (5)
- Wide-Sense Nonblocking Multicast Networks (2003) (4)
- Updating a Tale of Two Coins (1989) (4)
- Strictly Nonblocking Multirate logd(N, m, p) Networks (2005) (4)
- Rearrangeability of bit permutation networks (2006) (4)
- Survival reliabilities of double loop networks (1990) (4)
- A class of selection problems for which more sampling is more informative (1982) (4)
- Universality of D-Cube (D<8) (1993) (4)
- Identifying d positive clones in the presence of inhibitors (2005) (4)
- Optimality of consecutive and nested tree partitions (1997) (4)
- Interconnecting Highways (1999) (4)
- Adaptive and Oblivious Algorithms for D-Cube Permutation Routing (1993) (4)
- Channel graphs of bit permutation networks (2001) (4)
- Necessary and sufficient conditions for rearrangeable Log/sub d/(N,m,p) (2005) (4)
- A competitive algorithm in searching for many edges in a hypergraph (2007) (4)
- A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks (1989) (4)
- Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones (1991) (4)
- Comparing File Copies with at Most Three Disagreeing Pages (1997) (4)
- Equivalent nondegenerate L-shapes of double-loop networks (2000) (4)
- Blocking Probabilities for a Class of Spiderweb Channel Graphs (1980) (4)
- Complete balanced Howell rotations for 8k+5 teams (1982) (4)
- Balanced Howell rotations of the twin prime power type (1982) (4)
- Detecting Corrupted Pages in M Replicated Large Files (1997) (3)
- A Minimal-Automaton-Based Algorithm for the Reliability of Con(d, k, n) Systems (2001) (3)
- Symmetric skew balanced starters and complete balanced Howell rotations (1982) (3)
- Generalization of an engineering principle (1992) (3)
- A partition identity (1983) (3)
- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch (1998) (3)
- A unique arithmetic labeling of hexagonal lattices (1995) (3)
- Permutation polytopes corresponding to strongly supermodular functions (2004) (3)
- Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks (2004) (3)
- The existence of hyper-L triple-loop networks (2003) (3)
- Comments on Bern's probabilistic results on rectilinear Steiner trees (1990) (3)
- NOTES ON PATTERN TESTS FOR SPECIAL CAUSES (1997) (3)
- An O( n log n ) algorithm for the generalized birthday problem (1997) (3)
- Distribution of Integers into k-tuples with Prescribed Conditions (1978) (3)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (2008) (3)
- Reliability of computer and communication networks : proceedings of a DIMACS Workshop, December 2-4, 1989 (1991) (3)
- Characterization for series-parallel channel graphs (1981) (3)
- Necessary and Sufficient Conditions for Rearrangeable Log (2005) (3)
- Some Combinatorial Properties of Mixed Chordal Rings (2003) (3)
- A Multiplication Theorem for Balanced Howell Rotations (1984) (3)
- A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes (1997) (3)
- Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 (2002) (3)
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units (1977) (3)
- A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS (2004) (3)
- Advances in Switching Networks (1998) (3)
- On the rearrangeability of some multistage connecting networks (1976) (2)
- A new approach to solve open-partition problems (2012) (2)
- A Multistage Selection Scheme for the Most Probable Event (1982) (2)
- Construction of $2$-balanced $(n,k,\lambda)$ arrays. (1976) (2)
- Group testing to identify one defective and one mediocre item (1987) (2)
- EQUIVALENT DOUBLE-LOOP NETWORKS (2000) (2)
- An Improved Upper Bound for the Subarray Partial Concentrators (1992) (2)
- Comparisons on blocking probabilities for regular series parallel channel graphs (1982) (2)
- Some inequalities concerning random subsets of a set (1987) (2)
- Do component reliabilities depend on system size (1992) (2)
- k-Diameters of the Hyper-L Shape Tile (2002) (2)
- Supermodularity in Various Partition Problems (2000) (2)
- Computing the Blocking Probabilities for Spiderweb Channel Graphs (1982) (2)
- On the construction of balanced switching networks (1979) (2)
- An optimal group testing algorithm on k disjoint sets (1993) (2)
- Hamiltonian Circuits for 2-Regular Interconnection Networks (1993) (2)
- The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers (1988) (2)
- On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls (2005) (2)
- Partitions: Optimality and ClusteringVol II: Multi-Parameter (2013) (2)
- Cutting Numbers for the Forward Loop Backward Hop Network (1994) (2)
- Using combinatorial designs to construct partial concentrators (1991) (2)
- Fixed Sample-Size Multinomial Selection in Scalar Zones (1986) (2)
- On a conjecture of trietsch and handler on the flow-dependent steiner ratio (1986) (2)
- Sortability of Multi-partitions (2002) (2)
- Link designs and probability analyses for a class of connecting networks (1978) (2)
- An inventory model with special sale (1968) (1)
- Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing (1989) (1)
- Localizing Combinatorial Properties for Partitions on Block Graphs (1998) (1)
- Some Optimal Partition Problems with Applications to Switching Networks (1978) (1)
- The Mean-Partition Problem (2006) (1)
- Design of Optimal Consecutive Systems (2000) (1)
- Optimal Binomial Group Testing with a Test History (1990) (1)
- On generating a random sequence (1971) (1)
- Some comments on the optimal assembly problem (1995) (1)
- Component-level redundancy is better than system-level redundancy for channel graphs (1985) (1)
- An Efficient Algorithm for the Reliability of Consecutive-k-n Networks (2003) (1)
- The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks (2009) (1)
- Supermodularity in Mean-Partition Problems* (2005) (1)
- A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels (1989) (1)
- Some Realizability Theorems in Group Testing (1979) (1)
- Algorithms for Special Cases (1993) (1)
- Optimal Consecutive-k-out-of-n: G Cycle for N ≤ 2k + 1 * (2002) (1)
- Least-Favorable Configurations in the Multinomial Selection Problem: A Survey (1986) (1)
- Assembly at system level versus component level (1995) (1)
- Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube (1998) (1)
- The construction for symmetrical zone-balanced networks (1978) (1)
- Constrained partitioning problems (1994) (1)
- GROUP TESTING TO IDENTIFY THE SAMPLE MINIMUM FROM A DISCRETE UNIFORM DISTRIBUTION (1984) (1)
- Superimposed Codes and Combinatorial Group Testing (2006) (1)
- Formulation and Examples (2011) (1)
- Sphere-separable partitions of multi-parameter elements (2008) (1)
- Tessellating polyominos in the plane (2006) (1)
- Explicit solution of partitioning problems over a 1-dimensional parameter space (2000) (1)
- Maximum Wealth Trees (1980) (1)
- Non-unique Probe Selection (2006) (1)
- Using transforming matrices to generate DNA clone grids (2003) (0)
- Theminimumnumberofe-vertex-coversamonghypergraphswithe edgesofgivenranks (2009) (0)
- Random Pooling Designs and Probabilistic Analysis (2006) (0)
- General Sequential Algorithms (1999) (0)
- Optimal Relayed Mobile (1989) (0)
- Minimal-distance routing for KYKLOS II (1987) (0)
- Optimal Search in One Variable (1993) (0)
- Some Other Group Testing Models (1993) (0)
- ON REGULAR RELIABILITY MODELS (2001) (0)
- Additive Model and Others (1999) (0)
- CONSTRUCTION OF 2-BALANCED ( n , fc , λ ) ARRAYS (2012) (0)
- Basic Theory on Separating Matrices (2006) (0)
- Sum-Partition Problems over Single-Parameter Spaces: Polyhedral Approach (2011) (0)
- CONSTRAINED ARRANGEMENTS OF OBJECTS IN A CYCLE (1997) (0)
- Deterministic Designs and Superimposed Codes (1999) (0)
- Multiaccess Channels and Extensions (1993) (0)
- Blocking Probabilities for Connecting Networks Allowing Rearrangements (2011) (0)
- Computation of Reliability (2000) (0)
- Counting disjoint 2-partitions for points in the plane (2007) (0)
- The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules (2003) (0)
- The 1.5-loop network and the mixed 1.5-loop network (2000) (0)
- Random Designs and Error Tolerance (1999) (0)
- A Proposed Experiment on Soap Film Solutions of Planar Euclidean Steiner Trees (2001) (0)
- A Monotonicity Result for Inspecting Independent Items (1989) (0)
- Generalizing and Fine Tuning Triple-Loop Networks (2009) (0)
- Group Testing on Graphs (1993) (0)
- Bounded-Shape Sum-Partition Problems: Polyhedral Approach (2013) (0)
- Monotone routing in multirate rearrangeable logd(N,m,p) network (2005) (0)
- An Analytical Solution of the Fokker-Planck Equation in the Phase-Locked Loop Transient Analysis (1987) (0)
- Comment/reply: some recent papers on consecutively-connected systems (1996) (0)
- A new approach to solve open-partition problems (2010) (0)
- Strict nonblockingness of reduced shuffle-exchange networks (2005) (0)
- Sum-Multipartition Problems over Single-Parameter Spaces (2013) (0)
- Inner Spanning Trees Geometry for Planar Polygons (2013) (0)
- A Polytope Approach to the Optimal Assembly Problem (2006) (0)
- Means and method for dynamically distributing means with an ordered borrowing in a wireless communication network (1995) (0)
- Detecting the two complementary defectives with a balance scale (1987) (0)
- Hypergeometric group testing algorithms (1973) (0)
- Partitions : single-parameter (2011) (0)
- How to Design Round Robin Schedules (1989) (0)
- Some Monotone Almost Balanced Knockout Tournament Plans (1993) (0)
- Are there more almost separable partitions than separable partitions? (2012) (0)
- Multiplicative magic squares (1983) (0)
- Device and method for dynamic distribution of funds with minor borrowing in a wireless communication network (1995) (0)
- Nonadaptive Algorithms and Binary Superimposed Codes (1993) (0)
- Sequential Algorithms for Special Cases (1999) (0)
- Partitions over Single-Parameter Spaces: Combinatorial Structure (2011) (0)
- Partition Problems over Single-Parameter Spaces: Combinatorial Approach (2011) (0)
- Structureimportanceofconsecutive-k-out-of-nsystems (1999) (0)
- Some recent papers on consecutively-connected systems (1996) (0)
- A new construction of I-separable matrices via an improved decoding of Macula's construction (2008) (0)
- Deterministic Designs from Partial Orders (2006) (0)
- Strict nonblockingness of reduced shuffle‐exchange networks (2005) (0)
- Clustering Problems over Multi-parameter Spaces (2013) (0)
- Sortability ofvector partitions (2003) (0)
- Sum-Partition Problems over Single-Parameter Spaces: Explicit Solutions (2011) (0)
- Are there more almost separable partitions than separable partitions? (2014) (0)
- Diagonal and Pandiagonal Tournament Latin Squares (1985) (0)
- Group testing and fault detection for replicated files (2002) (0)
- Extreme Points and Optimality (2011) (0)
- FastSolutions forConsecutive-k-out-of-n: FSystem (1982) (0)
- Optimal Assemblies of Consecutive-2 Link Systems (1994) (0)
- Wide-sense Non-blocking Multirate and Multicast log 2 ( N ; m ; p ) Switching Networks (2007) (0)
- Some Related Systems (2000) (0)
- Equivalence of buddy networks with arbitrary number of stages * (2005) (0)
- The Two Color Whitworth Problem for Long Cycles or Long Lines (1994) (0)
- A complementarysurveyon double-loop networks (2001) (0)
- On the cutoff point for pairwise enabling for infinite users in a multiaccess system (1990) (0)
- On Steiner Minimal Trees with Rectilinear Distance Author ( s ) : (2010) (0)
- Equivalence of buddy networks with arbitrary number of stages (2005) (0)
- Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks (2009) (0)
- Consecutive-2 Graphs (2000) (0)
- AND COMPLETE BALANCED HOWELL ROTATIONS (2016) (0)
- Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones (1993) (0)
- Constrained-Shape and Single-Size Sum-Partition Problems: Polynomial Approach (2013) (0)
- One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions (2006) (0)
- The rank distribution of the maximin in a random matrix (1976) (0)
- Optimal quantitative group testing on cycles and paths (2001) (0)
- Pooling Designs on Complexes (2006) (0)
- 兩種連接網路:三環式網路及 Log2(N, m, p) 交換網路之研究 (2004) (0)
- Elementary Problems: E2438-E2443 (1973) (0)
- The Inhibitor Model (2006) (0)
- Construction for group-balanced connecting networks (1977) (0)
- Efficient algorithms for the reliabilities of replicated n-parallel-task graphs (1996) (0)
- Link-Connectivities of Extended Double Loop Networks (1996) (0)
- Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones: Discrete applied mathematics 30 (1991) 83–86 (1993) (0)
- Advances in switching networks : DIMACS workshop, July 7-9, 1997 (1998) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Frank Kwang-ming Hwang?
Frank Kwang-ming Hwang is affiliated with the following schools: