A. Pavan
Impact in
-
- Complexity and Algorithms in Graphs
- Signal Processing top 10%
- Data Management and Algorithms
Papers in
-
- Complexity and Algorithms in Graphs 26
- Computability, Logic, AI Algorithms 12
- Advanced Graph Theory Research 9
-
- Cryptography and Data Security 6
- Machine Learning and Algorithms 6
- Data Stream Mining Techniques 5
- Co-authors
- Srikanta Tirthapura (7 shared papers)Kanat Tangwongsan (2 shared papers)Kun‐Lung Wu (1 shared paper)Alan L. Selman (10 shared papers)John M. Hitchcock (8 shared papers)N. V. Vinodchandran (17 shared papers)Lance Fortnow (4 shared papers)Samik Basu (6 shared papers)
- Journals
- Theory of Computing Systems (4 papers)SIAM Journal on Computing (4 papers)Algorithmica (2 papers)Computational Complexity (2 papers)Theoretical Computer Science (2 papers)
- Partner nations
- United StatesGermanySingapore
In The Last Decade
A. Pavan
42 papers receiving 291 citations
Peers
Comparison fields: 5 of 44
- Computational Theory and Mathematics 127
- Signal Processing 73
- Statistical and Nonlinear Physics 82
- Computer Networks and Communications 123
- Artificial Intelligence 171
Countries citing papers authored by A. Pavan
This map shows the geographic impact of A. Pavan'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 A. Pavan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. Pavan more than expected).
Fields of papers citing papers by A. Pavan
This network shows the impact of papers produced by A. Pavan. 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 A. Pavan. The network helps show where A. Pavan may publish in the future.
Co-authors
The 25 scholars most cited alongside A. Pavan, 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 51 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 106 | |
| 2 | 2013 | 28 | |
| 3 | 2005 | 17 | |
| 4 | 2001 | 16 | |
| 5 | 2007 | 15 | |
| 6 | Range-efficient computation of F0 over massive data streams | 2005 | 14 |
| 7 | 2015 | 12 | |
| 8 | 2007 | 8 | |
| 9 | 2018 | 8 | |
| 10 | 2012 | 6 | |
| 11 | 2015 | 6 | |
| 12 | 2001 | 6 | |
| 13 | 2008 | 5 | |
| 14 | 2004 | 4 | |
| 15 | 2007 | 3 | |
| 16 | 2018 | 3 | |
| 17 | 2023 | 3 | |
| 18 | 2010 | 3 | |
| 19 | 2013 | 3 | |
| 20 | 2018 | 3 |
About A. Pavan
A. Pavan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Signal Processing and Statistical and Nonlinear Physics, having authored 51 papers that have together received 309 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Computability, Logic, AI Algorithms (12 papers), Advanced Graph Theory Research (9 papers), Data Management and Algorithms (7 papers), Optimization and Search Problems (6 papers), Cryptography and Data Security (6 papers), Machine Learning and Algorithms (6 papers) and Data Stream Mining Techniques (5 papers). The work is most often cited by research in Computational Theory and Mathematics (127 citations), Signal Processing (73 citations), Statistical and Nonlinear Physics (82 citations), Computer Networks and Communications (123 citations) and Artificial Intelligence (171 citations). A. Pavan has collaborated with scholars based in United States, Germany and Singapore. Frequent co-authors include Srikanta Tirthapura, Kanat Tangwongsan, Kun‐Lung Wu, Alan L. Selman, John M. Hitchcock, N. V. Vinodchandran, Lance Fortnow, Samik Basu, Christian Glaßer and Andrew McGregor. Their work appears in journals such as Theory of Computing Systems, SIAM Journal on Computing, Algorithmica, Computational Complexity 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.