default search action
Anna Gál
Person information
- affiliation: University of Texas at Austin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Anna Gál
, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. Theory Comput. Syst. 68(5): 1109-1123 (2024) - 2023
- [j29]Siddhesh Chaubal
Tight bounds on sensitivity and block sensitivity of some classes of transitive functions. Theor. Comput. Sci. 946: 113687 (2023) - [c28]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate Games. ITCS 2023: 32:1-32:24 - [i28]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13(3): 17-31 (2023) - 2022
- [i27]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. CoRR abs/2211.03396 (2022) - [i26]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. Electron. Colloquium Comput. Complex. TR22 (2022) - [i25]Siddhesh Chaubal, Anna Gál:
Diameter versus Certificate Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c27]Anna Gál, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. CSR 2021: 116-130 - [c26]Siddhesh Chaubal, Anna Gál:
Diameter Versus Certificate Complexity of Boolean Functions. MFCS 2021: 31:1-31:22 - [i24]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). Dagstuhl Reports 11(2): 1-16 (2021) - 2020
- [c25]Anna Gál, Robert Robere:
Lower Bounds for (Non-Monotone) Comparator Circuits. ITCS 2020: 58:1-58:13 - [c24]Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. LATIN 2020: 323-335 - [i23]Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c23]Anna Gál, Avishay Tal, Adrian Trejo Nuñez:
Cubic Formula Size Lower Bounds Based on Compositions with Majority. ITCS 2019: 35:1-35:13 - [i22]Anna Gál, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). Dagstuhl Reports 9(3): 64-82 (2019) - [i21]Anna Gál, Robert Robere:
Lower Bounds for (Non-monotone) Comparator Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i20]Anna Gál, Ridwan Syed:
Upper Bounds on Communication in terms of Approximate Rank. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c22]Siddhesh Chaubal, Anna Gál:
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. FSTTCS 2018: 13:1-13:16 - [i19]Siddhesh Chaubal, Anna Gál:
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. Electron. Colloquium Comput. Complex. TR18 (2018) - [i18]Anna Gál, Avishay Tal, Adrian Trejo Nuñez:
Cubic Formula Size Lower Bounds Based on Compositions with Majority. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j28]Eric Allender
Dual VP Classes. Comput. Complex. 26(3): 583-625 (2017) - [i17]Anna Gál, Michal Koucký, Oded Regev, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). Dagstuhl Reports 7(3): 45-69 (2017) - 2016
- [j27]Natalia Silberstein, Anna Gál:
Optimal combinatorial batch codes based on block designs. Des. Codes Cryptogr. 78(2): 409-424 (2016) - [j26]Anna Gál, Jing-Tang Jang:
A generalization of Spira's theorem and circuits with small segregators or separators. Inf. Comput. 251: 252-262 (2016) - [j25]Ankit Singh Rawat
Batch Codes Through Dense Graphs Without Short Cycles. IEEE Trans. Inf. Theory 62(4): 1592-1604 (2016) - [j24]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan
Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8(4): 16:1-16:28 (2016) - 2015
- [c21]Ankit Singh Rawat
Batch codes through dense graphs without short cycles. ISIT 2015: 1477-1481 - [c20]Eric Allender
Dual VP Classes. MFCS (2) 2015: 14-25 - 2014
- [i16]Alexandros G. Dimakis, Anna Gál, Ankit Singh Rawat, Zhao Song:
Batch Codes through Dense Graphs without Short Cycles. CoRR abs/1410.2920 (2014) - [i15]Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports 4(3): 62-84 (2014) - [i14]Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Alexandros G. Dimakis, Anna Gál, Ankit Singh Rawat, Zhao Song:
Batch Codes through Dense Graphs without Short Cycles. Electron. Colloquium Comput. Complex. TR14 (2014) - [i12]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j23]Jeff Ford, Anna Gál:
Hadamard tensors and lower bounds on multiparty communication complexity. Comput. Complex. 22(3): 595-622 (2013) - [j22]Anna Gál, Kristoffer Arnsfelt Hansen
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory 59(10): 6611-6627 (2013) - [i11]Natalia Silberstein, Anna Gál:
Optimal Combinatorial Batch Codes based on Block Designs. CoRR abs/1312.5505 (2013) - [i10]Anna Gál, Jing-Tang Jang:
A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j21]Anna Gál, Vladimir Trifonov:
On the Correlation Between Parity and Modular Polynomials. Theory Comput. Syst. 50(3): 516-536 (2012) - [j20]Anna Gál, Andrew Mills:
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length. ACM Trans. Comput. Theory 3(2): 5:1-5:34 (2012) - [c19]Anna Gál, Jing-Tang Jang:
A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. SOFSEM 2012: 264-276 - [c18]Anna Gál, Kristoffer Arnsfelt Hansen
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC 2012: 479-494 - [i9]Mahdi Cheraghchi, Anna Gál, Andrew Mills:
Correctness and Corruption of Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j19]Anna Gál, Jing-Tang Jang:
The size and depth of layered Boolean circuits. Inf. Process. Lett. 111(5): 213-217 (2011) - [c17]Anna Gál, Andrew Mills:
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. STACS 2011: 673-684 - [i8]Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. TR11 (2011) - [i7]Anna Gál, Andrew Mills:
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j18]Anna Gál, Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. SIAM J. Comput. 39(8): 3463-3479 (2010) - [c16]Anna Gál, Jing-Tang Jang:
The Size and Depth of Layered Boolean Circuits. LATIN 2010: 372-383
2000 – 2009
- 2009
- [j17]Anna Gál:
Preface: Special Issue of ICALP 2006 - dedicated to the memory of Ingo Wegener. Theor. Comput. Sci. 410(44): 4445 (2009) - 2008
- [j16]Anna Gál, Michal Koucký
Incremental Branching Programs. Theory Comput. Syst. 43(2): 159-184 (2008) - 2007
- [j15]Anna Gál, Peter Bro Miltersen:
The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379(3): 405-417 (2007) - [c15]Anna Gál, Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. FOCS 2007: 294-304 - 2006
- [j14]Anna Gál:
Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. Comput. Complex. 15(2): 93 (2006) - [j13]Anna Gál:
Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. Comput. Complex. 15(4): 297 (2006) - [c14]Anna Gál, Michal Koucký, Pierre McKenzie:
Incremental Branching Programs. CSR 2006: 178-190 - [c13]Anna Gál, Vladimir Trifonov:
On the Correlation Between Parity and Modular Polynomials. MFCS 2006: 387-398 - [i6]Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. Complexity of Boolean Functions 2006 - [i5]Anna Gál, Peter Bro Miltersen:
The Cell Probe Complexity of Succinct Data Structures. Complexity of Boolean Functions 2006 - [i4]Anna Gál, Pierre McKenzie, Michal Koucký:
Incremental branching programs. Complexity of Boolean Functions 2006 - 2005
- [j12]Anna Gál, Adi Rosén:
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. SIAM J. Comput. 34(4): 946-959 (2005) - [c12]Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. ICALP 2005: 1163-1175 - [i3]Anna Gál, Michal Koucký, Pierre McKenzie:
Incremental branching programs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [j11]Anna Gál, Pavel Pudlák:
A note on monotone complexity and the rank of matrices. Inf. Process. Lett. 87(6): 321-326 (2003) - [j10]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]. Inf. Process. Lett. 88(5): 257 (2003) - [j9]László Babai
Communication Complexity of Simultaneous Messages. SIAM J. Comput. 33(1): 137-166 (2003) - [c11]Anna Gál, Peter Bro Miltersen:
The Cell Probe Complexity of Succinct Data Structures. ICALP 2003: 332-344 - [c10]Anna Gál, Adi Rosén:
Lower bounds on the amount of randomness in private computation. STOC 2003: 659-666 - 2002
- [j8]Anna Gál, Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation. SIAM J. Comput. 31(5): 1424-1437 (2002) - 2001
- [j7]Anna Gál:
A characterization of span program size and improved lower bounds for monotone span programs. Comput. Complex. 10(4): 277-296 (2001)
1990 – 1999
- 1999
- [j6]László Babai
Superpolynomial Lower Bounds for Monotone Span Programs. Comb. 19(3): 301-319 (1999) - [j5]Amos Beimel
On Arithmetic Branching Programs. J. Comput. Syst. Sci. 59(2): 195-220 (1999) - [c9]Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank:
Computing from Partial Solutions. CCC 1999: 34-45 - [c8]Anna Gál, Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation. STOC 1999: 348-357 - 1998
- [c7]Amos Beimel
On Arithmetic Branching Programs. CCC 1998: 68-80 - [c6]Anna Gál:
A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs. STOC 1998: 429-437 - 1997
- [j4]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. Comput. Complex. 6(1): 29-45 (1997) - [j3]Anna Gál:
A Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. 62(1): 13-16 (1997) - 1996
- [j2]Anna Gál, Avi Wigderson:
Boolean complexity classes vs. their arithmetic analogs. Random Struct. Algorithms 9(1-2): 99-111 (1996) - [c5]László Babai
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. STOC 1996: 603-611 - 1995
- [c4]Anna Gál, Mario Szegedy:
Fault Tolerant Circuits and Probabilistically Checkable Proofs. SCT 1995: 65-73 - [c3]Anna Gál:
Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. SCT 1995: 82-87 - [c2]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. FOCS 1995: 674-681 - [i2]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Anna Gál, Avi Wigderson:
Boolean Complexity Classes vs. Their Arithmetic Analogs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j1]Péter Gács, Anna Gál:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40(2): 579-583 (1994) - 1991
- [c1]Anna Gál:
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. FOCS 1991: 594-601
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: