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.
Polyhedral parallel code generation for CUDA
2013216 citationsSven Verdoolaege, Albert Cohen et al.ACM Transactions on Architecture and Code Optimizationprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Sven Verdoolaege
Since
Specialization
Citations
This map shows the geographic impact of Sven Verdoolaege'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 Sven Verdoolaege with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sven Verdoolaege more than expected).
Fields of papers citing papers by Sven Verdoolaege
This network shows the impact of papers produced by Sven Verdoolaege. 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 Sven Verdoolaege. The network helps show where Sven Verdoolaege may publish in the future.
Co-authorship network of co-authors of Sven Verdoolaege
This figure shows the co-authorship network connecting the top 25 collaborators of Sven Verdoolaege.
A scholar is included among the top collaborators of Sven Verdoolaege 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 Sven Verdoolaege. Sven Verdoolaege is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Verdoolaege, Sven, et al.. (2018). Extending Pluto-style polyhedral scheduling with consecutivity. Lirias (KU Leuven).1 indexed citations
2.
Verdoolaege, Sven & Gerda Janssens. (2017). Scheduling for PPCG. Lirias (KU Leuven).6 indexed citations
3.
Verdoolaege, Sven & Albert Cohen. (2016). Live-Range Reordering. Lirias (KU Leuven).3 indexed citations
Verdoolaege, Sven, Hristo N. Nikolov, & Todor Stefanov. (2006). Improved derivation of process networks. Psychopharmacology. 231(8). 1–10.8 indexed citations
16.
Verdoolaege, Sven, Kevin M. Woods, Maurice Bruynooghe, & Ronald Cools. (2005). Computation and manipulation of enumerators of integer projections of parametric polytopes. Lirias (KU Leuven).15 indexed citations
17.
Verdoolaege, Sven, Maurice Bruynooghe, Francky Catthoor, & Gerda Janssens. (2004). Enumeration of integer projections of parametric polytopes. Lirias (KU Leuven). 1(3). 2074–2075.
18.
Verdoolaege, Sven, Kristof Beyls, Maurice Bruynooghe, Rachid Seghir, & Vincent Loechner. (2004). Analytical computation of Ehrhart polynomials and its applications for embedded systems. Lirias (KU Leuven). 1–1.5 indexed citations
19.
Eynde, Frank Van, et al.. (1999). The semantics of temporal adjuncts.. 169–179.1 indexed citations
20.
Meier, Willi, et al.. (1998). 1Analysis Methods for (Alleged) RC4. Lirias (KU Leuven).17 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.