Biography

Education

• Ph.D. in Computer Science, Iowa State University, Ames, IA, 1988.
• M.S. in Computer Science, Iowa State University, Ames, IA, 1984.
• B.S. in Computer Science, Iowa State University, Ames, IA, 1979.

Experience

• 1994-present Professor, Computer Science Department, California State Polytechnic University, Pomona.
• 1996-1998 Director, Cal Poly Pomona Intranet Project, California State Polytechnic University, Pomona.
• 1995-1998 Webmaster, California State Polytechnic University, Pomona.
• 1991-94 Associate Professor, Computer Science Department, California State Polytechnic University, Pomona.
• 1988-91 Assistant Professor, Computer Science Department, California State Polytechnic University, Pomona.
• 1982-88 Teaching Assistant, Computer Science Department, Iowa State University.
• 1984-86 IBM Graduate Fellow, Computer Science Department, Iowa State University.
• 1979-82 Scientific Programmer, McDonnell-Douglas Automation Company, St. Louis, MO.
• 1976-79 Programming Consultant, ISU Computation Center, Ames, IA.
• 1975-77 Engineering Draftsman, Stevenson and Schilling, Consulting Engineers, Des Moines, IA.

Areas of Expertise

• Scalable Computing Environments
• Distributed Computing
• Relational Database Design
• World Wide Web Technology
• Cryptography and Secure Communications
• Computability and Computational Complexity
• Formal Languages and Language Translation
• Design and Analysis of Algorithms
• Operating Systems

Invited Presentations and Papers

• "Scalable Authenticated File Service for Ordinary Clients," University of Maryland, College Park, MD, December 2000.
• "Building Large Virtual Communities," IT Colloquium, CSU Monterey Bay, Seaside, CA, March 2000.
• "Extended DCE Authentication Techniques," DCE Academic Users Group Meeting, Brown University, Providence, RI, August 1999.
• "A Solaris/DCE Based Campus Intranet Project," CSU CS/IS Day--Education Partnerships With Industry, Sun Microsystems, Menlo Park, CA, April 1999.
• "A Robust Scalable Infrastructure," Sun Education and Research Conference `99, San Francisco, CA, February 1999.
• "Enterprise File Systems in Action: Cal Poly Pomona," Access your Corporate Assets Seminar, IBM Customer Center, Costa Mesa, CA, October 1998.
• "Serving the Ordinary Non-DCE Desktop," Decorum '98 (the International DCE Conference), San Antonio, TX, March 1998.
• "Building Integrated Computing Services for Large Enterprises," Computer Science Department Colloquium, Cal Poly Pomona, November 1997.
• "DCE Deployment on the University Campus," Southern California DCE Users Group annual meeting, Anaheim, CA, July 1997.
• "The Cal Poly Pomona Intranet," Computer Science Department Colloquium, Cal Poly Pomona, January 1997.
• "A Provider on the World Wide Web," Computer Science Department Colloquium, Cal Poly Pomona, January 1995.
• "The Construction of a Generic Interpreter Server," Computer Science Department Colloquium, CSU San Bernardino, November 1994.
• "Simulating Inheritance using Genericity," Bits and Chips lecture, California State Polytechnic University, Pomona, Winter 1993.
• "The Semantics of Self-Reference--Taking It to the Limit," Bits and Chips lecture, California State Polytechnic University, Pomona, Fall 1991.
• "Zero-Knowledge Interactive Proofs," Bits and Chips lecture, California State Polytechnic University, Pomona, Spring 1991.
• "The complexity of an optimizing finite-state transducer," Poona University, Pune, India, December 1988.
• "The complexity of a counting finite-state automaton," Eighth Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, December 1988.

Publications

• Rich, C.A. "Intranet Project Requirements Analysis and Recommendations," May 1996.
• Rich, C.A. and G. Slutzki. "The Complexity of Optimizing Finite-State Transducers," Theoretical Computer Science 131:323-336, 1994.
• Rich, C.A. "Simulating Inheritance using Genericity," Cal Poly Pomona Computer Science Dept. Technical Report 1993-02.
• Rich, C.A. "The Complexity of Optimizing Finite-State Transducers," Cal Poly Pomona Computer Science Dept. Technical Report 1993-01.
• Rich, C.A. and G. Slutzki. "The complexity of a counting finite-state automaton," Acta Cybernetica 9 (4), 1990.
• Rich, C.A. "Positive relativizations of the P =? NP problem," Journal of Computer and System Sciences 38: 511-523, 1989.
• Rich, C.A. and G. Slutzki. "The complexity of a counting finite-state automaton," Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, in Lecture Notes in Computer Science 338: 225-239,1988.
• Rich, C.A. "On the complexity of two finite-state models--optimizing transducers and counting automata," Ph.D. Dissertation, Computer Science Department, Iowa State University, 1988.