default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Ching Yao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Shoou-Ren Hsiau, Yi-Ching Yao:
Stochastic ordering results on the duration of the gambler's ruin game. J. Appl. Probab. 61(2): 603-621 (2024)- 2021
- [j20]Shoou-Ren Hsiau, May-Ru Chen, Yi-Ching Yao:
Stochastic ordering for birth-death processes with killing. J. Appl. Probab. 58(3): 708-720 (2021)
2010 – 2019
- 2017
- [j19]Yi-Ching Yao
, Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin:
Corrected discrete approximations for the conditional and unconditional distributions of the continuous scan statistic. J. Appl. Probab. 54(1): 304-319 (2017) - [j18]Bisharah Libbus, Gordon Simons, Yi-Ching Yao:
Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem. Am. Math. Mon. 124(2): 149-160 (2017) - 2014
- [j17]Yi-Ching Yao, Shih-Chieh Chen, Shao-Hsuan Wang:
On compatibility of discrete full conditional distributions: A graphical representation approach. J. Multivar. Anal. 124: 1-9 (2014) - [j16]Ronald W. Wolff, Yi-Ching Yao:
Little's law when the average waiting time is infinite. Queueing Syst. Theory Appl. 76(3): 267-281 (2014) - [j15]Yi-Ching Yao, Daniel Wei-Chung Miao:
Sample-path analysis of general arrival queueing systems with constant amount of work for all customers. Queueing Syst. Theory Appl. 76(3): 283-308 (2014) - 2013
- [j14]Yi-Ching Yao:
A Duality Relation Between the Workload and Attained Waiting Time in FCFS G/G/s Queues. J. Appl. Probab. 50(1): 300-307 (2013)
2000 – 2009
- 2002
- [j13]Frank K. Hwang, Yi-Ching Yao, Bhaskar DasGupta:
Some permutation routing algorithms for low-dimensional hypercubes. Theor. Comput. Sci. 270(1-2): 111-124 (2002)
1990 – 1999
- 1998
- [j12]Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao:
Localizing Combinatorial Properties for Partitions on Block Graphs. J. Comb. Optim. 2(4): 429-441 (1998) - [j11]Frank K. Hwang, Yi-Ching Yao:
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. Theory Comput. Syst. 31(1): 63-66 (1998) - 1997
- [j10]Frank K. Hwang, Yi-Ching Yao, Miltos D. Grammatikakis:
A d-move Local Permutation Routing for the d-cube. Discret. Appl. Math. 72(3): 199-207 (1997) - 1996
- [j9]Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao:
Localizing combinatorial properties of partitions. Discret. Math. 160(1-3): 1-23 (1996) - [j8]Gordon Simons, Yi-Ching Yao:
Asymptotic sine laws arising from alternating random permutations and sequences. Random Struct. Algorithms 8(1): 75-95 (1996) - 1993
- [j7]Samuel Karlin, Bo Lindqvist, Yi-Ching Yao:
Markoc Chains on Hypercubes: Spectral Representations and Several Mahorization Relations. Random Struct. Algorithms 4(1): 1-36 (1993) - 1991
- [j6]Frank K. Hwang, Yi-Ching Yao:
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. Oper. Res. Lett. 10(4): 241-243 (1991) - 1990
- [j5]Frank K. Hwang, Yi-Ching Yao:
Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. Algorithmica 5(4): 591-598 (1990) - [j4]Yi-Ching Yao, Frank K. Hwang:
On the cutoff point for pairwise enabling for infinite users in a multiaccess system. IEEE Trans. Inf. Theory 36(5): 1183-1186 (1990)
1980 – 1989
- 1989
- [j3]Frank K. Hwang, Yi-Ching Yao:
A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. IEEE Trans. Inf. Theory 35(3): 698-700 (1989) - 1988
- [j2]Yi-Ching Yao, Frank K. Hwang:
A Fundamental Monotonicity in Group Testing. SIAM J. Discret. Math. 1(2): 256-259 (1988) - 1985
- [j1]Yi-Ching Yao:
Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing. IEEE Trans. Inf. Theory 31(3): 444-446 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
