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.
HOLMES: Real-Time APT Detection through Correlation of Suspicious Information Flows
2019261 citationsSadegh M. Milajerdi, Rigel Gjomemo et al.profile →
This map shows the geographic impact of R. Sekar'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 R. Sekar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites R. Sekar more than expected).
This network shows the impact of papers produced by R. Sekar. 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 R. Sekar. The network helps show where R. Sekar may publish in the future.
Co-authorship network of co-authors of R. Sekar
This figure shows the co-authorship network connecting the top 25 collaborators of R. Sekar.
A scholar is included among the top collaborators of R. Sekar 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 R. Sekar. R. Sekar is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hossain, Nahid, Sadegh M. Milajerdi, Birhanu Eshete, et al.. (2017). {SLEUTH}: Real-time Attack Scenario Reconstruction from {COTS} Audit Data. USENIX Security Symposium. 487–504.31 indexed citations
4.
Kuznetsov, Volodymyr, László Szekeres, Mathias Payer, et al.. (2014). Code-pointer integrity. Operating Systems Design and Implementation. 147–163.224 indexed citations
Sekar, R.. (2009). An Efficient Black-box Technique for Defeating Web Application Attacks.. Network and Distributed System Security Symposium.70 indexed citations
8.
Tongaonkar, Alok, et al.. (2008). Fast packet classification for Snort by native compilation of rules. USENIX Large Installation Systems Administration Conference. 159–165.14 indexed citations
9.
Sun, Weiqing, et al.. (2008). V-NetLab: an approach for realizing logically isolated networks for security experiments. USENIX Security Symposium. 5.18 indexed citations
10.
Tongaonkar, Alok, et al.. (2007). Inferring higher level policies from firewall rules. USENIX Large Installation Systems Administration Conference. 2.20 indexed citations
11.
Xu, Wei, Sandeep Bhatkar, & R. Sekar. (2006). Taint-enhanced policy enforcement: a practical approach to defeat a wide range of attacks. USENIX Security Symposium. 9.236 indexed citations
12.
Bhatkar, Sandeep, R. Sekar, & Daniel C. DuVarney. (2005). Efficient techniques for comprehensive protection from memory error exploits. USENIX Security Symposium. 17–17.198 indexed citations
13.
Sun, Weiqing, Zhenkai Liang, V. N. Venkatakrishnan, & R. Sekar. (2005). One-Way Isolation: An Effective Approach for Realizing Safe Execution Environments.. Network and Distributed System Security Symposium.37 indexed citations
14.
Liang, Zhenkai, R. Sekar, & Daniel C. DuVarney. (2005). Automatic synthesis of filters to discard buffer overflow attacks: a step towards realizing self-healing systems. USENIX Annual Technical Conference. 21–21.8 indexed citations
15.
Bhatkar, Sandeep, Daniel C. DuVarney, & R. Sekar. (2003). Address obfuscation: an efficient approach to combat a board range of memory error exploits. USENIX Security Symposium. 8–8.360 indexed citations
16.
Venkatakrishnan, V. N., et al.. (2002). An Approach for Secure Software Installation. USENIX Large Installation Systems Administration Conference. 219–226.5 indexed citations
17.
Sekar, R., et al.. (2000). User-Level Infrastructure for System Call Interposition: A Platform for Intrusion Detection and Confinement.. Network and Distributed System Security Symposium.68 indexed citations
18.
Sekar, R. & Prem Uppuluri. (1999). Synthesizing fast intrusion prevention/detection systems from high-level specifications. Iowa State University Digital Repository (Iowa State University). 6–6.73 indexed citations
19.
Dawson, Steven, C. R. Ramakrishnan, I. V. Ramakrishnan, & R. Sekar. (1993). Extracting determinacy in logic programs. International Conference on Logic Programming. 424–438.9 indexed citations
20.
Sekar, R., et al.. (1989). OBJ as a theorem prover with applications to hardware verification. Springer eBooks. 218–267.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.