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, lower bounds for complexity of Boolean functions, communication 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

• Faculty Fellowship, Department of Computer Science, University of Texas at Austin, 2000 - present.

• 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

• Award for excellent studies (only grades “A” during high school and undergraduate studies) from the Department of Education of Hungary, 1984

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 Hungarian Academy of Sciences, 1983-1988 Professional Activities: • Associate Editor, ACM Transactions on Computation Theory

• Member of the Scientific Board of the Electronic Colloquium on Computational Complexity (ECCC)

• Member of the Conference Steering Committee for the IEEE Conference on Computational 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 the 14th International Workshop on Randomization and Computation, RANDOM 2010, to be held in September 2010, Barcelona, Spain.

• Program Committee member of the 24th Annual IEEE Conference on Computational Com- plexity, held in July 2009, Paris, France.

• Program Committee member of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in July 2009, Rhodes, Greece.

• Program Committee member of the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in August 2008, at MIT

• Program Committee member of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008, held in February 2008, Bordeaux, France.

• Program Committee member of the International Frontiers of Algorithms Workshop, FAW 2007, held in August 2007, Lanzhou, China.

• Program Committee member of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, held in July 2006, Venice, Italy.

• Program Committee member of the 20th Annual IEEE Conference on Computational Com- plexity, held in June 2005, San Jose.

• Program Committee member of the 9th International Computing and Combinatorics Confer- ence, COCOON 2003, held in July 2003, Big Sky, Montana.

• Program Committee member of the 43rd Annual IEEE Symposium on Foundations of Com- puter Sciences, FOCS 2002, held in November 2002, Vancouver, Canada.

• Program Committee member of the 16th Annual IEEE Conference on Computational Com- plexity, held in June 2001, Chicago.

2 • Program Committee member of the 17th Conference on the Foundations of Software Tech- nology and Theoretical Computer Science, held in December 1997, IIT Kharagpur, India

• Organizer of the Distinguished Lecturer Series of the DIMACS/IAS Special Focus on Discrete Probability, 1996/97

Grants:

• NSF Grant, 08/2010 - 07/2013, $346,480 Title: “Locally Decodable Codes and Space Bounded Computation”

• NSF Grant, 09/2008 - 08/2011, $240,000 Title: “Communication Complexity and Applications”

• NSF Grant, 09/2004 - 08/2008, $150,000 Title: “Communication Complexity and Circuit Complexity”

• Alfred P. Sloan Fellowship, 09/2001-09/2005, $40,000

• NSF CAREER Award, 07/1999-06/2004, $200,000

Former Ph.D. Students:

• Jeff Ford, “Lower Bound Methods for Multiparty Communication Complexity”, Ph. D. Uni- versity of Texas, May 2006. (currently at Microsoft Center for Software Excellence)

• Vladimir Trifonov, “Techniques for Analyzing the Computational Power of Constant-Depth Circuits and Space-Bounded Computation”, Ph. D. University of Texas, August 2006. Received Best Student Paper Award at STOC 2005. (postdoc at the Institute for Advanced Study in Princeton 2006/2007, currently research fellow at Columbia University)

• Andrew Mills, “Lower Bounds and Correctness Results for Locally Decodable Codes”, Ph. D. University of Texas, August 2011.

Former Masters Student:

• Shweta Agrawal, “Algebraic Attacks: A Survey”, MS University of Texas, August 2008.

Current Ph.D. Students: Jing-Tang Keith Jang

3 Selected Publications of Anna G´al

Refereed Papers in Journals

• A. G´al,A. Mills: “Three query locally decodable codes with higher correctness require expo- nential length”, ACM Transactions on Computation Theory, Vol. 3(2): 5, 2012.

• J. Ford, A. G´al:“Hadamard tensors and lower bounds on multiparty communication com- plexity”, To appear in Computational Complexity, 2012.

• A. G´al,V. Trifonov: “On the correlation between parity and modular polynomials”, Theory of Computing Systems, Vol. 50(3), pp. 516-536, 2012.

• A. G´al,Jing-Tang Jang: “The size and depth of layered Boolean circuits”, Information Processing Letters, Vol. 111, No. 5, pp. 213-217, 2011.

• A. G´al,P. Gopalan: “Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence”, SIAM Journal on Computing Vol. 39, No. 8, pp. 3463-3479, 2010.

• A. G´al,M. Koucky and P. McKenzie: “Incremental branching programs”, Invited paper to Special Issue of 1st CSR, Theory of Computing Systems, Volume 43, No. 2, pp. 159-184, 2008.

• A. G´al,Peter Bro Miltersen: “The cell probe complexity of succinct data structures”, Invited paper to Special Issue of 30th ICALP, Theoretical Computer Science, vol. 379, pp. 405 - 417, 2007.

• A. G´al,A. Ros´en:“Omega(log N) lower bounds on the amount of randomness in 2-private computation”, SIAM Journal on Computing, Vol. 34, No. 4, pp. 946-959, 2005.

• A. G´al,P. Pudl´ak:“A note on monotone complexity and the rank of matrices”, Information Processing Letters, Vol. 87, No. 6, 2003, pp. 321-326.

• L. Babai, A. G´al,P. Kimmel, S.V. Lokam: “Communication complexity of simultaneous messages”, SIAM Journal on Computing, 2003, Vol. 33, No. 1, 2003, pp. 137-166.

• A. G´al,A. Ros´en:“A theorem on sensitivity and applications in private computation”, SIAM Journal on Computing, Vol. 31, No. 5, 2002, pp. 1424-1437.

