C. Seshadhri

3.8k total citations
91 papers, 1.6k citations indexed

About

C. Seshadhri is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistical and Nonlinear Physics. According to data from OpenAlex, C. Seshadhri has authored 91 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 48 papers in Artificial Intelligence and 33 papers in Statistical and Nonlinear Physics. Recurrent topics in C. Seshadhri's work include Complexity and Algorithms in Graphs (35 papers), Complex Network Analysis Techniques (33 papers) and Machine Learning and Algorithms (22 papers). C. Seshadhri is often cited by papers focused on Complexity and Algorithms in Graphs (35 papers), Complex Network Analysis Techniques (33 papers) and Machine Learning and Algorithms (22 papers). C. Seshadhri collaborates with scholars based in United States, Israel and United Kingdom. C. Seshadhri's co-authors include Tamara G. Kolda, Ali Pınar, Ali Pınar, Madhav Jha, David F. Gleich, Ali Pinar, Todd Plantenga, Nitin Saxena, Ahmet Erdem Sarıyüce and Elad Hazan and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Physical Review Letters and Journal of the ACM.

In The Last Decade

C. Seshadhri

88 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
C. Seshadhri United States	20	825	823	474	448	433	91	1.6k
Andrej Krevl Slovenia	3	947 1.1×	767 0.9×	194 0.4×	527 1.2×	577 1.3×	4	1.8k
Reid Andersen United States	14	602 0.7×	551 0.7×	162 0.3×	224 0.5×	371 0.9×	25	1.2k
Charalampos E. Tsourakakis United States	22	1.0k 1.2×	1.1k 1.3×	439 0.9×	1.2k 2.6×	747 1.7×	51	2.4k
Yiping Ke Singapore	24	719 0.9×	948 1.2×	352 0.7×	653 1.5×	636 1.5×	67	2.0k
Flavio Chierichetti United States	17	419 0.5×	449 0.5×	132 0.3×	307 0.7×	395 0.9×	55	1.1k
William Aiello United States	25	616 0.7×	846 1.0×	281 0.6×	103 0.2×	1.3k 3.0×	50	2.4k
Kamesh Madduri United States	22	359 0.4×	456 0.6×	142 0.3×	631 1.4×	675 1.6×	70	1.5k
Colin Cooper United Kingdom	23	614 0.7×	319 0.4×	455 1.0×	88 0.2×	574 1.3×	119	1.7k
Tamás Sarlós United States	17	277 0.3×	883 1.1×	214 0.5×	426 1.0×	294 0.7×	31	1.6k
Massimo Santini Italy	13	369 0.4×	604 0.7×	146 0.3×	547 1.2×	474 1.1×	25	1.4k

Countries citing papers authored by C. Seshadhri

Since Specialization

Citations

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

Fields of papers citing papers by C. Seshadhri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of C. Seshadhri

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

Pan, Yunjie, et al.. (2024). Accurate and Fast Estimation of Temporal Motifs Using Path Sampling. 809–814.

Seshadhri, C., et al.. (2024). Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. 519–522.

Chakrabarty, Deeparnab, et al.. (2020). . Theory of Computing. 16(1). 1–36. 1 indexed citations

Kumar, Akash, et al.. (2018). Finding forbidden minors in sublinear time: a O(n 1/2+o(1) )-query one-sided tester for minor closed properties on bounded degree graphs.. 25. 101.

Sarıyüce, Ahmet Erdem, C. Seshadhri, & Ali Pınar. (2017). Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions.. arXiv (Cornell University). 8 indexed citations

Seshadhri, C., et al.. (2016). Characterizing short-term stability for Boolean networks over any distribution of transfer functions. Physical review. E. 94(1). 12301–12301. 5 indexed citations

Chakrabarty, Deeparnab, et al.. (2015). Property testing on product distributions: optimal testers for bounded derivative properties. Symposium on Discrete Algorithms. 13(2). 1809–1828. 2 indexed citations

Chakrabarty, Deeparnab & C. Seshadhri. (2014). . Theory of Computing. 10(1). 453–464. 12 indexed citations

Seshadhri, C., et al.. (2013). The importance of directed triangles with reciprocity: patterns and algorithms.. arXiv (Cornell University). 4 indexed citations

10.

Seshadhri, C., Ali Pınar, & Tamara G. Kolda. (2012). Fast triangle counting through wedge sampling.. arXiv (Cornell University). 13 indexed citations

11.

Seshadhri, C., Tamara G. Kolda, & Ali Pinar. (2012). Community structure and scale-free collections of Erdős-Rényi graphs. Physical Review E. 85(5). 56109–56109. 136 indexed citations

12.

Jha, Madhav, C. Seshadhri, & Ali Pınar. (2012). From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting. arXiv (Cornell University). 2 indexed citations

13.

Kale, Satyen & C. Seshadhri. (2011). Combinatorial Approximation Algorithms for MAXCUT using Random Walks.. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 367–388. 6 indexed citations

14.

Seshadhri, C., Ali Pınar, & Tamara G. Kolda. (2011). A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. arXiv (Cornell University). 2 indexed citations

15.

Pınar, Ali, C. Seshadhri, & Tamara G. Kolda. (2011). An In-Depth Study of Stochastic Kronecker Graphs.. Journal of the ACM. 1 indexed citations

16.

Seshadhri, C., Yevgeniy Vorobeychik, Jackson R. Mayo, Robert C. Armstrong, & Joseph R. Ruthruff. (2011). Influence and Dynamic Behavior in Random Boolean Networks. Physical Review Letters. 107(10). 108701–108701. 12 indexed citations

17.

Saks, Michael & C. Seshadhri. (2008). Parallel monotonicity reconstruction. Symposium on Discrete Algorithms. 962–971. 7 indexed citations

18.

Kale, Satyen & C. Seshadhri. (2007). Testing Expansion in Bounded Degree Graphs. Electronic colloquium on computational complexity. 14. 10 indexed citations

19.

Ailon, Nir, Bernard Chazelle, C. Seshadhri, & Ding Liu. (2006). Self-improving algorithms. Symposium on Discrete Algorithms. 261–270. 8 indexed citations

20.

Seshadhri, C., et al.. (2005). RAM Simulation of BGS Model of Abstract State Machines.. Fundamenta Informaticae. 77(1). 175–185. 1 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