Frank K. Hwang

From MaRDI portal
(Redirected from Person:224543)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Reaching fault diagnosis agreement under a hybrid fault model
IEEE Transactions on Computers
2018-07-09Paper
Sequential construction of a circular consecutive-2 system
Information Processing Letters
2016-06-16Paper
scientific article; zbMATH DE number 6530141 (Why is no real title available?)2016-01-14Paper
On the number of separable partitions
Journal of Combinatorial Optimization
2015-08-24Paper
Are there more almost separable partitions than separable partitions?
Journal of Combinatorial Optimization
2014-06-24Paper
Partitions. Optimality and clustering. Vol. II: Multi-parameter.
Series on Applied Mathematics (Singapore)
2013-08-13Paper
A new approach to solve open-partition problems
Journal of Combinatorial Optimization
2012-07-10Paper
Pooling designs for clone library screening in the inhibitor complex model
Journal of Combinatorial Optimization
2011-09-27Paper
An almost-linear time and linear space algorithm for the longest common subsequence problem
Information Processing Letters
2009-12-04Paper
Optimal reservation scheme routing for two-rate wide-sense nonblocking three-stage Clos networks2009-05-22Paper
scientific article; zbMATH DE number 5379591 (Why is no real title available?)2008-12-08Paper
A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction
Discrete Optimization
2008-11-19Paper
An upper bound of the number of tests in pooling designs for the error-tolerant complex model
Optimization Letters
2008-09-04Paper
Improved construction for pooling design
Journal of Combinatorial Optimization
2008-04-23Paper
A survey on nonadaptive group testing algorithms through the angle of decoding
Journal of Combinatorial Optimization
2008-04-23Paper
Sphere-separable partitions of multi-parameter elements
Discrete Applied Mathematics
2008-03-28Paper
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
Journal of Combinatorial Optimization
2008-02-18Paper
A polytope approach to the optimal assembly problem
Journal of Global Optimization
2007-10-23Paper
Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
Journal of Combinatorial Optimization
2007-06-21Paper
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
SIAM Journal on Discrete Mathematics
2007-05-22Paper
Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
Discrete Applied Mathematics
2007-04-13Paper
A competitive algorithm in searching for many edges in a hypergraph
Discrete Applied Mathematics
2007-03-08Paper
Reliabilities of Double-Loop Networks
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Reliabilities of Consecutive-2 Graphs
Probability in the Engineering and Informational Sciences
2007-01-19Paper
On the Failure Rates of Consecutive−k−out−of−n Systems
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Individual Testing of Independent Items in Optimal Group Testing
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget
Probability in the Engineering and Informational Sciences
2007-01-19Paper
A Monotonicity Result for Inspecting Independent Items
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Optimal Binomial Group Testing with a Test History
Probability in the Engineering and Informational Sciences
2007-01-19Paper
The mean-partition problem
Journal of Global Optimization
2007-01-05Paper
Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.2006-11-01Paper
A Simple Relation between the Pattern Probability and the Rate of False Signals in Control Charts
Probability in the Engineering and Informational Sciences
2006-08-30Paper
A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
Discrete Applied Mathematics
2006-08-14Paper
Tessellating polyominos in the plane
Discrete Mathematics
2006-08-04Paper
Rearrangeability of bit permutation networks
Theoretical Computer Science
2006-03-24Paper
Equivalence of buddy networks with arbitrary number of stages
Networks
2006-01-10Paper
On 3-stage Clos networks with different nonblocking requirements on two types of calls
Journal of Combinatorial Optimization
2005-10-18Paper
Partition-Optimization with Schur Convex Sum Objective Functions
SIAM Journal on Discrete Mathematics
2005-09-16Paper
Strictly Nonblocking Multirate logd(N,m,p) Networks
SIAM Journal on Computing
2005-09-16Paper
A competitive algorithm to find all defective edges in a graph
Discrete Applied Mathematics
2005-08-05Paper
scientific article; zbMATH DE number 2148699 (Why is no real title available?)2005-03-21Paper
The incremental group testing model for gap closing in sequencing long molecules
Journal of Combinatorial Optimization
2005-03-15Paper
The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)
Journal of Statistical Planning and Inference
2005-02-23Paper
Strict nonblockingness of reduced shuffle‐exchange networks
Networks
2005-02-23Paper
scientific article; zbMATH DE number 2122440 (Why is no real title available?)2004-12-14Paper
scientific article; zbMATH DE number 2104173 (Why is no real title available?)2004-09-28Paper
Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
Journal of Statistical Planning and Inference
2004-01-06Paper
The expected numbers of unresolved positive clones for various random pool designs
Probability in the Engineering and Informational Sciences
2003-11-25Paper
Comments on "Network resilience: a measure of network fault tolerance" [with reply]
IEEE Transactions on Computers
2003-10-16Paper
Using transforming matrices to generate DNA clone grids
Discrete Applied Mathematics
2003-09-09Paper
A general construction for nonblocking crosstalk-free photonic switching networks
Networks
2003-08-20Paper
On Macula's error-correcting pool designs.
Discrete Mathematics
2003-07-29Paper
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
Networks
2003-07-17Paper
A survey on multi-loop networks.
Theoretical Computer Science
2003-05-25Paper
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
SIAM Journal on Discrete Mathematics
2003-01-05Paper
Group testing and fault detection for replicated files
Discrete Applied Mathematics
2002-09-29Paper
A minimal-automaton-based algorithm for the reliability of Con\((d,k,n)\) systems
Methodology and Computing in Applied Probability
2002-08-20Paper
Rare-event component importance for the consecutive-k system
Naval Research Logistics
2002-06-11Paper
The structural Birnbaum importance of consecutive-k systems
Journal of Combinatorial Optimization
2002-05-28Paper
Some permutation routing algorithms for low-dimensional hypercubes
Theoretical Computer Science
2002-03-03Paper
Monotone routing in multirate rearrangeable Clos networks
Journal of Parallel and Distributed Computing
2002-01-27Paper
Structure importance of consecutive-\(k\)-out-of-\(n\) systems
Operations Research Letters
2001-12-05Paper
When is individual testing optimal for nonadaptive group testing?
SIAM Journal on Discrete Mathematics
2001-11-11Paper
A complementary survey on double-loop networks
Theoretical Computer Science
2001-08-20Paper
Lower bounds for wide-sense nonblocking Clos network
Theoretical Computer Science
2001-08-20Paper
Channel graphs of bit permutation networks
Theoretical Computer Science
2001-08-20Paper
A new index of component importance
Operations Research Letters
2001-07-23Paper
CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM”
Probability in the Engineering and Informational Sciences
2001-05-07Paper
Supermodularity in various partition problems
Journal of Global Optimization
2001-03-28Paper
Equivalent double-loop networks
Taiwanese Journal of Mathematics
2001-03-28Paper
scientific article; zbMATH DE number 1576829 (Why is no real title available?)
Network Theory and Applications
2001-03-15Paper
Sortabilities of partition properties
Journal of Combinatorial Optimization
2001-03-04Paper
Partition polytopes over 1-dimensional points
Mathematical Programming. Series A. Series B
2001-03-04Paper
Localizing combinatorial properties for partitions on block graphs
Journal of Combinatorial Optimization
2001-03-04Paper
Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle
Journal of Global Optimization
2001-02-18Paper
Optimal quantitative group testing on cycles and paths
Discrete Applied Mathematics
2001-01-01Paper
Explicit solution of partitioning problems over a 1-dimensional parameter space2000-12-07Paper
Equivalent nondegenerate L-shapes of double-loop networks2000-12-03Paper
scientific article; zbMATH DE number 1334211 (Why is no real title available?)2000-11-26Paper
scientific article; zbMATH DE number 1334212 (Why is no real title available?)2000-11-26Paper
scientific article; zbMATH DE number 1535259 (Why is no real title available?)2000-11-23Paper
scientific article; zbMATH DE number 1535250 (Why is no real title available?)2000-11-23Paper
scientific article; zbMATH DE number 1508646 (Why is no real title available?)2000-09-17Paper
Linear-shaped partition problems
Operations Research Letters
2000-09-04Paper
Reliabilities for \((n,f,k)\) systems
Statistics & Probability Letters
2000-06-07Paper
RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS
Probability in the Engineering and Informational Sciences
2000-01-01Paper
Representations and characterizations of vertices of bounded-shape partition polytopes
Linear Algebra and its Applications
1999-12-19Paper
A Polynomial Time Algorithm for Shaped Partition Problems
SIAM Journal on Optimization
1999-11-24Paper
Interconnecting Highways
SIAM Journal on Discrete Mathematics
1999-06-27Paper
scientific article; zbMATH DE number 1286212 (Why is no real title available?)1999-05-11Paper
scientific article; zbMATH DE number 1222834 (Why is no real title available?)1999-03-22Paper
A unique arithmetic labeling of hexagonal lattices
Journal of Combinatorial Designs
1999-03-09Paper
scientific article; zbMATH DE number 1254658 (Why is no real title available?)1999-02-24Paper
scientific article; zbMATH DE number 1182573 (Why is no real title available?)1999-02-10Paper
Constrained arrangements of objects in a cycle
Taiwanese Journal of Mathematics
1998-10-01Paper
Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube
Theory of Computing Systems
1998-08-30Paper
An O(n log n) algorithm for the generalized birthday problem
Computational Statistics and Data Analysis
1998-07-23Paper
Wide-sense nonblocking for multirate 3-stage Clos networks
Theoretical Computer Science
1998-07-22Paper
Enumerating consecutive and nested partitions for graphs
European Journal of Combinatorics
1998-07-19Paper
The Hamiltonian property of the consecutive-3 digraphs
Mathematical and Computer Modelling
1998-06-25Paper
On 1-rate wide-sense nonblocking for 3-stage Clos networks
Discrete Applied Mathematics
1998-06-09Paper
A simple and direct derivation for the number of noncrossing partitions
Proceedings of the American Mathematical Society
1998-05-06Paper
scientific article; zbMATH DE number 1140232 (Why is no real title available?)1998-04-13Paper
Exact reliabilities of most reliable double-loop networks1998-03-23Paper
Optimality of consecutive and nested tree partitions1997-10-26Paper
Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
Mathematics of Operations Research
1997-07-27Paper
Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs
Operations Research Letters
1997-07-15Paper
Extremal permutations with respect to weak majorizations
European Journal of Combinatorics
1997-05-28Paper
Optimality of Nested Partitions and Its Application to Cluster Analysis
SIAM Journal on Optimization
1997-04-27Paper
A \(d\)-move local permutation routing for the \(d\)-cube
Discrete Applied Mathematics
1997-03-05Paper
Localizing combinatorial properties of partitions
Discrete Mathematics
1996-12-08Paper
scientific article; zbMATH DE number 933200 (Why is no real title available?)1996-11-25Paper
scientific article; zbMATH DE number 895369 (Why is no real title available?)1996-10-13Paper
scientific article; zbMATH DE number 842132 (Why is no real title available?)1996-09-02Paper
scientific article; zbMATH DE number 857071 (Why is no real title available?)1996-08-13Paper
scientific article; zbMATH DE number 806865 (Why is no real title available?)1996-02-11Paper
Assembly at system level versus component level
Operations Research Letters
1996-02-08Paper
scientific article; zbMATH DE number 823957 (Why is no real title available?)1995-12-06Paper
The time complexity of deterministic broadcast radio networks
Discrete Applied Mathematics
1995-09-06Paper
An isomorphic factorization of the complete graph
Journal of Graph Theory
1995-05-14Paper
Enumerating nested and consecutive partitions
Journal of Combinatorial Theory. Series A
1995-05-11Paper
Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules
Operations Research
1995-02-06Paper
Survival reliability of some double-loop networks and chordal rings
IEEE Transactions on Computers
1995-01-01Paper
Majorization and Schur Convexity with Respect to Partial Orders
Mathematics of Operations Research
1994-10-13Paper
A new competitive algorithm for the counterfeit coin problem
Information Processing Letters
1994-09-25Paper
Cutting numbers for the forward loop backward hop network
Discrete Applied Mathematics
1994-09-04Paper
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders
SIAM Journal on Discrete Mathematics
1994-08-14Paper
The Hamiltonian property of consecutive-\(d\) digraphs
Mathematical and Computer Modelling
1994-06-12Paper
Constrained partitioning problems
Discrete Applied Mathematics
1994-05-26Paper
scientific article; zbMATH DE number 568808 (Why is no real title available?)1994-05-17Paper
Consecutive-2-of-n:F systems with node and link failures
IEEE Transactions on Reliability
1994-04-21Paper
Minimal‐distance routing for KYKLOS II
Networks
1994-03-24Paper
Competitive group testing
Discrete Applied Mathematics
1994-03-21Paper
Most reliable double loop networks in survival reliability
Networks
1993-12-20Paper
Erratum to: Binary vectors with exactly \(k\) nonoverlapping \(m\)-tuples of consecutive ones
Discrete Applied Mathematics
1993-12-10Paper
An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system
IEEE Transactions on Reliability
1993-10-04Paper
ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
International Journal of Foundations of Computer Science
1993-06-29Paper
A two‐stage network with dual partial concentrators
Networks
1993-06-29Paper
scientific article; zbMATH DE number 176256 (Why is no real title available?)1993-05-18Paper
Reducing the Steiner Problem in a Normed Space
SIAM Journal on Computing
1993-03-09Paper
The Steiner tree problem
Annals of Discrete Mathematics
1993-01-23Paper
The capacity of the subarray partial concentrators
Discrete Applied Mathematics
1993-01-17Paper
An improved upper bound for the subarray partial concentrators
Discrete Applied Mathematics
1993-01-16Paper
Generalization of an engineering principle
Operations Research Letters
1993-01-16Paper
Reliabilities of chordal rings
Networks
1992-10-13Paper
scientific article; zbMATH DE number 65702 (Why is no real title available?)1992-09-27Paper
Steiner Minimal Trees on Chinese Checkerboards1992-09-27Paper
Steiner tree problems
Networks
1992-06-28Paper
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
Algorithmica
1992-06-28Paper
The rectilinear Steiner arborescence problem
Algorithmica
1992-06-28Paper
An explicit solution for the number of minimal p-cutsequences in a consecutive-k-out of-n:F system
IEEE Transactions on Reliability
1992-06-28Paper
A primer of the Euclidean Steiner problem
Annals of Operations Research
1992-06-27Paper
scientific article; zbMATH DE number 26861 (Why is no real title available?)1992-06-27Paper
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization
Operations Research Letters
1992-06-26Paper
Knockout tournaments with diluted Bradley-Terry preference schemes
Journal of Statistical Planning and Inference
1991-01-01Paper
Using combinatorial designs to construct partial concentrators
IEEE Transactions on Communications
1991-01-01Paper
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
Discrete Applied Mathematics
1991-01-01Paper
Comments on Bern's probabilistic results on rectilinear Steiner trees
Algorithmica
1990-01-01Paper
scientific article; zbMATH DE number 4152198 (Why is no real title available?)1990-01-01Paper
The Steiner ratio conjecture of Gilbert and Pollak is true.
Proceedings of the National Academy of Sciences
1990-01-01Paper
An Improved Algorithm for Steiner Trees
SIAM Journal on Applied Mathematics
1990-01-01Paper
Optimal Assembly of an s-Stage k-Out-of-n System
SIAM Journal on Discrete Mathematics
1990-01-01Paper
On optimal nested group testing algorithms
Journal of Statistical Planning and Inference
1990-01-01Paper
Optimal Assignment of Components to a Two-Stage k-Out-of-n System
Mathematics of Operations Research
1989-01-01Paper
Multistate consecutively-connected systems
IEEE Transactions on Reliability
1989-01-01Paper
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
Operations Research Letters
1989-01-01Paper
Cutoff Point and Monotonicity Properties for Multinomial Group Testing
SIAM Journal on Discrete Mathematics
1989-01-01Paper
scientific article; zbMATH DE number 4174942 (Why is no real title available?)1989-01-01Paper
Optimal relayed mobile communication systems
IEEE Transactions on Reliability
1989-01-01Paper
Diameters of weighted double loop networks
Journal of Algorithms
1988-01-01Paper
Generalized de Bruijn digraphs
Networks
1988-01-01Paper
A decomposition theorem on Euclidean Steiner minimal trees
Discrete & Computational Geometry
1988-01-01Paper
Stronger players win more balanced knockout tournaments
Graphs and Combinatorics
1988-01-01Paper
The existence of symmetric skew balanced starters for odd prime powers
European Journal of Combinatorics
1988-01-01Paper
A Fundamental Monotonicity in Group Testing
SIAM Journal on Discrete Mathematics
1988-01-01Paper
Existence of Symmetric Skew Balanced Starters for Odd Prime Powers1988-01-01Paper
A direct algorithm for computing reliability of a consecutive-k cycle
IEEE Transactions on Reliability
1988-01-01Paper
Asymptotic results for partial concentrators
IEEE Transactions on Communications
1988-01-01Paper
Relayed consecutive-k-out-of-n:F lines
IEEE Transactions on Reliability
1988-01-01Paper
scientific article; zbMATH DE number 4043100 (Why is no real title available?)1987-01-01Paper
Steiner minimal trees for bar waves
Acta Mathematicae Applicatae Sinica. English Series
1987-01-01Paper
Steiner minimal trees on sets of four points
Discrete & Computational Geometry
1987-01-01Paper
Redundant consecutive-k systems
Operations Research Letters
1987-01-01Paper
The Hamiltonian property of linear functions
Operations Research Letters
1987-01-01Paper
Some inequalities concerning random subsets of a set (Corresp.)
IEEE Transactions on Information Theory
1987-01-01Paper
Optimal Assignments for Consecutive-2 Graphs
SIAM Journal on Algebraic Discrete Methods
1987-01-01Paper
Cutoff points for roll call protocols in multiple access systems
IEEE Transactions on Information Theory
1987-01-01Paper
Optimal Consecutive-2-Out-of-n Systems
Mathematics of Operations Research
1986-01-01Paper
Simplified Reliabilities for Consecutive-k-out-of-nSystems
SIAM Journal on Algebraic Discrete Methods
1986-01-01Paper
On Nonblocking Multiconnection Networks
IEEE Transactions on Communications
1986-01-01Paper
A linear time algorithm for full Steiner trees
Operations Research Letters
1986-01-01Paper
Do local majorities force a global majority?
Discrete Mathematics
1986-01-01Paper
Fixed Sample-Size Multinomial Selection in Scalar Zones
American Journal of Mathematical and Management Sciences
1986-01-01Paper
Least-Favorable Configurations in the Multinomial Selection Problem: A Survey
American Journal of Mathematical and Management Sciences
1986-01-01Paper
On a conjecture of trietsch and handler on the flow-dependent steiner ratio
Networks
1986-01-01Paper
Optimal consecutive-2 systems of lines and cycles
Networks
1985-01-01Paper
Failure Distributions of Consecutive-k-out-of-n:F Systems
IEEE Transactions on Reliability
1985-01-01Paper
Steiner Minimal Tree for Points on a Circle1985-01-01Paper
Diagonal and pandiagonal tournament Latin squares
European Journal of Combinatorics
1985-01-01Paper
scientific article; zbMATH DE number 3966091 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3916184 (Why is no real title available?)1985-01-01Paper
Component-level redundancy is better than system-level redundancy for channel graphs
Networks
1985-01-01Paper
scientific article; zbMATH DE number 4016572 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3923864 (Why is no real title available?)1985-01-01Paper
Selecting non-consecutive balls arranged in many lines
Journal of Combinatorial Theory. Series A
1984-01-01Paper
Selecting k objects from a cycle with p pairs of separation s
Journal of Combinatorial Theory. Series A
1984-01-01Paper
A multilication theorem for balanced Howell rotations
Journal of Combinatorial Theory. Series A
1984-01-01Paper
Detection of a Defective Coin with Partial Weight Information
The American Mathematical Monthly
1984-01-01Paper
Complete balanced Howell rotations for 16k + 12 partnerships
Journal of Combinatorial Theory. Series A
1984-01-01Paper
Three Versions of a Group Testing Game
SIAM Journal on Algebraic Discrete Methods
1984-01-01Paper
Some theorems, counterexamples, and conjectures in multinomial selection theory
Communications in Statistics: Theory and Methods
1984-01-01Paper
scientific article; zbMATH DE number 3890425 (Why is no real title available?)1984-01-01Paper
A New Bound for the Steiner Ratio1983-01-01Paper
A partition identity
Discrete Mathematics
1983-01-01Paper
Control Algorithms for Rearrangeable Clos Networks
IEEE Transactions on Communications
1983-01-01Paper
Latin squares and superqueens
Journal of Combinatorial Theory. Series A
1983-01-01Paper
Multiplicative magic squares
Discrete Mathematics
1983-01-01Paper
Optimal Sequencing of Items In a Consecutive-2-out-of-n System
IEEE Transactions on Reliability
1983-01-01Paper
scientific article; zbMATH DE number 3843758 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3868318 (Why is no real title available?)1983-01-01Paper
Fast Solutions for Consecutive-k-out-of-n: F System
IEEE Transactions on Reliability
1982-01-01Paper
New Concepts in Seeding Knockout Tournaments
The American Mathematical Monthly
1982-01-01Paper
Balanced Howell Rotations of the Twin prime Power Type1982-01-01Paper
Minimizing a Combinatorial Function
SIAM Journal on Algebraic Discrete Methods
1982-01-01Paper
Complete balanced Howell rotations for 8k+5 teams
Discrete Mathematics
1982-01-01Paper
Group testing with two defectives
Discrete Applied Mathematics
1982-01-01Paper
scientific article; zbMATH DE number 3819744 (Why is no real title available?)1982-01-01Paper
Symmetric Skew Balanced Starters and Complete Balanced Howell Rotations1982-01-01Paper
A Multistage Selection Scheme for the Most Probable Event
American Journal of Mathematical and Management Sciences
1982-01-01Paper
scientific article; zbMATH DE number 3764823 (Why is no real title available?)1982-01-01Paper
Computing the Blocking Probabilities for Spiderweb Channel Graphs
IEEE Transactions on Communications
1982-01-01Paper
scientific article; zbMATH DE number 3772706 (Why is no real title available?)1982-01-01Paper
Comparisons on Blocking Probabilities for Regular Series Parallel Channel Graphs
Bell System Technical Journal
1982-01-01Paper
Optimal partitions
Journal of Optimization Theory and Applications
1981-01-01Paper
A Group Testing Problem on Two Disjoint Sets
SIAM Journal on Algebraic Discrete Methods
1981-01-01Paper
Cycle Polynomials1981-01-01Paper
Hypergeometric and Generalized Hypergeometric Group Testing
SIAM Journal on Algebraic Discrete Methods
1981-01-01Paper
A Boundary Problem for Group Testing
SIAM Journal on Algebraic Discrete Methods
1981-01-01Paper
scientific article; zbMATH DE number 3730190 (Why is no real title available?)1981-01-01Paper
Characterization for Series-Parallel Channel Graphs
Bell System Technical Journal
1981-01-01Paper
Efficient Realization Techniques for Network Flow Patterns
Bell System Technical Journal
1981-01-01Paper
Optimal Merging of 3 Elements with n Elements
SIAM Journal on Computing
1980-01-01Paper
Stronger players win more knockout tournaments in average
Communications in Statistics: Theory and Methods
1980-01-01Paper
An explicit expression for the cost of a class of Huffman trees
Discrete Mathematics
1980-01-01Paper
A Group Testing Problem
SIAM Journal on Algebraic Discrete Methods
1980-01-01Paper
The Connection Patterns of Two Complete Binary Trees
SIAM Journal on Algebraic Discrete Methods
1980-01-01Paper
Maximum Wealth Trees
Mathematics of Operations Research
1980-01-01Paper
Blocking Probabilities for a Class of Spiderweb Channel Graphs
IEEE Transactions on Communications
1980-01-01Paper
scientific article; zbMATH DE number 3782264 (Why is no real title available?)1980-01-01Paper
Majorization on a Partially Ordered Set1979-01-01Paper
Three-Stage Multiconnection Networks Which Are Nonblocking in the Wide Sense
Bell System Technical Journal
1979-01-01Paper
An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM
1979-01-01Paper
An O(n log n) algorithm for suboptimal rectilinear Steiner trees
IEEE Transactions on Circuits and Systems
1979-01-01Paper
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
Networks
1979-01-01Paper
Crisscross latin squares
Journal of Combinatorial Theory. Series A
1979-01-01Paper
Generalized Huffman Trees
SIAM Journal on Applied Mathematics
1979-01-01Paper
Crisscross latin squares
Journal of Combinatorial Theory. Series A
1979-01-01Paper
Some Realizability Theorems in Group Testing
SIAM Journal on Applied Mathematics
1979-01-01Paper
On the construction of balanced switching networks
Networks
1979-01-01Paper
scientific article; zbMATH DE number 3687391 (Why is no real title available?)1979-01-01Paper
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
Bell System Technical Journal
1979-01-01Paper
scientific article; zbMATH DE number 3634275 (Why is no real title available?)1979-01-01Paper
Minimum range sequences of all k-subsets of a set
Discrete Mathematics
1978-01-01Paper
A Lower Bound for the Steiner Tree Problem
SIAM Journal on Applied Mathematics
1978-01-01Paper
Do Stronger Players Win More Knockout Tournaments?1978-01-01Paper
Link designs and probability analyses for a class of connecting networks
Networks
1978-01-01Paper
Distribution of integers into k-tuples with prescribed conditions
Journal of Combinatorial Theory. Series A
1978-01-01Paper
A Note on Hypergeometric Group Testing Procedures
SIAM Journal on Applied Mathematics
1978-01-01Paper
On Blocking Probabilities for a Class of Linear Graphs
Bell System Technical Journal
1978-01-01Paper
scientific article; zbMATH DE number 3590054 (Why is no real title available?)1978-01-01Paper
The Construction for Symmetrical Zone-Balanced Networks
Bell System Technical Journal
1978-01-01Paper
Some Optimal Partition Problems with Applications to Switching Networks
IEEE Transactions on Communications
1978-01-01Paper
A Generalization of Takagi's Theorem on Optimal Channel Graphs
Bell System Technical Journal
1978-01-01Paper
Neighbor designs
Journal of Combinatorial Theory. Series A
1977-01-01Paper
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
IEEE Transactions on Computers
1977-01-01Paper
Rectilinear steiner trees: Efficient special-case algorithms
Networks
1977-01-01Paper
A generalization of the Karlin-McGregor theorem on coincidence probabilities and an application to clustering
The Annals of Probability
1977-01-01Paper
scientific article; zbMATH DE number 3596872 (Why is no real title available?)1977-01-01Paper
On Blocking Probabilities for Switching Networks
Bell System Technical Journal
1977-01-01Paper
A Probability Inequality and Its Application to Switching Networks
Bell System Technical Journal
1977-01-01Paper
scientific article; zbMATH DE number 3543453 (Why is no real title available?)1977-01-01Paper
A problem on blocking probabilities in connecting networks
Networks
1977-01-01Paper
Construction for Group-Balanced Connecting Networks
Bell System Technical Journal
1977-01-01Paper
scientific article; zbMATH DE number 3623595 (Why is no real title available?)1977-01-01Paper
On Steiner Minimal Trees with Rectilinear Distance
SIAM Journal on Applied Mathematics
1976-01-01Paper
scientific article; zbMATH DE number 3520428 (Why is no real title available?)1976-01-01Paper
Use of Steiner's problem in suboptimal routing in rectilinear metric
IEEE Transactions on Circuits and Systems
1976-01-01Paper
New constructions for balanced Howell rotations
Journal of Combinatorial Theory. Series A
1976-01-01Paper
Group testing with a dilution effect
Biometrika
1976-01-01Paper
New classes of complete balanced Howell rotations
Journal of Combinatorial Theory. Series A
1976-01-01Paper
Construction of 2-balanced \((n,k,\lambda)\) arrays
Pacific Journal of Mathematics
1976-01-01Paper
An Optimum Nested Procedure in Binomial Group Testing
Biometrics
1976-01-01Paper
scientific article; zbMATH DE number 3517205 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3536101 (Why is no real title available?)1976-01-01Paper
On the Rearrangeability of Some Multistage Connecting Networks
Bell System Technical Journal
1976-01-01Paper
A Generalized Binomial Group Testing Problem1975-01-01Paper
scientific article; zbMATH DE number 3484069 (Why is no real title available?)1975-01-01Paper
Isolating a Single Defective Using Group Testing1974-01-01Paper
A direct method to construct triple systems
Journal of Combinatorial Theory. Series A
1974-01-01Paper
On Finding a Single Defective in Binomial Group Testing1974-01-01Paper
scientific article; zbMATH DE number 3468144 (Why is no real title available?)1974-01-01Paper
Constructions for some classes of neighbor designs
The Annals of Statistics
1973-01-01Paper
A Class of Merging Algorithms
Journal of the ACM
1973-01-01Paper
scientific article; zbMATH DE number 3500898 (Why is no real title available?)1973-01-01Paper
Rearrangeability of multi‐connection three‐stage clos networks
Networks
1972-01-01Paper
A Method for Detecting All Defective Members in a Population by Group Testing1972-01-01Paper
A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
SIAM Journal on Computing
1972-01-01Paper
Constructions for balanced Howell rotations for bridge tournaments
Journal of Combinatorial Theory. Series A
1972-01-01Paper
scientific article; zbMATH DE number 3395229 (Why is no real title available?)1972-01-01Paper
Optimal merging of 2 elements with n elements
Acta Informatica
1971-01-01Paper
On generating a random sequence
Journal of Applied Probability
1971-01-01Paper
On Beneš Rearrangeable Networks
Bell System Technical Journal
1971-01-01Paper
scientific article; zbMATH DE number 3390171 (Why is no real title available?)1971-01-01Paper
scientific article; zbMATH DE number 3341138 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3347358 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3449749 (Why is no real title available?)1969-01-01Paper
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Frank K. Hwang