Conference paper
Process-variation-tolerant zero skew clock routing
Shen Lin, C.K. Wong
Annual ASIC Conference and Exhibit 1993
The well-known lower bound of log2n! on the number of comparisons required to sort n items is extended to cover algorithms, such as replacement selection, which produce a sorted string whose length is a random variable. The case of algorithms which produce several strings is also discussed and these results are then applied to obtain an upper bound on the length of strings produced by a class of string generation algorithms. © 1972 Springer-Verlag.
Shen Lin, C.K. Wong
Annual ASIC Conference and Exhibit 1993
Jan-Ming Ho, G. Vijayan, et al.
Integration, the VLSI Journal
Shou-Hsuan Stephen Huang, C.K. Wong
Acta Informatica
C. Chiang, C.K. Wong, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems