Ravi B. Boppana
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs 10
- Advanced Graph Theory Research 6
- Computability, Logic, AI Algorithms 4
- semigroups and automata theory 3
-
- Limits and Structures in Graph Theory 6
- Artificial Intelligence top 2%
- Machine Learning and Algorithms 2
-
- Optimization and Search Problems 4
-
- Benford’s Law and Fraud Detection 3
- Co-authors
- Magnús M. HalldórssonNoga AlonJohan HåstadStathis ZachosMichael SipserJeffrey C. LagariasJ. SpencerIsidore Rigoutsos
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Journals
- BIT Numerical Mathematics (1 paper)SIAM Journal on Computing (1 paper)SIAM Journal on Discrete Mathematics (1 paper)
- Partner nations
- United StatesIsraelSweden
In The Last Decade
Ravi B. Boppana
24 papers receiving 926 citations
Peers
Comparison fields: 5 of 63
- Computational Theory and Mathematics 744
- Discrete Mathematics and Combinatorics 97
- Computer Graphics and Computer-Aided Design 68
- Artificial Intelligence 532
- Computer Networks and Communications 216
Countries citing papers authored by Ravi B. Boppana
This map shows the geographic impact of Ravi B. Boppana'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 Ravi B. Boppana with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ravi B. Boppana more than expected).
Fields of papers citing papers by Ravi B. Boppana
This network shows the impact of papers produced by Ravi B. Boppana. 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 Ravi B. Boppana. The network helps show where Ravi B. Boppana may publish in the future.
Co-authorship network
The 14 scholars most cited alongside Ravi B. Boppana, 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 | 2021 | 0 | |
| 2 | 2017 | 3 | |
| 3 | 2000 | 13 | |
| 4 | Pattern discovery in biology: theory and applications | 1999 | 5 |
| 5 | 1998 | 15 | |
| 6 | 1997 | 2 | |
| 7 | 1997 | 2 | |
| 8 | 1997 | 57 | |
| 9 | 1996 | 4 | |
| 10 | 1994 | 1 | |
| 11 | 1993 | 7 | |
| 12 | 1992 | 207 | |
| 13 | The Complexity of Finite Functions. | 1990 | 86 |
| 14 | 1989 | 6 | |
| 15 | 1989 | 28 | |
| 16 | 1987 | 12 | |
| 17 | 1987 | 172 | |
| 18 | 1987 | 178 | |
| 19 | 1986 | 13 | |
| 20 | 1985 | 18 |
About Ravi B. Boppana
Ravi B. Boppana is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Statistics and Probability, Algebra and Number Theory and Artificial Intelligence, having authored 26 papers that have together received 1.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (6 papers), Limits and Structures in Graph Theory (6 papers), Optimization and Search Problems (4 papers), Computability, Logic, AI Algorithms (4 papers), semigroups and automata theory (3 papers), Benford’s Law and Fraud Detection (3 papers) and Machine Learning and Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (744 citations), Discrete Mathematics and Combinatorics (97 citations), Computer Graphics and Computer-Aided Design (68 citations), Artificial Intelligence (532 citations) and Computer Networks and Communications (216 citations). Ravi B. Boppana has collaborated with scholars based in United States, Israel and Sweden. Frequent co-authors include Magnús M. Halldórsson, Noga Alon, Johan Håstad, Stathis Zachos, Michael Sipser, Jeffrey C. Lagarias, J. Spencer, Isidore Rigoutsos, Ron Holzman and Emanuele Viola. Their work appears in journals such as BIT Numerical Mathematics, SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, Geometric and Functional Analysis and The Electronic Journal of Combinatorics.
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.