Anna Gal

Anna Gal is a Professor at the Department of Computer Science, University of Texas at Austin, specializing in computational complexity, communication complexity, coding theory, and circuit complexity. She has made significant contributions to understanding lower bound methods and complexity measures of Boolean functions.

• Ph.D. in Computer Science from University of Chicago (1995)

Her research focuses on theoretical aspects of computer science, including Boolean function analysis, sensitivity vs. block sensitivity, and combinatorial structures in coding theory.

Recent publications indicate a strong emphasis on complexity measures, certificate games, and interactions between coding theory and circuit complexity. Key trends include applications of communication complexity to non-monotone circuits and sensitivity analysis of transitive functions.

Anna Gal has received prestigious awards, including the Machtey Award for best student paper at FOCS 1991 and the EATCS best paper award at ICALP Track A in 2003.

She has advised multiple Ph.D. students, including Jeff Ford, Vladimir Trifonov, Andrew Mills, Keith Jing-Tang Jang, and Siddhesh Chaubal. Her teaching includes advanced courses like Analysis of Boolean Functions and Communication Complexity.