This map shows the geographic impact of Atul Luykx'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 Atul Luykx with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Atul Luykx more than expected).
This network shows the impact of papers produced by Atul Luykx. 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 Atul Luykx. The network helps show where Atul Luykx may publish in the future.
Co-authorship network of co-authors of Atul Luykx
This figure shows the co-authorship network connecting the top 25 collaborators of Atul Luykx.
A scholar is included among the top collaborators of Atul Luykx 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 Atul Luykx. Atul Luykx is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Andreeva, Elena, Andrey Bogdanov, Atul Luykx, et al.. (2014). How to Securely Release Unverified Plaintext in Authenticated Encryption. Lecture notes in computer science. 2014. 105–125.2 indexed citations
19.
Andreeva, Elena, Andrey Bogdanov, Atul Luykx, et al.. (2013). Parallelizable and Authenticated Online Ciphers. Lecture notes in computer science. 2013. 424–443.
20.
Andreeva, Elena, Atul Luykx, & Bart Mennink. (2012). Provable Security of BLAKE with Non-Ideal Compression Function. Lecture notes in computer science. 7707. 322–339.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.