Yi-Ching Yao

Orcid: 0000-0002-0509-5219

According to our database1, Yi-Ching Yao authored at least 21 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stochastic ordering results on the duration of the gambler's ruin game.
J. Appl. Probab., 2024

2021
Stochastic ordering for birth-death processes with killing.
J. Appl. Probab., 2021

2017
Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem.
Am. Math. Mon., 2017

Corrected discrete approximations for the conditional and unconditional distributions of the continuous scan statistic.
J. Appl. Probab., 2017

2014
Sample-path analysis of general arrival queueing systems with constant amount of work for all customers.
Queueing Syst. Theory Appl., 2014

Little's law when the average waiting time is infinite.
Queueing Syst. Theory Appl., 2014

On compatibility of discrete full conditional distributions: A graphical representation approach.
J. Multivar. Anal., 2014

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

2002
Some permutation routing algorithms for low-dimensional hypercubes.
Theor. Comput. Sci., 2002

1998
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.
Theory Comput. Syst., 1998

Localizing Combinatorial Properties for Partitions on Block Graphs.
J. Comb. Optim., 1998

1997
A d-move Local Permutation Routing for the d-cube.
Discret. Appl. Math., 1997

1996
Asymptotic sine laws arising from alternating random permutations and sequences.
Random Struct. Algorithms, 1996

Localizing combinatorial properties of partitions.
Discret. Math., 1996

1993
Markoc Chains on Hypercubes: Spectral Representations and Several Mahorization Relations.
Random Struct. Algorithms, 1993

1991
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization.
Oper. Res. Lett., 1991

1990
On the cutoff point for pairwise enabling for infinite users in a multiaccess system.
IEEE Trans. Inf. Theory, 1990

Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.
Algorithmica, 1990

1989
A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels.
IEEE Trans. Inf. Theory, 1989

1988
A Fundamental Monotonicity in Group Testing.
SIAM J. Discret. Math., 1988

1985
Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing.
IEEE Trans. Inf. Theory, 1985


  Loading...