( en | de | ru )

 

Disambiguation of "Gál, Anna"

Author of the publication

copydeleteadd this publication to your clipboard
Incremental Branching Programs.

, , and . CSR, volume 3967 of Lecture Notes in Computer Science, page 178-190. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Gál

Csaba Gál

Attila Gál

Gal Schkolnik

Steffi Gal

 

Other publications of authors with the same name

On the Correlation Between Parity and Modular Polynomials., and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 387-398. Springer, (2006)Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1163-1175. Springer, (2005)Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)., , and . Dagstuhl Reports, 9 (3): 64-82 (2019)Lower bounds for the complexity of reliable Boolean circuits with noisy gates., and . IEEE Trans. Inf. Theory, 40 (2): 579-583 (1994)Communication Complexity of Simultaneous Messages., , , and . SIAM J. Comput., 33 (1): 137-166 (2003)A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators., and . Electron. Colloquium Comput. Complex., (2013)Batch Codes Through Dense Graphs Without Short Cycles., , , and . IEEE Trans. Inf. Theory, 62 (4): 1592-1604 (2016)The size and depth of layered Boolean circuits., and . Inf. Process. Lett., 111 (5): 213-217 (2011)Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs., , , , , and . STOC, page 603-611. ACM, (1996)Certificate Games., , , , and . ITCS, volume 251 of LIPIcs, page 32:1-32:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)