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.
Countries citing papers authored by Elie Bursztein
Since
Specialization
Citations
This map shows the geographic impact of Elie Bursztein'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 Elie Bursztein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Elie Bursztein more than expected).
This network shows the impact of papers produced by Elie Bursztein. 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 Elie Bursztein. The network helps show where Elie Bursztein may publish in the future.
Co-authorship network of co-authors of Elie Bursztein
This figure shows the co-authorship network connecting the top 25 collaborators of Elie Bursztein.
A scholar is included among the top collaborators of Elie Bursztein 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 Elie Bursztein. Elie Bursztein is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Blazytko, Tim, Matt Bishop, Cornelius Aschermann, et al.. (2019). {GRIMOIRE}: Synthesizing Structure while Fuzzing. 1985–2002.34 indexed citations
7.
Thomas, Kurt, et al.. (2018). Data Breaches: User Comprehension, Expectations, and Concerns with Handling Exposed Data. Symposium On Usable Privacy and Security. 217–234.8 indexed citations
8.
Antonakakis, Manos, Michael Bailey, Matthew Bernhard, et al.. (2017). Understanding the mirai botnet. USENIX Security Symposium. 1093–1110.744 indexed citations breakdown →
9.
Thomas, Kurt, Juan A. Crespo, Ali Asghar Tofigh, et al.. (2016). Investigating Commercial Pay-Per-Install and the Distribution of Unwanted Software. USENIX Security Symposium. 721–739.27 indexed citations
10.
Thomas, Kurt, Danny Yuxing Huang, David Y. Wang, et al.. (2015). Framing dependencies introduced by underground commoditization.62 indexed citations
Bursztein, Elie, Chinmay Soman, Dan Boneh, & John C. Mitchell. (2012). SessionJuggler. 321–330.10 indexed citations
15.
Soman, Chinmay, et al.. (2011). Toward secure embedded web interfaces. USENIX Security Symposium. 2–2.13 indexed citations
16.
Bursztein, Elie, et al.. (2011). Openconflict preventing real time map hacks in online games. Security and Privacy.1 indexed citations
17.
Aggarwal, Gaurav, Elie Bursztein, Collin Jackson, & Dan Boneh. (2010). An analysis of private browsing modes in modern browsers. USENIX Security Symposium. 6–6.110 indexed citations
18.
Yoneki, Eiko, et al.. (2010). Proceedings of the 3rd Workshop on Social Network Systems.7 indexed citations
Bursztein, Elie, et al.. (2010). Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks. 1–8.22 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.