Welcome to GRACS. We are here to help CS grad students in any way we can. If you need information on degree requirements, research techniques, teaching tools, or things to do in Austin, then you've ...

Left image shows an Iso-surface Rendering of the Haloarcula Marismortui Large Ribosomal 50S subunit (1JJ2) crystal structure(cf. Klein, Schmeing, Moore, Steitz) and based on protein and RNA ...

14 Nov 2017 UT Programming Club Team Wins ACM-ICPC South Central USA Regional Competition ...

Our students and faculty are changing the world through their contributions to computing education, research, and industry. These awards received by members of the UT Computer Science community make ...

2 Wed, 21 Jan 2026 6-7 pm CT GDC 1.406 Beginner's Workshop ...

Some algorithms are more efficient than others. We would prefer to chose an efficient algorithm, so it would be nice to have metrics for comparing algorithm efficiency. The complexity of an algorithm ...

There will be five projects for this class, each emphasizing a different set of important skills. You will begin by writing a shell. Your other projects will exercise your knowledge of threads, user ...

Content: This undergraduate course will cover the basics of algorithms and complexity, including dynamic programming, greedy algorithms, graph algorithms, linear programming, and NP-hardness.

Rapid advances in machine learning have enabled us to build systems with capabilities that were unimaginable just a few years ago, such as AlphaGo, which plays the board game Go better than any human ...

Transaction Processing: Concepts and Techniques (Jim Gray and Andreas Reuter 1993) 1.1 - 1.2.5 4.2, 4.7 and 4.7.1, 4.9 and 4.9.1 ...

August 8, "An Empirical Study on Robustness to Spurious Correlations using Pre-trained Language Models", Tu et al. 2020.[PDF] ...

This course provides students with the fundamentals of computer graphics and data visualization. We will explore graph generation, image manipulation, scene hierarchy, simulation, and interactivity as ...