Anna Gál
ScholarGPS® ID: 49822408431209
Affiliation History
Discipline
Computer Science
Top Specialties
Data Structure | Information Theory | Informatics
Metrics Summary
Publication Count
47
Predicted Citations
807
Predicted h-index
16
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
|
Add
Delete
|
|---|
Upper Bounds on Communication in Terms of Approximate Rank (journal article) Theory of Computing Systems (2023). |
Tight bounds on sensitivity and block sensitivity of some classes of transitive functions (journal article) Theoretical Computer Science, volume 946 (2023). |
Upper Bounds on Communication in Terms of Approximate Rank (book chapter) In Computer Science – Theory and Applications Springer International Publishing (2021) |
Agriculture, volume 11, issue 1, pages 45- (2021). |
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions (book chapter) In LATIN 2020: Theoretical Informatics Springer International Publishing (2020) |
Dual VP Classes (journal article) computational complexity, volume 26, issue 3, pages 583-625 (2017). |
A generalization of Spira's theorem and circuits with small segregators or separators (journal article) Information and Computation, volume 251 (2016). |
Space-Efficient Approximations for Subset Sum (journal article) ACM Transactions on Computation Theory, volume 8, issue 4, pages 1-28 (2016). |
Batch Codes Through Dense Graphs Without Short Cycles (journal article) IEEE Transactions on Information Theory, volume 62, issue 4, pages 1592-1604 (2016). |
Optimal combinatorial batch codes based on block designs (journal article) Designs, Codes and Cryptography, volume 78, issue 2, pages 409-424 (2016). |
2015 IEEE International Symposium on Information Theory (ISIT) (2015) Hong Kong, Hong Kong |
Dual VP Classes (book chapter) In Mathematical Foundations of Computer Science 2015 Springer Berlin Heidelberg (2015) |
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates (journal article) IEEE Transactions on Information Theory, volume 59, issue 10, pages 6611-6627 (2013). |
Hadamard tensors and lower bounds on multiparty communication complexity (journal article) computational complexity, volume 22, issue 3, pages 595-622 (2013). |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (conference) STOC'12: Symposium on Theory of Computing (2012) New York New York USA |
On the Correlation Between Parity and Modular Polynomials (journal article) Theory of Computing Systems, volume 50, issue 3, pages 516-536 (2012). |
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (journal article) ACM Transactions on Computation Theory, volume 3, issue 2, pages 1-34 (2012). |
A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (book chapter) In SOFSEM 2012: Theory and Practice of Computer Science Springer Berlin Heidelberg (2012) |
The size and depth of layered Boolean circuits (journal article) Information Processing Letters, volume 111, issue 5, pages 213-217 (2011). |
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. (conference) Symposium on Theoretical Aspects of Computer Science (2011) Dortmund, Germany |