Conference paper
Bonding, interfacial effects and adhesion in dlc
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
We show that general unlabeled graphs on n nodes can be represented by (n2) - n log2 n + O(n) bits which is optimal up to the O(n) term. Both the encoding and decoding require linear time. © 1990.
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Andrew Skumanich
SPIE Optics Quebec 1993
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004