D. Sivakumar

9.6k total citations · 2 hit papers
75 papers, 5.1k citations indexed

About

D. Sivakumar is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, D. Sivakumar has authored 75 papers receiving a total of 5.1k indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Artificial Intelligence, 34 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in D. Sivakumar's work include Complexity and Algorithms in Graphs (30 papers), Cryptography and Data Security (12 papers) and Machine Learning and Algorithms (10 papers). D. Sivakumar is often cited by papers focused on Complexity and Algorithms in Graphs (30 papers), Cryptography and Data Security (12 papers) and Machine Learning and Algorithms (10 papers). D. Sivakumar collaborates with scholars based in United States, Israel and India. D. Sivakumar's co-authors include Ravi Kumar, Ravi Kumar, Ronald Fagin, Cynthia Dwork, Moni Naor, Ziv Bar-Yossef, T. S. Jayram, Andrew Tomkins, Prabhakar Raghavan and Eli Upfal 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

D. Sivakumar

68 papers receiving 4.6k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Rank aggregation methods for the Web

2001 1.1k citations Cynthia Dwork, Ravi Kumar et al. profile →
Comparing top k lists

2003 487 citations Ronald Fagin, Ravi Kumar et al. Symposium on Discrete Algorithms profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
D. Sivakumar United States	28	2.3k	1.4k	1.2k	1.1k	1.0k	75	5.1k
Ravi Kumar United States	42	3.5k 1.5×	1.6k 1.1×	1.5k 1.2×	1.1k 1.0×	1.3k 1.3×	147	6.6k
Ravi Kumar United States	22	1.5k 0.6×	1.5k 1.1×	921 0.8×	489 0.4×	1.1k 1.0×	42	3.7k
Francesco Bonchi Italy	42	3.1k 1.3×	1.8k 1.3×	1.2k 1.0×	486 0.4×	3.1k 3.1×	188	6.8k
Sudipto Guha United States	38	3.7k 1.6×	1.3k 0.9×	2.7k 2.2×	1.2k 1.1×	541 0.5×	114	7.3k
Santosh Vempala United States	37	2.6k 1.1×	492 0.4×	1.3k 1.0×	1.2k 1.1×	303 0.3×	167	5.4k
Sridhar Rajagopalan United States	23	1.8k 0.8×	2.1k 1.5×	1.4k 1.2×	371 0.3×	2.0k 2.0×	39	4.9k
Moses Charikar United States	42	3.7k 1.6×	1.3k 0.9×	3.1k 2.5×	2.0k 1.8×	517 0.5×	136	9.3k
Monika Henzinger Austria	33	1.8k 0.8×	2.4k 1.7×	1.6k 1.3×	886 0.8×	755 0.7×	139	5.0k
Yifan Hu United States	21	1.8k 0.8×	1.9k 1.4×	1.2k 1.0×	1.1k 1.0×	665 0.7×	91	5.5k
Andrew Odlyzko United States	44	2.2k 0.9×	748 0.5×	1.2k 1.0×	1.4k 1.2×	380 0.4×	219	6.7k

Countries citing papers authored by D. Sivakumar

Since Specialization

Citations

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

Fields of papers citing papers by D. Sivakumar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of D. Sivakumar

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

1.

Wang, Qifan, et al.. (2020). Learning to Extract Attribute Value from Product via Question Answering: A Multi-task Approach. 47–55. 46 indexed citations

2.

Kong, Weiwei, Christopher Liaw, Aranyak Mehta, & D. Sivakumar. (2019). A new dog learns old tricks: RL finds classic optimization algorithms. International Conference on Learning Representations. 17 indexed citations

3.

Vadivel, A., et al.. (2017). Contra $beta^{*}$-continuous and almost contra $beta^{*}$-continuous functions. 8(1). 55–71.

4.

Prakash, M. & D. Sivakumar. (2014). Information systems auditing and electronic commerce. International Journal of Advanced Research in Management and Social Sciences. 3(2). 106–119. 1 indexed citations

5.

Tan, Chee Fai, et al.. (2013). Fire Fighting Mobile Robot: State of the Art and Recent Development. AUSTRALIAN JOURNAL OF BASIC AND APPLIED SCIENCES. 7(10). 220–230. 27 indexed citations

6.

Kumar, Ravi & D. Sivakumar. (2010). Algorithms and models for the web graph : 7th international workshop, WAW 2010, Stanford, CA, USA, December 16 : 2010 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations

7.

Jayram, T. S., Ravi Kumar, & D. Sivakumar. (2008). . Theory of Computing. 4(1). 129–135. 23 indexed citations

8.

Baluja, Shumeet, D. Sivakumar, Yushi Jing, et al.. (2008). Video suggestion and discovery for youtube. 895–904. 296 indexed citations

9.

Fagin, Ronald, et al.. (2005). Efficient implementation of large-scale multi-structural databases. Very Large Data Bases. 958–969. 11 indexed citations

10.

Bar-Yossef, Ziv, T. S. Jayram, Ravi Kumar, & D. Sivakumar. (2004). An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences. 68(4). 702–732. 281 indexed citations

11.

Fagin, Ronald, Ravi Kumar, & D. Sivakumar. (2003). Comparing top k lists. Symposium on Discrete Algorithms. 17(1). 28–36. 487 indexed citations breakdown →

12.

Bar-Yossef, Ziv, Ravi Kumar, & D. Sivakumar. (2002). Reductions in streaming algorithms, with an application to counting triangles in graphs. Symposium on Discrete Algorithms. 623–632. 192 indexed citations

13.

Cai, Jin‐Yi & D. Sivakumar. (2002). The resolution of a Hartmanis conjecture. 28. 362–371. 3 indexed citations

14.

Dill, Stephen, Ravi Kumar, Kevin S. McCurley, et al.. (2001). Self-similarity in the Web. Very Large Data Bases. 69–78. 38 indexed citations

15.

Kumar, Ravi & D. Sivakumar. (2001). On polynomial approximation to the shortest lattice vector length. Symposium on Discrete Algorithms. 126–127. 10 indexed citations

16.

Sivakumar, D., et al.. (2001). On the unique shortest lattice vector problem. Theoretical Computer Science. 255(1-2). 641–648. 4 indexed citations

17.

Dwork, Cynthia, Ravi Kumar, Moni Naor, & D. Sivakumar. (2001). Rank aggregation methods for the Web. 613–622. 1111 indexed citations breakdown →

18.

Kumar, Ravi & D. Sivakumar. (1999). Roundness estimation via random sampling. Symposium on Discrete Algorithms. 603–612. 5 indexed citations

19.

Sivakumar, D.. (1999). On Membership Comparable Sets. Journal of Computer and System Sciences. 59(2). 270–280. 19 indexed citations

20.

Cai, Jin‐Yi & D. Sivakumar. (1999). Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. Journal of Computer and System Sciences. 58(2). 280–296. 3 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