(919) 962-1788 (Voice)
(919) 962-1799 (Fax)
stanat@cs.unc.edu
Han, T., and D. F. Stanat. "'Move and Smooth' Routing Algorithms on Mesh-Connected Computers," Proc. 28th Annual Allerton Conference on Communication, Control, and Computing, 3-5 Oct. 1990.
Thomas, T. A., and D. F. Stanat. "An FP Domain with Infinite Objects," Proc. Mathematical Foundations of Programming Semantics, Kansas State Univ., Manhattan, Kan., 11-12 April 1985. Lecture Notes in Computer Science #239, Springer-Verlag, 1986, 324-341.
Frank, G. A., W. E. Siddall, and D. F. Stanat. "Virtual Memory Schemes for an FFP Machine," Proc. International Workshop on High-Level Computer Architecture '84, May 1984.
Stanat, D. F., and E. H. Williams, Jr. "Optimal Associative Searching on a Cellular Computer," Proc. 1981 Conference on Functional Programming Languages and Computer Architecture, Oct. 1981, 99-106.
Bentley, J. L., J. M. Steele, and D. F. Stanat. "Analysis of a Randomized Data Structure for Representing Ordered Sets," Proc. 19th Annual Allerton Conference on Communication, Control, and Computing, Sept. 1981.
Stanat, D. F., and D. F. McAllister. Discrete Mathematics in Computer Science, Englewood Cliffs, N.J.: Prentice-Hall, 1977, 401 pp.