| 2026 | MFCS | Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity. | Sourav Chakraborty, Anna Gl |
| 2021 | CSR | Upper Bounds on Communication in Terms of Approximate Rank. | Anna Gl, Ridwan Syed |
| 2021 | MFCS | Diameter Versus Certificate Complexity of Boolean Functions. | Siddhesh Chaubal, Anna Gl |
| 2020 | LATIN | Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. | Siddhesh Chaubal, Anna Gl |
| 2015 | ISIT | Batch codes through dense graphs without short cycles. | Ankit Singh Rawat, Zhao Song, Alexandros G. Dimakis, Anna Gl |
| 2015 | MFCS | Dual VP Classes. | Eric Allender, Anna Gl, Ian Mertz |
| 2012 | STOC | Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. | Anna Gl, Kristoffer Arnsfelt Hansen, Michal Kouck, Pavel Pudlk, Emanuele Viola |
| 2012 | SOFSEM | A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. | Anna Gl, Jing-Tang Jang |
| 2011 | STACS | Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. | Anna Gl, Andrew Mills |
| 2010 | LATIN | The Size and Depth of Layered Boolean Circuits. | Anna Gl, Jing-Tang Jang |
| 2007 | FOCS | Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. | Anna Gl, Parikshit Gopalan |
| 2006 | CSR | Incremental Branching Programs. | Anna Gl, Michal Kouck, Pierre McKenzie |
| 2006 | MFCS | On the Correlation Between Parity and Modular Polynomials. | Anna Gl, Vladimir Trifonov |
| 2005 | ICALP | Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. | Jeff Ford, Anna Gl |
| 2003 | ICALP | The Cell Probe Complexity of Succinct Data Structures. | Anna Gl, Peter Bro Miltersen |
| 2003 | STOC | Lower bounds on the amount of randomness in private computation. | Anna Gl, Adi Rosn |
| 1999 | STOC | A Theorem on Sensitivity and Applications in Private Computation. | Anna Gl, Adi Rosn |
| 1998 | STOC | A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs. | Anna Gl |
| 1996 | STOC | Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. | Lszl Babai, Anna Gl, Jnos Kollr, Lajos Rnyai, Tibor Szab, Avi Wigderson |
| 1995 | FOCS | Lower Bounds for Monotone Span Programs. | Amos Beimel, Anna Gl, Mike Paterson |
| 1991 | FOCS | Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates | Anna Gl |