RICHARD CHANG, Assistant Professor; Ph.D., Cornell. Computational complexity theory, structural complexity, analysis of algorithms. Dr. Chang is currently investigating the structural complexity of the approximation versions of NP-complete problems. In particular, he is investigating the lower bounds on the complexity of these problems in terms of bounded queries. He is also interested in comparing various notions of completeness and incompleteness.
DAVID EBERT, Assistant Professor; Ph.D., Ohio State. Computer graphics, scientific visualization, distributed operating systems, distributed databases. Dr. Ebert is currently working on several projects in photo-realistic rendering techniques, realistic interactive volume visualization, modeling natural phenomena, and procedural modeling and texturing techniques.
TIM FININ, Professor and Chair; Ph.D., Illinois, Urbana-Champaign. Artificial intelligence, knowledge representation and reasoning, knowledge and database systems, natural language processing, logic programming. Dr. Finin is currently working on several problems involving the integration of intelligent information systems. One focus is the development of a language and protocol intended to support interoperability among intelligent agents in a distributed application. Another focus involves the integration of databases and knowledge representation and reasoning systems. He is also interested in document and text understanding applications which integrate natural language processing, information retrieval and knowledge-based reasoning.
SAMUEL LOMONACO, Professor; Ph.D., Princeton University. Algebraic coding theory, signal processing, communication theory, cryptography, data compression of visual images, computer visualization, differential geometry,algebraic and differential topology, knot theory, numerical computation, symbolic computation, combinatorics, analysis of algorithms, applications of topology to electrodynamicsand to quantum field theory. Dr. Lomonaco is currently carrying out various research projects involving computational geometry and knot theory and their applications.
JAMES MAYFIELD, Assistant Professor; Ph.D., Berkeley. Dr. Mayfield's research interests lie in natural language processing, information extraction, and hypertext.
ETHAN MILLER, Assistant Professor; Ph.D. Berkeley. Dr. Miller's main research interest is in storage systems, including tertiary storage systems (tapes, optical disks) and highly parallel disk systems. He is also interested in parallel and distributed processing, computer architecture, and operating systems.
HOWARD MOTTELER, Associate Professor; Ph.D., Maryland College Park. Parallel processing and distributed computation. Dr. Motteler's recent work includes research in self-stabilizing systems, conformance testing for communication protocols, and developing applications for atmospheric science on large-scale parallel hardware.
CHARLES NICHOLAS, Associate Professor; Ph.D., Ohio State. Electronic document processing, software engineering, and information retrieval. Dr. Nicholas' recent research has involved the use of AI techniques in hypertext, e.g. automatic link generation, and large-scale document information systems.
YUN PENG, Assistant Professor; Ph.D., Maryland College Park. Artificial intelligence and expert diagnostic systems. He is also interested in graph-theoretic optimization problems and scheduling problems, neural network learning, and computer simulations of aspects of the origin of life.
JAMES SASAKI, Assistant Professor; Ph.D., Cornell. Programming languages, language design, formal semantics, and program verification. Dr. Sasaki's interests include methods for reasoning about languages; semantics and methods for defining semantics; programming logics; and datatypes (especially higher-order and dependent types). Current work includes lazy monadic structures and implementation of constructive and mixed constructive type theories.
ALAN T. SHERMAN, Associate Professor; Ph.D., MIT. Cryptology, discrete algorithms, educational technology, VLSI layout algorithms. His recent work includes projects in cryptanalysis of stream ciphers, automatic language recognition, approximation algorithms for the Geometric Steiner Tree Problem, reversible computation, probabilistic polynomial-time complexity classes, and relationships among algebraic and security properties of cryptographic functions.
DEEPINDER SIDHU, Professor; Ph.D., SUNY at Stony Brook. Computer networks, distributed systems, distributed and heterogeneous databases, parallel and distributed algorithms, computer and communication security, distributed artificial intelligence, high performance computing. Dr. Sidhu's current research projects are: proving and testing convergence in iteration systems, routing in large and dynamic networks, distributed algorithm for finding multiple disjoint paths, congestion control in high speed networks, testing hierarchies for protocols, conditions for fault masking in protocol test sequences, efficient methods for protocol conformance test generation, and formal methods in protocol development.
BROOKE STEPHENS, Associate Professor; Ph.D., Maryland College Park. Parallel processing, database systems, numerical analysis. Dr. Stephen's primary research interests include computational fluid dynamics, and resource allocation problems relating to distributed systems. Secondary research interests include matrix theory, combinatorics, and certain optimization problems.
RUSSELL TURNER , Assistant Professor; Ph.D., Swiss Federal Institute of Technology, Lausanne. Research interests include computer graphics, 3D interaction, and animation. Dr. Turner is currently working on projects to design an object-oriented 3D interaction toolkit and a highly-interactive animation system incorporating physical simulation.
YAACOV YESHA, Professor; Ph.D., Weizmann Institute of Science (Israel). Parallel computing, parallel algorithms, computational complexity, algorithms, theory of computing. Dr. Yesha is working on designing efficient algorithms for the optimal scheduling of parallel programs on parallel architectures, and on designing efficient parallel algorithms for solving discrete problems. He is also interested in lower bounds for parallel and sequential computation, and in the structure of complexity classes.
YELENA YESHA, Professor; Ph.D., Ohio State. Distributed systems, database systems, performance modeling. Dr. Yesha's current research interests include designing tools for optimizing availability in replicated database systems, designing efficient and highly fault tolerant mutual exclusion algorithms and developing analytical performance models for distributed and parallel systems and the area of digital libraries and electronic commerce.