Algorithms and Computation Theory Associated Faculty
Research in algorithms and theory of computation at George Mason provides the mathematical and conceptual backbone for advances across computer science.
Our work explores approximation methods, randomized algorithms, distributed and parallel computation, and complexity theory. We create new ways to reason about efficiency, scalability, and optimization in computing through developing rigorous models and provable guarantees. These advances deepen the theoretical foundations of the discipline and shape practical solutions in areas such as secure communication, data analysis, and large-scale network design.
Earn a BS in Computer Science and gain the mathematical and analytical skills to design scalable solutions, optimize performance, and drive innovation in fields ranging from secure systems to data-intensive applications.