Seth Chaiken Ph.D., MIT Associate Professor sdc@cs.albany.edu  (Personal Page) Computer Science Department University at Albany Albany, NY 12222 (518) 442-4282 (518) 442-5638 (FAX)

Personal Statement of Research

My research interests are in combinatorial theory and linear algebra and their applications to electronic circuits, computer architecture, algorithms, and computational geometry. These subjects have a history in which graph theory and more recently matroid theory reflect some of their discrete aspects. I am investigating how properties of discrete models of digital circuits used in VLSI can be interpreted in terms of the electrical behavior of a circuit in ways rigorous enough to base computer aided verification systems. One goal is to understand what aspects of an electronic circuit's designed operation can be explained using combinatorial terms, or using approximations, without full numerical solution. This research is in collaboration with Professor Narendran. I am also interested in workstation laboratory environments for investigations in graph theory and computational geometry, and in GUI and object oriented design and programming.

Selected Publications

The Tutte polynomial of a ported matroid, J. Combinatorial Theory Series B, 46 (1989), 96-117.

Y. C. Wee, S. Chaiken and D. E. Willard, On the Angle Restricted Nearest Neighbor Problem, Information Processing Letters, 34 (1990), 71-76.

S. Chaiken, J.C. Hidalgo, and P. Narendran, A New Circuit Interpretation of the Switch Model for Digital MOS Systems, Technical Report, submitted for publication.

J.C. Hidalgo, P. Narendran, and S. Chaiken, Computation of Signal Delays in RC Networks, 5th NASA Space Engineering Research Center Symposium on VLSI Design, 6.2.1-6.2.11, 1993.