Curriculum vitae of Anna G´al Address: Department of Computer Science email: [email protected] The University of Texas at Austin Phone: (512) 471-9539 Austin, TX 78712 WWW: http://www.cs.utexas.edu/users/panni Research Interests: Computational complexity theory, lower bound methods, circuit complexity, communi- cation complexity, fault tolerance, randomness and computation, algorithms, combinatorics. Degrees: • Ph.D. in Computer Science at the University of Chicago, August 1995 Ph.D. thesis title: Combinatorial methods in Boolean function complexity Ph.D. thesis advisor: Professor J´anosSimon • Master's degree in Computer Science at the University of Chicago, June 1990 Awards: • Best Paper Award at Track A of ICALP 2003 • Alfred P. Sloan Research Fellowship, 2001-2005 • NSF CAREER Award July 1999 - June 2004 • NSF/DIMACS Postdoctoral Fellowship: Institute for Advanced Study, Princeton 1995- 96; DIMACS at Princeton University, 1996-97. • Machtey Award for \the most outstanding paper written by a student or students" at the 32nd IEEE Symposium on Foundations of Computer Science, FOCS 1991 Employment: • Professor at the Department of Computer Science of the University of Texas at Austin, starting September 1, 2012. • Associate professor at the Department of Computer Science of the University of Texas at Austin, September 1, 2004 - August 31 2012. • Assistant professor at the Department of Computer Science of the University of Texas at Austin, September 1, 1997 - August 31 2004. • Visiting scholar at the Department of Computer Science of the University of Toronto and the Fields Institute in Toronto, January 1998 - July 1998. 1 • NSF/DIMACS postdoctoral fellow September 1995 - August 1997: at the Department of Computer Science of Princeton University, 1996/97 at the School of Mathematics of the Institute for Advanced Study in Princeton, 1995/96. • Research associate at the Computer and Automation Research Institute of the Hun- garian Academy of Sciences, 1983-1988 Professional Activities: • Chair of the Student Life Committee of the Faculty Council of the University of Texas at Austin, 2017-2018. • Associate Editor, ACM Transactions on Computation Theory, 2007 - present • Member of the Scientific Board of the Electronic Colloquium on Computational Com- plexity (ECCC), 2009 - present • Organizer of the 2014, 2017 and 2019 Dagstuhl Workshops on Computational Com- plexity of Discrete Problems, International Research Center, Dagstuhl, Germany. • Member of the Conference Steering Committee for the IEEE Conference on Compu- tational Complexity (3 year term: 2004-2007) • Guest Editor of the Journal Theoretical Computer Science for the Special Issue of ICALP 2006. • Guest Editor of the Journal Computational Complexity for the Special Issue of the 2005 IEEE Conference on Computational Complexity • Program Committee member of various conferences, e.g.: STACS 2021, LATIN 2020, TTCS 2017, ICALP 2016 , MFCS 2014, RANDOM 2010, 2008; ICALP 2009, 2006; Complexity 2009, 2005, 2001; STACS 2008, FAW 2007, COCOON 2003, FOCS 2002. • Reviewer for the journals: Journal of the ACM, SIAM Journal on Computing, IEEE Transactions on Information Theory, ACM Transactions on Theory of Computing, SIAM Journal on Discrete Mathematics, Discrete Applied Mathematics, Random Struc- tures and Algorithms, Theoretical Computer Science, Information Processing Letters, Computational Complexity, European Journal of Combinatorics, Combinatorica, Jour- nal of Algorithms, Journal of Computer Systems and Sciences, International Journal of Foundations of Computer Science. • Organizer of the Distinguished Lecturer Series of the DIMACS/IAS Special Focus on Discrete Probability, 1996/97 2.