Anna Gál
The University of Texas at Austin(US)
Publications by Year
Research Areas
Complexity and Algorithms in Graphs, Cryptography and Data Security, Coding theory and cryptography, semigroups and automata theory, Advanced Graph Theory Research
Most-Cited Works
- → Superpolynomial Lower Bounds for Monotone Span Programs(1999)85 cited
- → Communication Complexity of Simultaneous Messages(2003)84 cited
- → Lower bounds for the complexity of reliable Boolean circuits with noisy gates(1994)80 cited
- → The Cell Probe Complexity of Succinct Data Structures(2007)63 cited
- → Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence(2007)62 cited
- → Batch Codes Through Dense Graphs Without Short Cycles(2016)39 cited
- → Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs(1996)36 cited
- → Lower bounds for monotone span programs(1995)28 cited
- → Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity(2005)28 cited
- → Computing from partial solutions(2003)27 cited