Department of Computer Science - University of Texas at Austin

Adam Klivans Wins Test of Time Award at FOCS 2025

The recognition is for a 2005 paper titled “Agnostically Learning Halfspaces,” which Klivans co-authored with Adam Tauman Kalai (TTI-Chicago), Yishay Mansour (Tel Aviv University), and Rocco A.

The AI leader's new balance: What changes (and what remains) in the age of algorithms

Successful leaders will harness the power of AI while amplifying essential human capabilities. Three experts share essential ...
IEEE

Investigating the Computational Complexity of the Genetic Algorithm with Variations in Population Size and the Number of Generations

Abstract: The paper is dedicated to assessing the computational complexity of the genetic algorithm as one of the key tools for solving optimization problems. The main types of algorithmic complexity ...
IEEE

Low-Complexity Sparse Compensation MRC Detection Algorithm for OTSM Systems

Abstract: Orthogonal time sequency multiplexing (OTSM) has recently attracted significant attention due to its enhanced robustness in doubly selective fading channels. However, the computational ...