S. Akshay

495 total citations
17 papers, 61 citations indexed

About

S. Akshay is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, S. Akshay has authored 17 papers receiving a total of 61 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 5 papers in Software. Recurrent topics in S. Akshay's work include Formal Methods in Verification (12 papers), semigroups and automata theory (4 papers) and Logic, programming, and type systems (4 papers). S. Akshay is often cited by papers focused on Formal Methods in Verification (12 papers), semigroups and automata theory (4 papers) and Logic, programming, and type systems (4 papers). S. Akshay collaborates with scholars based in India, France and Singapore. S. Akshay's co-authors include Blaise Genest, P. S. Thiagarajan, Manindra Agrawal, Kuldeep S. Meel, Joël Ouaknine, James Worrell, K. Narayan Kumar, Madhavan Mukund, Paul Gastin and Bing Liu and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

S. Akshay

15 papers receiving 59 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
S. Akshay India	5	40	38	14	5	5	17	61
Benjamin Monmege France	5	40 1.0×	32 0.8×	13 0.9×	5 1.0×		12	55
Oliver Friedmann Germany	6	95 2.4×	76 2.0×	9 0.6×	4 0.8×	2 0.4×	15	119
Soonho Kong United States	5	33 0.8×	27 0.7×	19 1.4×	9 1.8×	1 0.2×	10	60
Nathanaël Fijalkow France	5	55 1.4×	57 1.5×	4 0.3×	4 0.8×		24	66
David Janin France	5	65 1.6×	51 1.3×	12 0.9×	5 1.0×		14	73
Sylvain Schmitz France	7	55 1.4×	50 1.3×	11 0.8×	11 2.2×		17	74
Mickaël Randour Belgium	6	56 1.4×	41 1.1×	9 0.6×	6 1.2×		18	79
Stefan Göller Germany	6	79 2.0×	73 1.9×	15 1.1×	6 1.2×		23	92
Diego Figueira France	6	48 1.2×	65 1.7×	9 0.6×	5 1.0×	1 0.2×	19	78
Jesse Alama Portugal	6	36 0.9×	62 1.6×	5 0.4×	2 0.4×	2 0.4×	14	92

Countries citing papers authored by S. Akshay

Since Specialization

Citations

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

Fields of papers citing papers by S. Akshay

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of S. Akshay

This figure shows the co-authorship network connecting the top 25 collaborators of S. Akshay. A scholar is included among the top collaborators of S. Akshay 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 S. Akshay. S. Akshay 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:

17 of 17 papers shown

Akshay, S., et al.. (2024). COMPARISON OF EXPLAINABILITY OF MACHINE LEARNING BASED MALAYALAM TEXT CLASSIFICATION. ICTACT Journal on Soft Computing. 15(1). 3386–3391.

Akshay, S., et al.. (2024). Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. EPiC series in computing. 100. 484–464. 1 indexed citations

Meel, Kuldeep S. & S. Akshay. (2020). Sparse Hashing for Scalable Approximate Model Counting. 728–741. 8 indexed citations

Akshay, S., et al.. (2020). Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Akshay, S., et al.. (2020). Boolean functional synthesis: hardness and practical algorithms. Formal Methods in System Design. 57(1). 53–86. 1 indexed citations

Akshay, S., Paul Gastin, & Shankara Narayanan Krishna. (2018). Analyzing Timed Systems Using Tree Automata. SHILAP Revista de lepidopterología. 1 indexed citations

Akshay, S., et al.. (2017). Towards an Efficient Tree Automata Based Technique for Timed Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Akshay, S., et al.. (2017). On Petri Nets with Hierarchical Special Arcs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Akshay, S., et al.. (2017). Complexity of Restricted Variants of Skolem and Related Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 2 indexed citations

10.

Akshay, S., Paul Gastin, Madhavan Mukund, & K. Narayan Kumar. (2015). Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science. 594. 24–43. 2 indexed citations

11.

Agrawal, Manindra, S. Akshay, Blaise Genest, & P. S. Thiagarajan. (2015). Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM. 62(1). 1–34. 9 indexed citations

12.

Akshay, S., et al.. (2014). Reachability problems for Markov chains. Information Processing Letters. 115(2). 155–158. 13 indexed citations

13.

Akshay, S., Benedikt Bollig, Paul Gastin, Madhavan Mukund, & K. Narayan Kumar. (2014). Distributed Timed Automata with Independently Evolving Clocks. Fundamenta Informaticae. 130(4). 377–407. 1 indexed citations

14.

Palaniappan, Sucheendra K., S. Akshay, Bing Liu, Blaise Genest, & P. S. Thiagarajan. (2012). A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9(5). 1352–1365. 7 indexed citations

15.

Agrawal, Manindra, S. Akshay, Blaise Genest, & P. S. Thiagarajan. (2012). Approximate Verification of the Symbolic Dynamics of Markov Chains. National University of Singapore. 8. 55–64. 8 indexed citations

16.

Akshay, S.. (2010). Specification and Verification for Distributed and Timed Systems. 1 indexed citations

17.

Akshay, S., Paul Gastin, Madhavan Mukund, & K. Narayan Kumar. (2010). Model checking time-constrained scenario-based specifications. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 204–215. 4 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