Max Kanovich
Impact in
-
- Formal Methods in Verification
- Artificial Intelligence top 5%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Security and Verification in Computing
- Cryptography and Data Security
Papers in
-
- Logic, programming, and type systems 24
- Logic, Reasoning, and Knowledge 17
- Security and Verification in Computing 6
- Cryptography and Data Security 5
-
- Formal Methods in Verification 19
- Advanced Algebra and Logic 5
- Co-authors
- Andre Scedrov (19 shared papers)J G. Brotherston (5 shared papers)Rohit Chadha (1 shared paper)Mitsuhiro Okada (4 shared papers)Vivek Nigam (11 shared papers)Nikos Gorogiannis (3 shared papers)Carolyn Talcott (7 shared papers)Musab A. Alturki (4 shared papers)
- Journals
- Annals of Pure and Applied Logic (4 papers)Theoretical Computer Science (3 papers)Mathematical Structures in Computer Science (3 papers)Discrete Mathematics (2 papers)Journal of the ACM (1 paper)
- Partner nations
- RussiaUnited KingdomUnited States
In The Last Decade
Max Kanovich
43 papers receiving 306 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 186
- Artificial Intelligence 276
- Computer Networks and Communications 105
- Software 12
- Discrete Mathematics and Combinatorics 7
Countries citing papers authored by Max Kanovich
This map shows the geographic impact of Max Kanovich'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 Max Kanovich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Max Kanovich more than expected).
Fields of papers citing papers by Max Kanovich
This network shows the impact of papers produced by Max Kanovich. 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 Max Kanovich. The network helps show where Max Kanovich may publish in the future.
Co-authors
The 10 scholars most cited alongside Max Kanovich, 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 44 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 39 | |
| 2 | 1994 | 26 | |
| 3 | 1994 | 23 | |
| 4 | 2010 | 21 | |
| 5 | 2003 | 21 | |
| 6 | 1995 | 18 | |
| 7 | 2001 | 16 | |
| 8 | 2003 | 12 | |
| 9 | 2009 | 12 | |
| 10 | 2010 | 11 | |
| 11 | 2014 | 10 | |
| 12 | 2016 | 9 | |
| 13 | 1998 | 9 | |
| 14 | 2014 | 8 | |
| 15 | 2007 | 7 | |
| 16 | 2007 | 6 | |
| 17 | Fast theorem proving in intuitionistic propositional logic | 1991 | 5 |
| 18 | 2015 | 5 | |
| 19 | 2002 | 5 | |
| 20 | 2012 | 4 |
About Max Kanovich
Max Kanovich is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Information Systems and Discrete Mathematics and Combinatorics, having authored 44 papers that have together received 322 indexed citations. Recurring topics across this work include Logic, programming, and type systems (24 papers), Formal Methods in Verification (19 papers), Logic, Reasoning, and Knowledge (17 papers), Distributed systems and fault tolerance (7 papers), Advanced Authentication Protocols Security (6 papers), Security and Verification in Computing (6 papers), Cryptography and Data Security (5 papers) and Advanced Algebra and Logic (5 papers). The work is most often cited by research in Computational Theory and Mathematics (186 citations), Artificial Intelligence (276 citations), Computer Networks and Communications (105 citations), Software (12 citations) and Discrete Mathematics and Combinatorics (7 citations). Max Kanovich has collaborated with scholars based in Russia, United Kingdom and United States. Frequent co-authors include Andre Scedrov, J G. Brotherston, Rohit Chadha, Mitsuhiro Okada, Vivek Nigam, Nikos Gorogiannis, Carolyn Talcott, Musab A. Alturki, Paul Brunet and Kazushige Terui. Their work appears in journals such as Annals of Pure and Applied Logic, Theoretical Computer Science, Mathematical Structures in Computer Science, Discrete Mathematics and Journal of the ACM.
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.