Michael Riabzev
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Cryptography and Data Security
- Privacy-Preserving Technologies in Data
- Security and Verification in Computing
Papers in
-
- Cryptography and Data Security 3
- Logic, programming, and type systems 2
- Cryptographic Implementations and Security 1
- Logic, Reasoning, and Knowledge 1
- Coding theory and cryptography 1
-
- Cryptography and Residue Arithmetic 2
- Co-authors
- Eli Ben‐Sasson (4 shared papers)Ariel Gabizon (3 shared papers)Alessandro Chiesa (2 shared papers)Iddo Bentov (2 shared papers)Nicholas Spooner (2 shared papers)
- Journals
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) (2 papers)Electronic colloquium on computational complexity (1 paper)IACR Cryptology ePrint Archive (1 paper)
- Partner nations
- United StatesIsraelCanada
In The Last Decade
Michael Riabzev
3 papers receiving 24 citations
Peers
Comparison fields: 5 of 7
- Computational Theory and Mathematics 14
- Artificial Intelligence 24
- Information Systems 11
- Discrete Mathematics and Combinatorics 1
- Computer Vision and Pattern Recognition 4
Countries citing papers authored by Michael Riabzev
This map shows the geographic impact of Michael Riabzev'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 Michael Riabzev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Riabzev more than expected).
Fields of papers citing papers by Michael Riabzev
This network shows the impact of papers produced by Michael Riabzev. 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 Michael Riabzev. The network helps show where Michael Riabzev may publish in the future.
Co-authors
The 5 scholars most cited alongside Michael Riabzev, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2017 | 12 | |
| 2 | 2018 | 12 | |
| 3 | Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. | 2016 | 3 |
| 4 | Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. | 2016 | 0 |
About Michael Riabzev
Michael Riabzev is a scholar working on Artificial Intelligence, Information Systems, Computational Theory and Mathematics, Infectious Diseases and Organic Chemistry, having authored 4 papers that have together received 27 indexed citations. Recurring topics across this work include Cryptography and Data Security (3 papers), Cryptography and Residue Arithmetic (2 papers), Logic, programming, and type systems (2 papers), Cryptographic Implementations and Security (1 paper), Logic, Reasoning, and Knowledge (1 paper), Coding theory and cryptography (1 paper), Polynomial and algebraic computation (1 paper) and semigroups and automata theory (1 paper). The work is most often cited by research in Computational Theory and Mathematics (14 citations), Artificial Intelligence (24 citations), Information Systems (11 citations), Discrete Mathematics and Combinatorics (1 citation) and Computer Vision and Pattern Recognition (4 citations). Michael Riabzev has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Eli Ben‐Sasson, Ariel Gabizon, Alessandro Chiesa, Iddo Bentov and Nicholas Spooner. Their work appears in journals such as DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), Electronic colloquium on computational complexity and IACR Cryptology ePrint Archive.
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.