Mrinal Kumar
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Polynomial and algebraic computation
Papers in
-
- Complexity and Algorithms in Graphs 21
- Advanced Graph Theory Research 14
- Polynomial and algebraic computation 6
- semigroups and automata theory 4
-
- Machine Learning and Algorithms 9
- Coding theory and cryptography 7
- Cryptography and Data Security 5
- Co-authors
- Shubhangi Saraf (7 shared papers)Zdravka Medarova (1 shared paper)Mehmet V. Yigit (1 shared paper)Amol Kavishwar (1 shared paper)Anna Moore (1 shared paper)Victoria Petkova (1 shared paper)Subrata Ghosh (1 shared paper)Ramprasad Saptharishi (6 shared papers)
- Journals
- Computational Complexity (5 papers)Theory of Computing (3 papers)SIAM Journal on Computing (3 papers)Algorithmica (2 papers)IEEE Transactions on Information Theory (2 papers)
- Partner nations
- IndiaUnited StatesNetherlands
In The Last Decade
Mrinal Kumar
28 papers receiving 176 citations
Peers
Comparison fields: 5 of 36
- Computational Theory and Mathematics 90
- Discrete Mathematics and Combinatorics 14
- Cancer Research 41
- Algebra and Number Theory 9
- Computer Graphics and Computer-Aided Design 6
Countries citing papers authored by Mrinal Kumar
This map shows the geographic impact of Mrinal Kumar'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 Mrinal Kumar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mrinal Kumar more than expected).
Fields of papers citing papers by Mrinal Kumar
This network shows the impact of papers produced by Mrinal Kumar. 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 Mrinal Kumar. The network helps show where Mrinal Kumar may publish in the future.
Co-authors
The 24 scholars most cited alongside Mrinal Kumar, 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 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 75 | |
| 2 | 2013 | 21 | |
| 3 | 2014 | 14 | |
| 4 | 2014 | 10 | |
| 5 | 2019 | 8 | |
| 6 | 2019 | 7 | |
| 7 | Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. | 2013 | 6 |
| 8 | 2023 | 5 | |
| 9 | 2016 | 4 | |
| 10 | 2020 | 4 | |
| 11 | 2022 | 4 | |
| 12 | 2019 | 4 | |
| 13 | 2022 | 4 | |
| 14 | 2019 | 3 | |
| 15 | 2015 | 3 | |
| 16 | 2013 | 2 | |
| 17 | 2016 | 2 | |
| 18 | 2023 | 2 | |
| 19 | 2023 | 1 | |
| 20 | A security assurance framework for component based software development. | 2001 | 1 |
About Mrinal Kumar
Mrinal Kumar is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Information Systems and Statistics and Probability, having authored 35 papers that have together received 188 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (21 papers), Advanced Graph Theory Research (14 papers), Machine Learning and Algorithms (9 papers), Coding theory and cryptography (7 papers), Polynomial and algebraic computation (6 papers), Cryptography and Data Security (5 papers), graph theory and CDMA systems (4 papers) and semigroups and automata theory (4 papers). The work is most often cited by research in Computational Theory and Mathematics (90 citations), Discrete Mathematics and Combinatorics (14 citations), Cancer Research (41 citations), Algebra and Number Theory (9 citations) and Computer Graphics and Computer-Aided Design (6 citations). Mrinal Kumar has collaborated with scholars based in India, United States and Netherlands. Frequent co-authors include Shubhangi Saraf, Zdravka Medarova, Mehmet V. Yigit, Amol Kavishwar, Anna Moore, Victoria Petkova, Subrata Ghosh, Ramprasad Saptharishi, Saket Saurabh and Pranabendu Misra. Their work appears in journals such as Computational Complexity, Theory of Computing, SIAM Journal on Computing, Algorithmica and IEEE Transactions on Information Theory.
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.