Anna Gal
Professor
"Department of Computer Science "
University of Texas at Austin
United States of America
Biography
Dr. Gal's research interests are in computational complexity, lower bounds for complexity of Boolean functions, communication complexity, fault tolerance, randomness and computation, algorithms and combinatorics.
Research Interest
Randomness and computation, algorithms
Publications
-
Miltersen (2007) The cell probe complexity of succinct data structures, with Special Issue of selected papers from ICALP. T Com Sci 379: 405 - 417.
-
Gopalan P (2010) Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence, SIAM J Com 39: 3463-3479.
