Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
The classical algorithm for testing unique decipherability of codes is improved by using McCreight’s algorithm for constructing suffix trees. The complexity of the algorithm is O(nm) where n is the number of codewords and m is their total length. Efficiency is gained by avoiding repeatedly comparing subwords of the codewords. © 1982. IEEE. All rights reserved.
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Pradip Bose
VTS 1998
Bowen Zhou, Bing Xiang, et al.
SSST 2008