Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates - Anna Gál (FOCS, 1991)

Lower bounds for the complexity of reliable Boolean circuits with noisy gates. - Péter Gács; Anna Gál (IEEE Trans. Inf. Theory, 1994)

Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. - Anna Gál (SCT, 1995)

Fault Tolerant Circuits and Probabilistically Checkable Proofs. - Anna Gál; Mario Szegedy (SCT, 1995)

Boolean Complexity Classes vs. Their Arithmetic Analogs - Anna Gál; Avi Wigderson (Electron. Colloquium Comput. Complex., 1995)

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. - László Babai; Anna Gál; János Kollár; Lajos Rónyai; Tibor Szabó; Avi Wigderson (STOC, 1996)

Lower Bounds for Monotone Span Programs. - Amos Beimel; Anna Gál; Mike Paterson (Comput. Complex., 1997)

A Simple Function that Requires Exponential Size Read-Once Branching Programs. - Anna Gál (Inf. Process. Lett., 1997)

Computing from Partial Solutions. - Anna Gál; Shai Halevi; Richard J. Lipton; Erez Petrank (CCC, 1999)

Superpolynomial Lower Bounds for Monotone Span Programs. - László Babai; Anna Gál; Avi Wigderson (Comb., 1999)

On Arithmetic Branching Programs. - Amos Beimel; Anna Gál (J. Comput. Syst. Sci., 1999)

A characterization of span program size and improved lower bounds for monotone span programs. - Anna Gál (Comput. Complex., 2001)

A Theorem on Sensitivity and Applications in Private Computation. - Anna Gál; Adi Rosén (SIAM J. Comput., 2002)

Lower bounds on the amount of randomness in private computation. - Anna Gál; Adi Rosén (STOC, 2003)

A note on monotone complexity and the rank of matrices. - Anna Gál; Pavel Pudlák (Inf. Process. Lett., 2003)

Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. - Anna Gál; Pavel Pudlák (Inf. Process. Lett., 2003)

Communication Complexity of Simultaneous Messages. - László Babai; Anna Gál; Peter G. Kimmel; Satyanarayana V. Lokam (SIAM J. Comput., 2003)

Incremental branching programs - Anna Gál; Michal Koucký 001; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2005)

Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. - Anna Gál; Adi Rosén (SIAM J. Comput., 2005)

Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. - Anna Gál (Comput. Complex., 2006)

The cell probe complexity of succinct data structures. - Anna Gál; Peter Bro Miltersen (Theor. Comput. Sci., 2007)

Preface: Special Issue of ICALP 2006 - dedicated to the memory of Ingo Wegener. - Anna Gál (Theor. Comput. Sci., 2009)

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. - Anna Gál; Parikshit Gopalan (SIAM J. Comput., 2010)

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. - Anna Gál; Kristoffer Arnsfelt Hansen; Michal Koucký 001; Pavel Pudlák; Emanuele Viola (Electron. Colloquium Comput. Complex., 2011)

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. - Anna Gál; Andrew Mills (Electron. Colloquium Comput. Complex., 2011)

The size and depth of layered Boolean circuits. - Anna Gál; Jing-Tang Jang (Inf. Process. Lett., 2011)

Correctness and Corruption of Locally Decodable Codes. - Mahdi Cheraghchi; Anna Gál; Andrew Mills (Electron. Colloquium Comput. Complex., 2012)

On the Correlation Between Parity and Modular Polynomials. - Anna Gál; Vladimir Trifonov (Theory Comput. Syst., 2012)

Hadamard tensors and lower bounds on multiparty communication complexity. - Jeff Ford; Anna Gál (Comput. Complex., 2013)

A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. - Anna Gál; Jing-Tang Jang (Electron. Colloquium Comput. Complex., 2013)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). - Anna Gál; Michal Koucký 001; Oded Regev 001; Rüdiger Reischuk (Dagstuhl Reports, 2014)

Batch Codes through Dense Graphs without Short Cycles. - Alexandros G. Dimakis; Anna Gál; Ankit Singh Rawat; Zhao Song 002 (Electron. Colloquium Comput. Complex., 2014)

Space-Efficient Approximations for Subset Sum. - Anna Gál; Jing-Tang Jang; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2014)

Optimal combinatorial batch codes based on block designs. - Natalia Silberstein; Anna Gál (Des. Codes Cryptogr., 2016)

Dual VP Classes. - Eric Allender; Anna Gál; Ian Mertz (Comput. Complex., 2017)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). - Anna Gál; Michal Koucký 001; Oded Regev 001; Till Tantau (Dagstuhl Reports, 2017)

New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. - Siddhesh Chaubal; Anna Gál (Electron. Colloquium Comput. Complex., 2018)

Cubic Formula Size Lower Bounds Based on Compositions with Majority. - Anna Gál; Avishay Tal; Adrian Trejo Nuñez (Electron. Colloquium Comput. Complex., 2018)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). - Anna Gál; Rahul Santhanam; Till Tantau (Dagstuhl Reports, 2019)

Lower Bounds for (Non-monotone) Comparator Circuits. - Anna Gál; Robert Robere (Electron. Colloquium Comput. Complex., 2019)

Upper Bounds on Communication in terms of Approximate Rank. - Anna Gál; Ridwan Syed (Electron. Colloquium Comput. Complex., 2019)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). - Anna Gál; Meena Mahajan; Rahul Santhanam; Till Tantau (Dagstuhl Reports, 2021)

Certificate games. - Sourav Chakraborty 001; Anna Gál; Sophie Laplante; Rajat Mittal 001; Anupa Sunny (Electron. Colloquium Comput. Complex., 2022)

Diameter versus Certificate Complexity of Boolean Functions. - Siddhesh Chaubal; Anna Gál (Electron. Colloquium Comput. Complex., 2022)

Tight bounds on sensitivity and block sensitivity of some classes of transitive functions. - Siddhesh Chaubal; Anna Gál (Theor. Comput. Sci., 2023)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). - Anna Gál; Meena Mahajan; Rahul Santhanam; Till Tantau; Manaswi Paraashar (Dagstuhl Reports, 2023)