Arun Sharma

1.2k total citations
53 papers, 430 citations indexed

About

Arun Sharma is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Arun Sharma has authored 53 papers receiving a total of 430 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Artificial Intelligence, 41 papers in Computational Theory and Mathematics and 8 papers in Computer Networks and Communications. Recurrent topics in Arun Sharma's work include Machine Learning and Algorithms (42 papers), Computability, Logic, AI Algorithms (32 papers) and semigroups and automata theory (25 papers). Arun Sharma is often cited by papers focused on Machine Learning and Algorithms (42 papers), Computability, Logic, AI Algorithms (32 papers) and semigroups and automata theory (25 papers). Arun Sharma collaborates with scholars based in Australia, Singapore and United States. Arun Sharma's co-authors include Sanjay Jain, Sanjay K. Jain, Daniel N. Osherson, James S. Royer, John Case, Frank Stephan, Eric McCreath, Andris Ambainis, Setsuo Arikawa and Tobias Scheffer and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Arun Sharma

50 papers receiving 408 citations

Peers

Arun Sharma
James S. Royer United States
Herman Geuvers Netherlands
Mark-Jan Nederhof United Kingdom
Nelma Moreira Portugal
Varmo Vene Estonia
James S. Royer United States
Arun Sharma
Citations per year, relative to Arun Sharma Arun Sharma (= 1×) peers James S. Royer

Countries citing papers authored by Arun Sharma

Since Specialization
Citations

This map shows the geographic impact of Arun Sharma'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 Arun Sharma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arun Sharma more than expected).

Fields of papers citing papers by Arun Sharma

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arun Sharma. 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 Arun Sharma. The network helps show where Arun Sharma may publish in the future.

Co-authorship network of co-authors of Arun Sharma

This figure shows the co-authorship network connecting the top 25 collaborators of Arun Sharma. A scholar is included among the top collaborators of Arun Sharma 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 Arun Sharma. Arun Sharma is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sharma, Arun, et al.. (2003). Learning power and language expressiveness. Theoretical Computer Science. 298(2). 365–383. 1 indexed citations
2.
Case, John, et al.. (2002). Learning to Win Process-Control Games Watching Game-Masters. Information and Computation. 174(1). 1–19. 2 indexed citations
3.
Jain, Sanjay & Arun Sharma. (2001). On a Generalized Notion of Mistake Bounds. Information and Computation. 166(2). 156–166. 1 indexed citations
4.
Case, John, Sanjay Jain, & Arun Sharma. (2001). Synthesizing noise-tolerant language learners. Theoretical Computer Science. 261(1). 31–56. 3 indexed citations
5.
Case, John, et al.. (2001). Predictive learning models for concept drift. Theoretical Computer Science. 268(2). 323–349. 10 indexed citations
7.
Case, John, et al.. (2000). Robust Learning Aided by Context. Journal of Computer and System Sciences. 60(2). 234–257. 7 indexed citations
8.
Mitchell, Andrew, Tobias Scheffer, Arun Sharma, & Frank Stephan. (1999). The VC-Dimension of Subclasses of Pattern. 93–105. 3 indexed citations
9.
Sharma, Arun. (1998). A Note on Batch and Incremental Learnability. Journal of Computer and System Sciences. 56(3). 272–276. 11 indexed citations
10.
Jain, Sanjay & Arun Sharma. (1997). Elementary Formal Systems, Intrinsic Complexity, and Procrastination. Information and Computation. 132(1). 65–84. 16 indexed citations
11.
McCreath, Eric & Arun Sharma. (1997). ILP with noise and fixed example size: a Bayesian approach. International Joint Conference on Artificial Intelligence. 1310–1315. 9 indexed citations
12.
Jain, Sanjay & Arun Sharma. (1996). The Intrinsic Complexity of Language Identification. Journal of Computer and System Sciences. 52(3). 393–402. 15 indexed citations
13.
Case, John, Sanjay Jain, & Arun Sharma. (1996). Machine Induction without Revolutionary Changes in Hypothesis Size. Information and Computation. 128(2). 73–86. 1 indexed citations
14.
Jain, Sanjay & Arun Sharma. (1995). On aggregating teams of learning machines. Theoretical Computer Science. 137(1). 85–108. 6 indexed citations
15.
Case, John, Sanjay Jain, & Arun Sharma. (1995). Complexity Issues for Vacillatory Function Identification. Information and Computation. 116(2). 174–192. 5 indexed citations
16.
Case, John, Sanjay Jain, & Arun Sharma. (1994). Vacillatory learning of nearly minimal size grammars. Journal of Computer and System Sciences. 49(2). 189–207. 6 indexed citations
17.
Jain, Sanjay & Arun Sharma. (1990). Finite learning by a “team”. Conference on Learning Theory. 163–177. 18 indexed citations
18.
Jain, Sanjay & Arun Sharma. (1990). Hypothesis formation and language acquisition with an infinitely-often correct teacher. 225–239. 1 indexed citations
19.
Jain, Sanjay, Arun Sharma, & John Case. (1989). Convergence to nearly minimal size grammars by vacillating learning machines. Conference on Learning Theory. 189–199. 8 indexed citations
20.
Jain, Sanjay K. & Arun Sharma. (1989). Recursion theoretic characterizations of language learning. UR Research (University of Rochester). 2 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

Rankless by CCL
2026