Yi-Ching Yao

According to our database, Yi-Ching Yao authored at least 20 papers between 1985 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Stochastic ordering for birth-death processes with killing.

Shoou-Ren Hsiau, May-Ru Chen, Yi-Ching Yao

J. Appl. Probab., 2021

2017

Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem.

Bisharah Libbus, Gordon Simons, Yi-Ching Yao

Am. Math. Mon., 2017

Corrected discrete approximations for the conditional and unconditional distributions of the continuous scan statistic.

Yi-Ching Yao, Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin

J. Appl. Probab., 2017

2014

Sample-path analysis of general arrival queueing systems with constant amount of work for all customers.

Yi-Ching Yao, Daniel Wei-Chung Miao

Queueing Syst. Theory Appl., 2014

Little's law when the average waiting time is infinite.

Ronald W. Wolff, Yi-Ching Yao

Queueing Syst. Theory Appl., 2014

On compatibility of discrete full conditional distributions: A graphical representation approach.

Yi-Ching Yao, Shih-Chieh Chen, Shao-Hsuan Wang

J. Multivar. Anal., 2014

2013

A Duality Relation Between the Workload and Attained Waiting Time in FCFS G/G/<i>s</i> Queues.

Yi-Ching Yao

J. Appl. Probab., 2013

2002

Some permutation routing algorithms for low-dimensional hypercubes.

Frank K. Hwang, Yi-Ching Yao, Bhaskar DasGupta

Theor. Comput. Sci., 2002

1998

Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.

Frank K. Hwang, Yi-Ching Yao

Theory Comput. Syst., 1998

Localizing Combinatorial Properties for Partitions on Block Graphs.

Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao

J. Comb. Optim., 1998

1997

A d-move Local Permutation Routing for the d-cube.

Frank K. Hwang, Yi-Ching Yao, Miltos D. Grammatikakis

Discret. Appl. Math., 1997

1996

Asymptotic sine laws arising from alternating random permutations and sequences.

Gordon Simons, Yi-Ching Yao

Random Struct. Algorithms, 1996

Localizing combinatorial properties of partitions.

Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao

Discret. Math., 1996

1993

Markoc Chains on Hypercubes: Spectral Representations and Several Mahorization Relations.

Samuel Karlin, Bo Lindqvist, Yi-Ching Yao

Random Struct. Algorithms, 1993

1991

A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization.

Frank K. Hwang, Yi-Ching Yao

Oper. Res. Lett., 1991

1990

On the cutoff point for pairwise enabling for infinite users in a multiaccess system.

Yi-Ching Yao, Frank K. Hwang

IEEE Trans. Inf. Theory, 1990

Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.

Frank K. Hwang, Yi-Ching Yao

Algorithmica, 1990

1989

A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels.

Frank K. Hwang, Yi-Ching Yao

IEEE Trans. Inf. Theory, 1989

1988

A Fundamental Monotonicity in Group Testing.

Yi-Ching Yao, Frank K. Hwang

SIAM J. Discret. Math., 1988

1985

Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing.

Yi-Ching Yao

IEEE Trans. Inf. Theory, 1985