A. Pavan

769 total citations
51 papers, 309 citations indexed

About

A. Pavan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, A. Pavan has authored 51 papers receiving a total of 309 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 28 papers in Artificial Intelligence and 15 papers in Computer Networks and Communications. Recurrent topics in A. Pavan's work include Complexity and Algorithms in Graphs (26 papers), Computability, Logic, AI Algorithms (12 papers) and Advanced Graph Theory Research (9 papers). A. Pavan is often cited by papers focused on Complexity and Algorithms in Graphs (26 papers), Computability, Logic, AI Algorithms (12 papers) and Advanced Graph Theory Research (9 papers). A. Pavan collaborates with scholars based in United States, Germany and Singapore. A. Pavan's co-authors include Srikanta Tirthapura, Kanat Tangwongsan, Kun‐Lung Wu, Alan L. Selman, John M. Hitchcock, N. V. Vinodchandran, Lance Fortnow, Andrew McGregor, Samik Basu and Christian Glaßer and has published in prestigious journals such as Communications of the ACM, SIAM Journal on Computing and IEEE Transactions on Neural Systems and Rehabilitation Engineering.

In The Last Decade

A. Pavan

42 papers receiving 291 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
A. Pavan United States	9	171	127	123	82	73	51	309
Darren Strash United States	7	83 0.5×	69 0.5×	72 0.6×	67 0.8×	28 0.4×	18	200
Warren Schudy United States	8	94 0.5×	77 0.6×	45 0.4×	27 0.3×	42 0.6×	12	228
Ali Pinar United States	3	83 0.5×	32 0.3×	70 0.6×	148 1.8×	25 0.3×	4	205
Dong Wen Australia	9	106 0.6×	41 0.3×	85 0.7×	74 0.9×	89 1.2×	37	233
Alfredo Viola Uruguay	8	145 0.8×	68 0.5×	65 0.5×	10 0.1×	51 0.7×	28	265
Albert Angel Canada	7	138 0.8×	61 0.5×	95 0.8×	113 1.4×	109 1.5×	7	297
Michal Koucký Czechia	10	229 1.3×	257 2.0×	166 1.3×	46 0.6×	15 0.2×	52	449
Pinghui Wang China	7	141 0.8×	18 0.1×	119 1.0×	93 1.1×	27 0.4×	25	233
T. Feder United States	7	59 0.3×	108 0.9×	67 0.5×	21 0.3×	29 0.4×	8	209

Countries citing papers authored by A. Pavan

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of A. Pavan

This figure shows the co-authorship network connecting the top 25 collaborators of A. Pavan. A scholar is included among the top collaborators of A. Pavan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with A. Pavan. A. Pavan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Pavan, A., et al.. (2025). Gold Price Prediction Using Machine Learning. International Scientific Journal of Engineering and Management. 4(7). 1–9.

Germanotta, Marco, et al.. (2024). Restoring of Interhemispheric Symmetry in Patients With Stroke Following Bilateral or Unilateral Robot-Assisted Upper-Limb Rehabilitation: A Pilot Randomized Controlled Trial. IEEE Transactions on Neural Systems and Rehabilitation Engineering. 32. 3590–3602. 2 indexed citations

Bhattacharyya, Arnab, et al.. (2023). On Approximating Total Variation Distance. 3479–3487. 3 indexed citations

Dixon, Peter, A. Pavan, & N. V. Vinodchandran. (2021). Complete Problems for Multi-Pseudodeterministic Computations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations

Basu, Samik, et al.. (2021). Multi-Objective Submodular Optimization with Approximate Oracles and Influence Maximization. 2021 IEEE International Conference on Big Data (Big Data). 1 indexed citations

Pavan, A., et al.. (2018). Improved Triangle Counting in Graph Streams: Power of Multi-Sampling. 33–40. 3 indexed citations

Hitchcock, John M. & A. Pavan. (2015). On the NP-Completeness of the Minimum Circuit Size Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 245. 12 indexed citations

Pavan, A., et al.. (2014). New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.. Electronic colloquium on computational complexity. 21. 35. 1 indexed citations

Glaßer, Christian, et al.. (2014). Unions of Disjoint NP-Complete Sets. 6(1). 1–10.

10.

Pavan, A., et al.. (2014). New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

11.

McGregor, Andrew, A. Pavan, Srikanta Tirthapura, & David P. Woodruff. (2012). Space-efficient estimation of statistics over sub-sampled streams. 273–282. 6 indexed citations

12.

Pavan, A., et al.. (2012). On the power of unambiguity in log-space. Computational Complexity. 21(4). 643–670. 2 indexed citations

13.

Glaßer, Christian, et al.. (2010). The fault tolerance of NP-hard problems. Information and Computation. 209(3). 443–455. 3 indexed citations

14.

Hitchcock, John M., A. Pavan, & N. V. Vinodchandran. (2009). Kolmogorov Complexity in Randomness Extraction.. Data Archiving and Networked Services (DANS). 16. 71. 2 indexed citations

15.

Fortnow, Lance, et al.. (2007). Proving SAT does not have small circuits with an application to the two queries problem. Journal of Computer and System Sciences. 74(3). 358–363. 8 indexed citations

16.

Pavan, A., et al.. (2007). Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theoretical Computer Science. 385(1-3). 167–178. 3 indexed citations

17.

Pavan, A. & Srikanta Tirthapura. (2007). Range‐Efficient Counting of Distinct Elements in a Massive Data Stream. SIAM Journal on Computing. 37(2). 359–379. 15 indexed citations

18.

Hitchcock, John M. & A. Pavan. (2005). Resource-bounded strong dimension versus resource-bounded category. Information Processing Letters. 95(3). 377–381. 1 indexed citations

19.

Pavan, A., et al.. (2004). Properties of NP-complete sets. 184–197.

20.

Pavan, A. & Alan L. Selman. (2001). Separation of NP-Completeness Notions. SIAM Journal on Computing. 31(3). 906–918. 16 indexed citations

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.

Explore authors with similar magnitude of impact