Anna Gál
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
- Artificial Intelligence top 5%
- Cryptography and Data Security
- Coding theory and cryptography
- Algorithms and Data Compression
Papers in
-
- Complexity and Algorithms in Graphs 28
- Advanced Graph Theory Research 11
- semigroups and automata theory 8
- Computability, Logic, AI Algorithms 6
-
- Cryptography and Data Security 11
- Coding theory and cryptography 11
- Co-authors
- László Babai (3 shared papers)Péter Gács (1 shared paper)Avi Wigderson (3 shared papers)Parikshit Gopalan (3 shared papers)Peter Bro Miltersen (2 shared papers)Adi Rosén (5 shared papers)Amos Beimel (3 shared papers)Pavel Pudlák (3 shared papers)
- Journals
- SIAM Journal on Computing (4 papers)IEEE Transactions on Information Theory (3 papers)Computational Complexity (3 papers)Theory of Computing Systems (2 papers)Journal of Computer and System Sciences (1 paper)
- Partner nations
- United StatesIsraelCzechia
In The Last Decade
Anna Gál
46 papers receiving 587 citations
Peers
Comparison fields: 5 of 50
- Computational Theory and Mathematics 454
- Artificial Intelligence 433
- Discrete Mathematics and Combinatorics 29
- Computer Networks and Communications 139
- Hardware and Architecture 29
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-authors
The 25 scholars most cited alongside Anna Gál, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 49 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1999 | 63 | |
| 2 | 1994 | 55 | |
| 3 | 2001 | 43 | |
| 4 | 2003 | 40 | |
| 5 | 2007 | 39 | |
| 6 | 2007 | 38 | |
| 7 | 1996 | 27 | |
| 8 | 1995 | 25 | |
| 9 | 1998 | 23 | |
| 10 | 2016 | 23 | |
| 11 | 2003 | 23 | |
| 12 | Combinatorial methods in boolean function complexity | 1995 | 20 |
| 13 | 2005 | 19 | |
| 14 | 1999 | 16 | |
| 15 | 2003 | 14 | |
| 16 | 2021 | 13 | |
| 17 | 2002 | 13 | |
| 18 | 1997 | 11 | |
| 19 | 2003 | 11 | |
| 20 | 2002 | 11 |
About Anna Gál
Anna Gál is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Management Science and Operations Research, having authored 49 papers that have together received 636 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (28 papers), Cryptography and Data Security (11 papers), Advanced Graph Theory Research (11 papers), Coding theory and cryptography (11 papers), semigroups and automata theory (8 papers), Computability, Logic, AI Algorithms (6 papers), DNA and Biological Computing (6 papers) and Error Correcting Code Techniques (4 papers). The work is most often cited by research in Computational Theory and Mathematics (454 citations), Artificial Intelligence (433 citations), Discrete Mathematics and Combinatorics (29 citations), Computer Networks and Communications (139 citations) and Hardware and Architecture (29 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, Avi Wigderson, Parikshit Gopalan, Peter Bro Miltersen, Adi Rosén, Amos Beimel, Pavel Pudlák, Janoš Šimon and Satyanarayana V. Lokam. Their work appears in journals such as SIAM Journal on Computing, IEEE Transactions on Information Theory, Computational Complexity, Theory of Computing Systems and Journal of Computer and System Sciences.
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.