SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Anna Gál: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Amos Beimel, Anna Gál
On Arithmetic Branching Programs. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 1998, pp:68-80 [Conf]
Anna Gál
Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1995, pp:82-87 [Conf]
Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
Computing from Partial Solutions. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 1999, pp:34-45 [Conf]
Anna Gál, Mario Szegedy
Fault Tolerant Circuits and Probabilistically Checkable Proofs. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1995, pp:65-73 [Conf]
Anna Gál, Michal Koucký, Pierre McKenzie
Incremental Branching Programs. [Citation Graph (0, 0)][DBLP]
CSR, 2006, pp:178-190 [Conf]
Amos Beimel, Anna Gál, Mike Paterson
Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
FOCS, 1995, pp:674-681 [Conf]
Anna Gál
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates [Citation Graph (0, 0)][DBLP]
FOCS, 1991, pp:594-601 [Conf]
Jeff Ford, Anna Gál
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
ICALP, 2005, pp:1163-1175 [Conf]
Anna Gál, Peter Bro Miltersen
The Cell Probe Complexity of Succinct Data Structures. [Citation Graph (0, 0)][DBLP]
ICALP, 2003, pp:332-344 [Conf]
Anna Gál, Vladimir Trifonov
On the Correlation Between Parity and Modular Polynomials. [Citation Graph (0, 0)][DBLP]
MFCS, 2006, pp:387-398 [Conf]
Anna Gál
A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:429-437 [Conf]
László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
STOC, 1996, pp:603-611 [Conf]
Anna Gál, Adi Rosén
Lower bounds on the amount of randomness in private computation. [Citation Graph (0, 0)][DBLP]
STOC, 2003, pp:659-666 [Conf]
Anna Gál, Adi Rosén
A Theorem on Sensitivity and Applications in Private Computation. [Citation Graph (0, 0)][DBLP]
STOC, 1999, pp:348-357 [Conf]
Anna Gál
A characterization of span program size and improved lower bounds for monotone span programs. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 2001, v:10, n:4, pp:277-296 [Journal]
Anna Gál
Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 2006, v:15, n:2, pp:93- [Journal]
Amos Beimel, Anna Gál, Mike Paterson
Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1997, v:6, n:1, pp:29-45 [Journal]
László Babai, Anna Gál, Avi Wigderson
Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1999, v:19, n:3, pp:301-319 [Journal]
Anna Gál, Michal Koucký, Pierre McKenzie
Incremental branching programs [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:136, pp:- [Journal]
Amos Beimel, Anna Gál, Mike Paterson
Lower Bounds for Monotone Span Programs [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:1, pp:- [Journal]
Anna Gál
A Simple Function that Requires Exponential Size Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:62, n:1, pp:13-16 [Journal]
Anna Gál, Pavel Pudlák
A note on monotone complexity and the rank of matrices. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:87, n:6, pp:321-326 [Journal]
Anna Gál, Pavel Pudlák
Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:88, n:5, pp:257- [Journal]
Amos Beimel, Anna Gál
On Arithmetic Branching Programs. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1999, v:59, n:2, pp:195-220 [Journal]
Anna Gál, Avi Wigderson
Boolean complexity classes vs. their arithmetic analogs. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1996, v:9, n:1-2, pp:99-111 [Journal]
László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam
Communication Complexity of Simultaneous Messages. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2003, v:33, n:1, pp:137-166 [Journal]
Anna Gál, Adi Rosén
A Theorem on Sensitivity and Applications in Private Computation. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2002, v:31, n:5, pp:1424-1437 [Journal]
Anna Gál, Adi Rosén
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2005, v:34, n:4, pp:946-959 [Journal]
Anna Gál
Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 2006, v:15, n:4, pp:297- [Journal]
Anna Gál, Peter Bro Miltersen
The cell probe complexity of succinct data structures. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:379, n:3, pp:405-417 [Journal]
Incremental branching programs. [Citation Graph (, )][DBLP]
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. [Citation Graph (, )][DBLP]
The Cell Probe Complexity of Succinct Data Structures. [Citation Graph (, )][DBLP]
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. [Citation Graph (, )][DBLP]
The Size and Depth of Layered Boolean Circuits. [Citation Graph (, )][DBLP]

Search in 0.021secs, Finished in 0.022secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP