University of Texas Computer Sciences Austin, Texas
Overview The graduate program in computer sciences was initiated in 1966. The undergraduate program was started in 1974 and has grown to include more than 1,200 computer sciences majors. There are 245 graduate students in computer sciences; more than half of them are pursuing a Ph.D. degree. The department confers an average of fifty master's degrees and fifteen Ph.D. degrees annually. The Location and Community Programs of Study and Degree Requirements Facilities & Resources The department continues to expand these existing departmental computing facilities, both through donations of equipment from manufacturers and through funds provided by the University. Expenses and Aid Financial Aid: The department also employs students as research and teaching assistants at a minimum starting salary of $1500 per month. The computation center has opportunities for qualified students as systems programmers and consultants, and local industries such as IBM, TI, Schlumberger, and Motorola employ students on a part-time basis. Low-interest loans are also available. Housing/Living Expenses: How to Apply Applications are available electronically through the Graduate and International Admissions Center's (GIAC) Web page, which is accessible through the department's Web page. Applicants are strongly urged to read the departmental Web site carefully before proceeding with the application process. Students who do not have Web access many contact the department by phone for information and the paper application. Students should specify the type of application they need (U.S. or international). Who to Contact 512-471-9503 E-mail: csadmis@cs.utexas.edu Faculty • Lorenzo Alvisi. Distributed computing and fault tolerance in distributed systems. • Chandrajit L. Bajaj. Computational algebra, geometry, computer graphics, geometric design, scientific data visualization. • Don Batory. Software architectures, software reuse, extensible and object-oriented databases, domain modeling and software system generators. • Robert S. Boyer. Program verification, automatic theorem proving, artificial intelligence. • James C. Browne. Parallel computation, with the major focus on parallel programming, high-level specification languages, and integration of computer science with application areas. • Douglas Burger. Computer architecture, microprocessor and VLSI design, memory systems, high-performance microarchitectures, application-specific embedded systems. • Alan K. Cline. Mathematical software and numerical analysis. • William R. Cook. Programming languages, software engineering, information security, application architecture. • Michael D. Dahlin. Operating systems and large-scale distributed systems. • Inderjit S. Dhillon. Numerical linear algebra, (parallel) scientific computing, mathematical algorithms for data mining/information retrieval. • E. Allen Emerson. Formal methods, logics and semantics of programs, concurrent and distributed computing. • Donald S. Fussell. Computer architecture, computer graphics, VLSI systems design, database concurrency control. • Anna Gal. Computational complexity, lower bounds for complexity of Boolean functions, fault-tolerant computing, randomness and computation, algorithms, combinatorics. • Mohamed G. Gouda. Distributed and concurrent computing, computing networks. • Warren A. Hunt Jr. Hardware verification, circuit design, mechanized theorem proving. • Stephen W. Keckler. Computer architecture, microprocessor and VLSI design, parallel computing, instruction-level parallelism, embedded systems. • Benjamin J. Kuipers. Artificial intelligence, robotics, qualitative reasoning. • Simon S. Lam. Network protocols, performance models, formal verification methods, security. • Vladimir Lifschitz. Mathematical logic, logic programming, knowledge representation. • Calvin Lin. Compilers and languages for parallel computing, parallel performance analysis, and scientific computing. • William (Bill) Mark. Real-time computer graphics, computer architecture, systems design. • Kathryn S. McKinley. Programming language implementation, compilers, cache and memory management, garbage collection, architecture. • Risto Miikkulainen. Neural networks, natural language processing, cognitive modeling. • Daniel P. Miranker. Parallel computer architecture, active/expert database system, high-performance artificial intelligence systems. • Jayadev Misra. Distributed computing. • Aloysius K. Mok. Fault-tolerant hard-real-time systems, system architecture, computer-aided system design tools, software engineering. • Raymond J. Mooney. Artificial intelligence, machine learning, natural language understanding. • J Strother Moore. Mechanical theorem proving. • Gordon S. Novak Jr. Artificial intelligence, automatic programming, physics problem solving, expert systems, compilers. • C. Greg Plaxton. Parallel computation, analysis of algorithms, lower bounds, randomization. • Bruce W. Porter. Artificial intelligence, machine learning, knowledge-based systems. • Vijaya Ramachandran. Theoretical computer science, graph algorithms and data structures, parallel computation. • Peter Stone. Artificial intelligence, multiagent systems, machine learning, planning, multiagent learning, auctions. • Robert A. van de Geijn. Numerical analysis and parallel processing. • Harrick M. Vin. Multimedia systems, high-speed networking, mobile computing, large-scale distributed systems. • Tandy Warnow. Computational problems in biology, evolutionary trees, statistical inference, experimental methods, graph theory, combinatorics. • Emmett Witchel. Computer architecture and how the architecture is used by operating systems and compiler. • David I. Zuckerman. Role of randomness in computation, complexity theory, coding theory, and cryptography. |