default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Verdoolaege
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Nicolas Vasilache, Oleksandr Zinenko
, Theodoros Theodoridis, Priya Goyal, Zachary DeVito, William S. Moses, Sven Verdoolaege, Andrew Adams, Albert Cohen:
The Next 700 Accelerated Layers: From Mathematical Expressions of Network Computation Graphs to Accelerated GPU Kernels, Automatically. ACM Trans. Archit. Code Optim. 16(4): 38:1-38:26 (2020)
2010 – 2019
- 2018
- [c17]Oleksandr Zinenko, Sven Verdoolaege, Chandan Reddy, Jun Shirako, Tobias Grosser, Vivek Sarkar, Albert Cohen:
Modeling the conflicting demands of parallelism and Temporal/Spatial locality in affine scheduling. CC 2018: 3-13 - [i4]Nicolas Vasilache, Oleksandr Zinenko, Theodoros Theodoridis, Priya Goyal, Zachary DeVito, William S. Moses, Sven Verdoolaege, Andrew Adams, Albert Cohen:
Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions. CoRR abs/1802.04730 (2018) - 2015
- [j12]Tobias Grosser, Sven Verdoolaege, Albert Cohen:
Polyhedral AST Generation Is More Than Scanning Polyhedra. ACM Trans. Program. Lang. Syst. 37(4): 12:1-12:50 (2015) - [c16]Riyadh Baghdadi, Ulysse Beaugnon, Albert Cohen, Tobias Grosser, Michael Kruse, Chandan Reddy, Sven Verdoolaege, Adam Betts, Alastair F. Donaldson, Jeroen Ketema, Javed Absar, Sven van Haastregt, Alexey Kravets, Anton Lokhmotov, Robert David, Elnar Hajiyev:
PENCIL: A Platform-Neutral Compute Intermediate Language for Accelerator Programming. PACT 2015: 138-149 - 2014
- [j11]Tobias Grosser, Sven Verdoolaege, Albert Cohen, P. Sadayappan:
The Relation Between Diamond Tiling and Hexagonal Tiling. Parallel Process. Lett. 24(3) (2014) - [c15]Tobias Grosser, Albert Cohen, Justin Holewinski, P. Sadayappan, Sven Verdoolaege:
Hybrid Hexagonal/Classical Tiling for GPUs. CGO 2014: 66 - 2013
- [j10]Riyadh Baghdadi, Albert Cohen, Sven Verdoolaege, Konrad Trifunovic:
Improved loop tiling based on the removal of spurious false dependences. ACM Trans. Archit. Code Optim. 9(4): 52:1-52:26 (2013) - [j9]Sven Verdoolaege, Juan Carlos Juega, Albert Cohen, José Ignacio Gómez, Christian Tenllado, Francky Catthoor:
Polyhedral parallel code generation for CUDA. ACM Trans. Archit. Code Optim. 9(4): 54:1-54:23 (2013) - [c14]Tobias Grosser, Albert Cohen, Paul H. J. Kelly, J. Ramanujam, P. Sadayappan, Sven Verdoolaege:
Split tiling for GPUs: automatic parallelization using trapezoidal tiles. GPGPU@ASPLOS 2013: 24-31 - [p2]Sven Verdoolaege:
Polyhedral Process Networks. Handbook of Signal Processing Systems 2013: 1335-1375 - [i3]Riyadh Baghdadi, Albert Cohen, Serge Guelton, Sven Verdoolaege, Jun Inoue, Tobias Grosser, Georgia Kouveli, Alexey Kravets, Anton Lokhmotov, Cedric Nugteren, Fraser Waters, Alastair F. Donaldson:
PENCIL: Towards a Platform-Neutral Compute Intermediate Language for DSLs. CoRR abs/1302.5586 (2013) - 2012
- [j8]Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe:
Equivalence checking of static affine programs using widening to handle recurrences. ACM Trans. Program. Lang. Syst. 34(3): 11:1-11:35 (2012) - 2011
- [c13]Sven Verdoolaege, Albert Cohen, Anna Beletska:
Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations. SAS 2011: 216-232 - 2010
- [j7]Sven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems. J. Electron. Test. 26(2): 279-292 (2010) - [c12]Sven Verdoolaege:
isl: An Integer Set Library for the Polyhedral Model. ICMS 2010: 299-302 - [p1]Sven Verdoolaege:
Polyhedral Process Networks. Handbook of Signal Processing Systems 2010: 931-965
2000 – 2009
- 2009
- [j6]Philippe Clauss, Federico Javier Fernández, Diego Garbervetsky, Sven Verdoolaege:
Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation. IEEE Trans. Very Large Scale Integr. Syst. 17(8): 983-996 (2009) - [c11]Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe:
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences. CAV 2009: 599-613 - [c10]Sven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Experience with widening based equivalence checking in realistic multimedia systems. HLDVT 2009: 122-129 - 2008
- [j5]Matthias Köppe, Sven Verdoolaege:
Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm. Electron. J. Comb. 15(1) (2008) - [j4]Sven Verdoolaege, Kevin M. Woods:
Counting with rational generating functions. J. Symb. Comput. 43(2): 75-91 (2008) - [j3]Per Gunnar Kjeldsberg, Francky Catthoor, Sven Verdoolaege, Martin Palkovic, Arnout Vandecappelle, Qubo Hu, Einar J. Aas:
Guidance of Loop Ordering for Reduced Memory Usage in Signal Processing Applications. J. Signal Process. Syst. 53(3): 301-321 (2008) - [c9]Matthias Köppe, Sven Verdoolaege, Kevin M. Woods:
An Implementation of the Barvinok--Woods Integer Projection Algorithm. ITSL 2008: 53-59 - [c8]Sven Verdoolaege, Maurice Bruynooghe:
Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical Comparison. ITSL 2008: 60-66 - 2007
- [j2]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. Algorithmica 48(1): 37-66 (2007) - [j1]Sven Verdoolaege, Hristo Nikolov, Todor P. Stefanov:
pn: A Tool for Improved Derivation of Process Networks. EURASIP J. Embed. Syst. 2007 (2007) - 2005
- [c7]Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor:
Experiences with Enumeration of Integer Projections of Parametric Polytopes. CC 2005: 91-105 - 2004
- [c6]José Ignacio Gómez, Paul Marchal, Sven Verdoolaege, Luis Piñuel, Francky Catthoor:
Optimizing the Memory Bandwidth with Loop Morphing. ASAP 2004: 213-223 - [c5]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. CASES 2004: 248-258 - 2003
- [c4]Sven Verdoolaege, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Multi-dimentsional Incremetal Loops Fusion for Data Locality. ASAP 2003: 17-27 - 2000
- [i2]Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. CoRR cs.CL/0011034 (2000) - [i1]Sven Verdoolaege, Marc Denecker, Frank Van Eynde:
Abductive reasoning with temporal information. CoRR cs.CL/0011035 (2000)
1990 – 1999
- 1999
- [c3]Ness Schelkens, Frank Van Eynde, Sven Verdoolaege:
The semantics of temporal adjuncts. CLIN 1999 - [c2]Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. CLIN 1999 - 1998
- [c1]Lars R. Knudsen, Willi Meier, Bart Preneel, Vincent Rijmen, Sven Verdoolaege:
Analysis Methods for (Alleged) RC4. ASIACRYPT 1998: 327-341
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
