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.
This map shows the geographic impact of Baris Kasikci'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 Baris Kasikci with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Baris Kasikci more than expected).
This network shows the impact of papers produced by Baris Kasikci. 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 Baris Kasikci. The network helps show where Baris Kasikci may publish in the future.
Co-authorship network of co-authors of Baris Kasikci
This figure shows the co-authorship network connecting the top 25 collaborators of Baris Kasikci.
A scholar is included among the top collaborators of Baris Kasikci 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 Baris Kasikci. Baris Kasikci is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Loughlin, Kevin, et al.. (2021). {DOLMA}: Securing Speculation with the Principle of Transient Non-Observability. USENIX Security Symposium. 1397–1414.17 indexed citations
Kwon, Youngjin, et al.. (2020). {AGAMOTTO}: How Persistent is your Persistent Memory Application?. Operating Systems Design and Implementation. 1047–1064.10 indexed citations
14.
Bhatotia, Pramod, et al.. (2018). CNTR: lightweight OS containers. Edinburgh Research Explorer (University of Edinburgh). 199–212.37 indexed citations
Kasikci, Baris, Cristiano Pereira, Gilles Pokam, et al.. (2015). Failure sketches: a better way to debug. 5–5.4 indexed citations
17.
Kasikci, Baris, Thomas Ball, George Candea, John Erickson, & Madanlal Musuvathi. (2014). Efficient tracing of cold code via bias-free sampling. USENIX Annual Technical Conference. 243–254.10 indexed citations
18.
Zamfir, Cristian, Baris Kasikci, Johannes Kinder, Edouard Bugnion, & George Candea. (2013). Automated debugging for arbitrarily long executions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 20–20.12 indexed citations
19.
Kasikci, Baris, Cristian Zamfir, & George Candea. (2012). CoRD: a collaborative framework for distributed data race detection. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 4–4.2 indexed citations
20.
Kasikci, Baris, Cristian Zamfir, & George Candea. (2012). Data races vs. data race bugs. ACM SIGARCH Computer Architecture News. 40(1). 185–198.7 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.