Prasoon Tiwari
-
- Polynomial and algebraic computation 8
- Complexity and Algorithms in Graphs 7
- Numerical Methods and Algorithms 5
- Advanced Graph Theory Research 5
- Geometry and Topology top 5%
-
- Optimization and Search Problems 3
-
- Advanced Numerical Analysis Techniques 4
-
- Scheduling and Optimization Algorithms 3
-
- graph theory and CDMA systems 3
Prasoon Tiwari
25 papers receiving 547 citations
Peers
Comparison fields: 5 of 69
- Computational Theory and Mathematics 279
- Computational Mathematics 8
- Geometry and Topology 74
- Computer Graphics and Computer-Aided Design 29
- Computer Networks and Communications 183
Countries citing papers authored by Prasoon Tiwari
This map shows the geographic impact of Prasoon Tiwari'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 Prasoon Tiwari with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Prasoon Tiwari more than expected).
Fields of papers citing papers by Prasoon Tiwari
This network shows the impact of papers produced by Prasoon Tiwari. 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 Prasoon Tiwari. The network helps show where Prasoon Tiwari may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Prasoon Tiwari, 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 | 1997 | 2 | |
| 2 | 1996 | 199 | |
| 3 | 1994 | 55 | |
| 4 | 1994 | 15 | |
| 5 | 1993 | 74 | |
| 6 | 1993 | 2 | |
| 7 | 1992 | 22 | |
| 8 | 1992 | 9 | |
| 9 | 1992 | 8 | |
| 10 | 1991 | 15 | |
| 11 | 1991 | 8 | |
| 12 | On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) | 1990 | 2 |
| 13 | 1990 | 31 | |
| 14 | A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) | 1988 | 11 |
| 15 | 1988 | 31 | |
| 16 | 1987 | 35 | |
| 17 | 1986 | 4 | |
| 18 | The communication complexity of distributed computing and a parallel algorithm for polynomial roots | 1986 | 6 |
| 19 | 1986 | 1 | |
| 20 | 1985 | 8 |
About Prasoon Tiwari
Prasoon Tiwari is a scholar working on Computational Mathematics, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 25 papers that have together received 597 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (8 papers), Complexity and Algorithms in Graphs (7 papers), Numerical Methods and Algorithms (5 papers), Advanced Graph Theory Research (5 papers), Advanced Numerical Analysis Techniques (4 papers), Optimization and Search Problems (3 papers), Scheduling and Optimization Algorithms (3 papers) and graph theory and CDMA systems (3 papers). The work is most often cited by research in Computational Theory and Mathematics (279 citations), Computational Mathematics (8 citations) and Geometry and Topology (74 citations). Prasoon Tiwari has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Walter L. Ruzzo, Prabhakar Raghavan, Ashok K. Chandra, Roman Smolensky, Yishay Mansour, Michael Ben-Or, Noam Nisan, Martin Tompa, Baruch Schieber and Ephraim Feig. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.