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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
J. Appl. Probab., 2024
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
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
Theor. Comput. Sci., 2002
1998
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.
Theory Comput. Syst., 1998
J. Comb. Optim., 1998
1997
1996
Random Struct. Algorithms, 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
Algorithmica, 1990
1989
A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels.
IEEE Trans. Inf. Theory, 1989
1988
1985
Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing.
IEEE Trans. Inf. Theory, 1985