• A. G´al:“A characterization of span program size and improved lower bounds for monotone span programs”, Computational Complexity, Vol. 10, No. 4, 2001, pp. 277-296.

• A. Beimel, A. G´al:“On Arithmetic Branching Programs”, Journal of Computer Systems and Sciences, 59, 1999, pp. 195-220. (Invited paper to Special Issue of the 1998 IEEE Conference on Computational Complexity.)

• L. Babai, A. G´al,A. Wigderson: “Superpolynomial lower bounds for monotone span pro- grams”, Combinatorica 19 (3), 1999, pp. 301-319.

• A. Beimel, A. G´al,M. Paterson: “Lower bounds for monotone span programs”, Computational Complexity, 6, 1996/1997, pp. 29-45.

4 • A. G´al: “A simple function that requires exponential size read once branching programs”, Information Processing Letters 62, 1997, pp. 13-16. • A. G´al,A. Wigderson: “Boolean complexity classes vs. their arithmetic analogs”, Random Structures and Algorithms, Vol. 9, Nos. 1 and 2, 1996, pp. 99-111. • P. G´acs,A. G´al: “Lower bounds for the complexity of reliable Boolean circuits with noisy gates”, IEEE Transactions on Information Theory, Vol. 40, No. 2, 1994, pp. 579-583. • A. G´al:“Complexity of some classes of Boolean matrices”, Mathematicheskie Voprosy Kiber- netiky 1. 1988, pp. 234-236. • A. G´al:“The complexity of triangular matrices and the depth of realization”, MTA SZTAKI K¨ozlem´enyek 32/1985, pp. 81-85.

Refereed Papers in Conference Proceedings

• A. G´al,K. A. Hansen, M. Koucky, P. Pudlak, E. Viola: “Tight bounds on computing error- correcting codes by bounded-depth circuits with arbitrary gates”, In Proceedings of 44th ACM Symposium on Theory of Computing (STOC), pp. 479-494, 2012. • A. G´al,Jing-Tang Jang: “A generalization of Spira’s theorem and circuits with small segre- gators or separators”, In Proceedings of SOFSEM 2012, pp. 264-276. • A. G´al,A. Mills: “Three query locally decodable codes with higher correctness require ex- ponential length”, In Proceedings of 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, pp. 673-684, 2011. • A. G´al,Jing-Tang Jang: “The size and depth of layered Boolean circuits”, In Proceedings of 9th Latin American Theoretical Informatics Symposium, LATIN 2010, LNCS 6034, pp. 372-383, 2010. • A. G´al,P. Gopalan: “Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence”, In Proceedings of 48th IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 294-304. • A. G´al,M. Koucky and P. McKenzie: “Incremental branching programs”, Proceedings of First International Computer Science Symposium in Russia, LNCS 3967, pp. 178-190, 2006. • A. G´al,V. Trifonov: “On the correlation between parity and modular polynomials”, In Pro- ceedings of 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006, LNCS 4162, pp. 387-398. • J. Ford, A. G´al:“Hadamard tensors and lower bounds on multiparty communication com- plexity”, In Proceedings of 32nd International Colloquium on Automata, Languages and Pro- gramming, ICALP 2005, pp. 1163 - 1175. • A. G´al,Peter Bro Miltersen: “The cell probe complexity of succinct data structures”, In Proceedings of 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, pp. 332-344. (Received EATCS best paper award at Track A of ICALP 2003.) • A. G´al, A. Ros´en: “Lower bounds on the amount of randomness in private computation”, In Proceedings of the 35th ACM Symposium on the Theory of Computing, STOC 2003, pp. 659-666.

5 • A. G´al,A. Ros´en: “A theorem on sensitivity and applications in private computation”, In Proceedings of the 31st ACM Symposium on the Theory of Computing, STOC 1999, pp. 348- 357.

• A. G´al:“A characterization of span program size and improved lower bounds for monotone span programs”, In Proceedings of the 30th ACM Symposium on the Theory of Computing, STOC 1998, pp. 429-437.

• A. G´al,S. Halevi, R. Lipton, E. Petrank: “Computing from partial solutions”, In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999, pp. 34-45.

• A. Beimel, A. G´al:“On Arithmetic Branching Programs”, In Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998, pp. 68-80.

• L. Babai, A. G´al,J. Koll´ar,L. R´onyai, T. Szab´o,A. Wigderson: “Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs”, In Proceedings of the 28th ACM Symposium on the Theory of Computing, STOC 1996, pp. 603-611.

• A. Beimel, A. G´al,M. Paterson: “Lower bounds for monotone span programs”, In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, FOCS 1995, pp. 674-681.

• A. G´al:“Semi-unbounded fan-in circuits: Boolean vs. arithmetic”, In Proceedings of the 10th Annual IEEE Structure in Complexity Theory Conference, 1995, pp. 82-87.

• A. G´al,M. Szegedy: “Fault tolerant circuits and probabilistically checkable proofs”, In Pro- ceedings of the 10th Annual IEEE Structure in Complexity Theory Conference, 1995, pp. 65-73.

• A. G´al:“Lower bounds for the complexity of reliable Boolean circuits with noisy gates”, In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, FOCS 1991, pp. 594-601. (Received Machtey Award for best student paper at FOCS 1991.)

Dissertation: A. G´al:“Combinatorial Methods in Boolean Function Complexity”, Ph.D. Thesis, Department of Computer Science, University of Chicago, 1995. Published at Electronic Colloquium on Computational Complexity (http://www.eccc.uni-trier.de/eccc), under Books/Theses.

6