University of Texas
Computer Sciences
Austin, Texas

Overview
The University of Texas, founded in 1883, is one of the largest universities in the country, with an enrollment of more than 51,000 on the Austin campus alone. There are other branches of the University in Houston, Galveston, San Antonio, and Dallas.

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
Austin, a metropolitan area of more than 656,000 people, is set in the scenic Hill Country of central Texas. The Colorado River, which flows through the city, has been dammed to form the chain of Highland Lakes, which provide opportunities for swimming, boating, and fishing. There are many fine parks and playgrounds. Austin also has five theater groups, several ballet troupes, an excellent symphony orchestra, and about fifty art galleries and is known as the "live music capital of the world."

Programs of Study and Degree Requirements
The Department of Computer Sciences offers programs leading to the M.S.C.S., M.A., and Ph.D. degrees. Programs provide students with a broad education in the various areas of computer sciences and allow specialization through a thesis. The master's program with thesis requires 30 semester hours of course work. The M.S.C.S. is a nonthesis option and requires 36 hours of course work. The Ph.D. requires 18 semester hours of general course work and about 15 more in the area of specialization. This is followed by a written and oral presentation (based on the student's preliminary dissertation proposal) and by a dissertation.

Facilities & Resources
Many different computer systems are available for research use by faculty members and graduate students in the department. Machines available for parallel processing research include two 14-processor Sun Enterprise 5500s and a four processor IBM F50, as well as numerous dual and quad processor Suns and Linux boxes. The department has several research clusters, including an eight-node computational biology cluster, an eight-node cluster dedicated to research in natural language, and a 280-node Linux cluster received on several matching grants from IBM and NSF. These clusters, as well as all public computing resources, are available to everyone via Condor, a resource management tool for widely distributed systems. The department has an immersive theater and video wall for graphics and visualization research. More than 100 Pentium-based machines, including twenty dual- processor Xeons as well as dual- and quad-processor servers, have been donated by Intel for multimedia research. In addition, there are 100 Linux boxes, donated by Compaq, on graduate desks. All departmental computers are networked together using gig or 100 bps Ethernet. Network servers include a research-dedicated NetApps 820 with 2 terabytes of storage, a NetApps F845 with 6 TB of RAID disk that is used for home directory service, and a NetApps FAS 940 filer that is used as a checkpoint server for the large cluster as well as many other file servers, print servers, and communications servers.

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
In 2004-05, tuition and fees for 9 credit hours were approximately $2500 per semester for Texas residents and $4900 per semester for nonresidents.

Financial Aid:
The Doctoral Fellows program guarantees a minimum stipend of $1592 per month for four years. This support consists of a fellowship the first year and either a teaching or a research assistantship during the second, third, and fourth years. Tuition and required fees are covered during the fellowship period. After the fourth year, students can be supported by their supervising professor or through a teaching assistantship.

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:
The cost of a dormitory room averages $6184 for nine months (including board). University housing for married students ranges in cost from $440 to $651 per month. Private housing is available in all price ranges.

How to Apply
The department deadline for fall applications is January 2. Applications are accepted for the spring semester, and the deadline for spring admission is September 1 for all applicants. The GRE General Test and Subject Test in computer science are required of all applicants. International applicants are strongly urged to take the TOEFL. Admission standards are high. An average student admitted to the Ph.D. program has a bachelor's degree in computer science, at least a 3.5 GPA, a combined verbal and quantitative GRE score of at least 1400, and an average score of 85 percent on the computer science Subject Test.

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
Graduate Admissions
Department of Computer Sciences
The University of Texas at Austin
University Station
Austin, Texas 78712-0233

512-471-9503

E-mail: csadmis@cs.utexas.edu

Web site home page

Faculty
• The following list is limited to those faculty members whose primary appointment is in the Department of Computer Sciences.

• 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.

Go To Profile Index Page

Go To Top Of Page