F. K. Hwang - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2017

An analysis of collaborative problem-solving activities mediated by individual-based and collaborative computer simulationsC. J. Chang, M. H. Chang, C. C. Liu, B. C. Chiu, S.-H. Fan Chiang, C.-T. Wen, F. K. Hwang, P.-Y. Chao, Y.-L. Chen, C.-S. Chai. jcal, 33(6):649-662, 2017. [doi]

2009

Generalizing and Fine Tuning Triple-Loop NetworksBey-Chi Lin, F. K. Hwang. join, 10(1-2):133-148, 2009. [doi]

2007

Strictly Nonblocking f-Cast Log::d::(N, m, p) NetworksF. K. Hwang, Y. Wang, J. Tan. tcom, 55(5):981-986, 2007. [doi]

2005

A hierarchy of importance indicesF. K. Hwang. tr, 54(1):169-172, 2005. [doi]

2002

Sortability of Multi-partitionsF. K. Hwang, Y. M. Wang, J. S. Lee. jgo, 24(4):463-472, 2002. [doi]

2001

A new index of component importanceF. K. Hwang. orl, 28(2):75-79, 2001. [doi]

1996

Comment/reply: some recent papers on consecutively-connected systemsF. K. Hwang. tr, 45(1), 1996. [doi]

1995

An isomorphic factorization of the complete graphF. K. Hwang. jgt, 19(3):333-337, 1995. [doi]

1992

Steiner tree problemsF. K. Hwang, Dana S. Richards. networks, 22(1):55-89, 1992. [doi]

1991

Binary vectors with exactly k nonoverlapping m-tuples of consecutive onesF. K. Hwang, S. Papastavridis. DAM, 30(1):83-86, 1991. [doi]

A primer of the Euclidean Steiner problemF. K. Hwang. anor, 33(1):73-84, 1991. [doi]

A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalizationF. K. Hwang, Y. C. Yao. orl, 10(4):241-243, 1991. [doi]

1989

n SystemF. K. Hwang. mor, 14(2):376-382, 1989. [doi]

1988

Stronger players win more balanced knockout tournamentsRobert Chen, F. K. Hwang. gc, 4(1):95-99, 1988. [doi]

1987

Double loop networks with minimum delayF. K. Hwang, Y. H. Xu. DM, 66(1-2):109-118, 1987. [doi]

1986

n SystemsD.-Z. Du, F. K. Hwang. mor, 11(1):187-191, 1986. [doi]

1983

Multiplicative magic squaresD. Borkovitz, F. K. Hwang. DM, 47:1-11, 1983. [doi]

1982

Complete balanced Howell rotations for 8k+5 teamsF. K. Hwang. DM, 39(2):145-151, 1982. [doi]

Computing the Blocking Probabilities for Spiderweb Channel GraphsF. K. Hwang. tcom, 30(8):1916-1918, 1982. [doi]

1980

The Connection Patterns of Two Complete Binary TreesF. R. K. Chung, F. K. Hwang. siammax, 1(3):322-335, 1980. [doi]

An explicit expression for the cost of a class of Huffman treesF. K. Hwang. DM, 32(2):163-165, 1980. [doi]

Maximum Wealth TreesF. K. Hwang. mor, 5(4):487-493, 1980. [doi]

Blocking Probabilities for a Class of Spiderweb Channel GraphsF. K. Hwang. tcom, 28(1):115-117, 1980. [doi]

1979

n points enclosed in a rectangle with given perimeterF. R. K. Chung, F. K. Hwang. networks, 9(1):19-36, 1979. [doi]

On the construction of balanced switching networksF. K. Hwang, S. Lin. networks, 9(4):283-307, 1979. [doi]

1978

Link designs and probability analyses for a class of connecting networksF. K. Hwang. networks, 8(4):287-296, 1978. [doi]

1977

A problem on blocking probabilities in connecting networksF. R. K. Chung, F. K. Hwang. networks, 7(2):185-192, 1977. [doi]

Minimum range sequences of all k-subsets of a setF. K. Hwang, J. C. Lagarias. DM, 19(3):257-264, 1977. [doi]

1973

Hypergeometric group testing algorithmsF. K. Hwang, S. Lin. afips 1974: 452 [doi]

1972

Rearrangeability of multi-connection three-stage clos networksF. K. Hwang. networks, 2(4):301-306, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL