Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Gál, Anna - Department of Computer Sciences, University of Texas at Austin
Lower Bounds for Monotone Span Programs \Lambda Amos Beimel y Anna G'al z Mike Paterson x
The Cell Probe Complexity of Succinct Data Anna G al 1 and Peter Bro Miltersen 2
Superpolynomial Lower Bounds for Monotone Span Programs
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs \Lambda
SIAM J. COMPUT. c # 2005 Society for Industrial and Applied Mathematics
On the Correlation Between Parity and Modular Polynomials
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates \Lambda
THE UNIVERSITY OF CHICAGO COMBINATORIAL METHODS IN BOOLEAN FUNCTION COMPLEXITY
Incremental branching programs Anna Gal #
Anna G'al 3 We present a Boolean function in n variables that is computable in depth 2
The Size and Depth of Layered Boolean Circuits Anna Gal and Jing-Tang Jang
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
Three Query Locally Decodable Codes with Higher Correctness Require Exponential
Computing from partial solutions Anna G'al \Lambda Shai Halevi y Richard J. Lipton z Erez Petrank x
Semiunbounded fanin circuits: Boolean vs. arithmetic \Lambda
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates