Anna Gál
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Computer Vision and Pattern Recognition
- Co-authors
- László BabaiPéter GácsPeter Bro MiltersenAvi WigdersonParikshit GopalanAmos BeimelAdi RosénPavel Pudlák
- Topics
- Complexity and Algorithms in Graphs (23 papers)Cryptography and Data Security (12 papers)Coding theory and cryptography (9 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- IEEE Transactions on Information TheorySIAM Journal on ComputingTheoretical Computer Science
- Partner nations
- United StatesIsraelCzechia
In The Last Decade
Anna Gál
36 papers receiving 329 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 261
- Artificial Intelligence 237
- Computer Networks and Communications 91
- Electrical and Electronic Engineering 64
- Computer Vision and Pattern Recognition 21
Countries citing papers authored by Anna Gál
This map shows the geographic impact of Anna Gál's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anna Gál with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anna Gál more than expected).
Fields of papers citing papers by Anna Gál
This network shows the impact of papers produced by Anna Gál. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anna Gál. The network helps show where Anna Gál may publish in the future.
Co-authorship network of co-authors of Anna Gál
This figure shows the co-authorship network connecting the top 25 collaborators of Anna Gál. A scholar is included among the top collaborators of Anna Gál based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anna Gál. Anna Gál is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 12 | |
| 3 | 16 | |
| 4 | On Post-Gluskin-Hosszu Theorem | 0 |
| 5 | 6 | |
| 6 | 6 | |
| 7 | Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length | 3 |
| 8 | 1 | |
| 9 | 25 | |
| 10 | 20 | |
| 11 | 11 | |
| 12 | 4 | |
| 13 | 1 | |
| 14 | 9 | |
| 15 | 1 | |
| 16 | 8 | |
| 17 | 8 | |
| 18 | 10 | |
| 19 | 17 | |
| 20 | 11 |
About Anna Gál
Anna Gál is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 39 papers that have together received 370 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (23 papers), Cryptography and Data Security (12 papers) and Coding theory and cryptography (9 papers). The work is most often cited by research in Computational Theory and Mathematics (261 citations), Artificial Intelligence (237 citations) and Discrete Mathematics and Combinatorics (14 citations). Anna Gál has collaborated with scholars based in United States, Israel and Czechia. Frequent co-authors include László Babai, Péter Gács, Peter Bro Miltersen, Avi Wigderson, Parikshit Gopalan, Amos Beimel, Adi Rosén, Pavel Pudlák, Satyanarayana V. Lokam and Zhao Song. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.