Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
A data graph is obtained from a data structure by masking out the specific data items at the nodes of the structure and concentrating only on the linkages in the structure. This factoring operation is done implicitly when one refers to "tree structures" or "arrays" as generic objects. Structural uniformities in data graphs can often be exploited to facilitate and systematize the accessing of nodes in the graph and the implementation of the graph in a computer. This paper presents a model for data graphs which can be used to study such uniformities. The main results reported algebraically characterize, in terms of structural uniformities, those classes of data graphs which can be implemented by "relative addressing" and by "relocatable realizations". © 1971 Academic Press, Inc.
J. LaRue, C. Ting
Proceedings of SPIE 1989
Leo Liberti, James Ostrowski
Journal of Global Optimization
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Jianke Yang, Robin Walters, et al.
ICML 2023