Synthesis of size-optimal toroidal arrays for the algebraic path problem. - Philippe Clauss; Catherine Mongenet; Guy-René Perrin (Algorithms and Parallel VLSI Architectures, 1991)

Mapping Systolic Algorithms on Distributed Memory Computers. - Philippe Clauss (EDMCC, 1991)

A Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays. - Catherine Mongenet; Philippe Clauss; Guy-René Perrin (IPPS, 1991)

Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution. - Philippe Clauss; Catherine Mongenet; Guy-René Perrin (Parallel Comput., 1992)

Calculus of space-optimal mappings of systolic algorithms on processor arrays. - Philippe Clauss; Catherine Mongenet; Guy-René Perrin (J. VLSI Signal Process., 1992)

Synthesis Aspects in the Design of Efficient Processor Arrays from Affine Recurrence Equations. - Philippe Clauss; Catherine Mongenet (J. Symb. Comput., 1993)

Optimal mapping of systolic algorithms by regular instruction shifts. - Philippe Clauss; Guy-René Perrin (ASAP, 1994)

An Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optimal Regular Processor Arrays. - Philippe Clauss (Parcella, 1994)

Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays. - Catherine Mongenet; Philippe Clauss; Guy-René Perrin (Acta Informatica, 1994)

Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs. - Philippe Clauss (International Conference on Supercomputing, 1996)

Handling Memory Cache Policy with Integer Points Counting. - Philippe Clauss (Euro-Par, 1997)

Parametric Analysis of Polyhedral Iteration Spaces. - Philippe Clauss; Vincent Loechner (J. VLSI Signal Process., 1998)

Automatic memory layout transformations to optimize spatial locality in parameterized loop nests. - Philippe Clauss; Benoît Meister (SIGARCH Comput. Archit. News, 2000)

Data Sequence Locality: A Generalization of Temporal Locality. - Vincent Loechner; Benoît Meister; Philippe Clauss (Euro-Par, 2001)

Precise Data Locality Optimization of Nested Loops. - Vincent Loechner; Benoît Meister; Philippe Clauss (J. Supercomput., 2002)

A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization. - Philippe Clauss; Irina Tchoupaeva (CC, 2004)

The Periodic-Linear Model of Program Behavior Capture. - Philippe Clauss; Bénédicte Kenmei; Jean Christophe Beyler (Euro-Par, 2005)

Polyhedral Modeling and Analysis of Memory Access Profiles. - Philippe Clauss; Bénédicte Kenmei (ASAP, 2006)

Esodyp+: Prefetching in the Jackal Software DSM. - Michael Klemm; Jean Christophe Beyler; Ronny T. Lampert; Michael Philippsen; Philippe Clauss (Euro-Par, 2007)

Performance driven data cache prefetching in a dynamic software optimization system. - Jean Christophe Beyler; Philippe Clauss (ICS, 2007)

Prediction and trace compression of data access addresses through nested loop recognition. - Alain Ketterlin; Philippe Clauss (CGO, 2008)

Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs. - Jean Christophe Beyler; Michael Klemm; Michael Philippsen; Philippe Clauss (Euro-Par, 2008)

Efficient Parallel Implementation of Evolutionary Algorithms on GPGPU Cards. - Ogier Maitre; Nicolas Lachiche; Philippe Clauss; Laurent A. Baumes; Avelino Corma; Pierre Collet (Euro-Par, 2009)

A meta-predictor framework for prefetching in object-based DSMs. - Jean Christophe Beyler; Michael Klemm; Philippe Clauss; Michael Philippsen (Concurr. Comput. Pract. Exp., 2009)

Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation. - Philippe Clauss; Federico Javier Fernández; Diego Garbervetsky; Sven Verdoolaege (IEEE Trans. Very Large Scale Integr. Syst., 2009)

Recovering the Memory Behavior of Executable Programs. - Alain Ketterlin; Philippe Clauss (SCAM, 2010)

VMAD: A virtual machine for advanced dynamic analysis of programs. - Alexandra Jimborean; Matthieu Herrmann; Vincent Loechner; Philippe Clauss (ISPASS, 2011)

Efficient memory tracing by program skeletonization. - Alain Ketterlin; Philippe Clauss (ISPASS, 2011)

Adaptive runtime selection of parallel schedules in the polytope model. - Benoît Pradelle; Philippe Clauss; Vincent Loechner (SpringSim (HPC), 2011)

VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework. - Alexandra Jimborean; Luis Mastrangelo; Vincent Loechner; Philippe Clauss (CC, 2012)

Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization. - Alain Ketterlin; Philippe Clauss (MICRO, 2012)

Adapting the polyhedral model as a framework for efficient speculative parallelization. - Alexandra Jimborean; Philippe Clauss; Benoît Pradelle; Luis Mastrangelo; Vincent Loechner (PPoPP, 2012)

Polyhedral parallelization of binary code. - Benoît Pradelle; Alain Ketterlin; Philippe Clauss (ACM Trans. Archit. Code Optim., 2012)

Online Dynamic Dependence Analysis for Speculative Polyhedral Parallelization. - Alexandra Jimborean; Philippe Clauss; Juan Manuel Martinez Caamaño; Aravind Sukumaran-Rajam (Euro-Par, 2013)

Dynamic and Speculative Polyhedral Parallelization of Loop Nests Using Binary Code Patterns. - Alexandra Jimborean; Philippe Clauss; Jean-François Dollinger; Vincent Loechner; Juan Manuel Martinez Caamaño (ICCS, 2013)

Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs. - Philippe Clauss (ICS 25th Anniversary, 2014)

Speculative Program Parallelization with Scalable and Decentralized Runtime Verification. - Aravind Sukumaran-Rajam; Juan Manuel Martinez Caamaño; Willy Wolff; Alexandra Jimborean; Philippe Clauss (RV, 2014)

Software-controlled processor stalls for time and energy efficient data locality optimization. - Philippe Clauss; Imen Fassi; Alexandra Jimborean (ICSAMOS, 2014)

Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons. - Alexandra Jimborean; Philippe Clauss; Jean-François Dollinger; Vincent Loechner; Juan Manuel Martinez Caamaño (Int. J. Parallel Program., 2014)

Recovering memory access patterns of executable programs. - Alain Ketterlin; Philippe Clauss (Sci. Comput. Program., 2014)

Speculative Runtime Parallelization of Loop Nests: Towards Greater Scope and Efficiency. - Aravind Sukumaran-Rajam; Luis Esteban Campostrini; Juan Manuel Martinez Caamaño; Philippe Clauss (IPDPS Workshops, 2015)

XFOR: Filling the Gap between Automatic Loop Optimization and Peak Performance. - Imen Fassi; Philippe Clauss (ISPDC, 2015)

Dynamic re-vectorization of binary code. - Nabil Hallou; Erven Rohou; Philippe Clauss; Alain Ketterlin (SAMOS, 2015)

Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization. - Juan Manuel Martinez Caamaño; Willy Wolff; Philippe Clauss (Euro-Par, 2016)

The Polyhedral Model of Nonlinear Loops. - Aravind Sukumaran-Rajam; Philippe Clauss (ACM Trans. Archit. Code Optim., 2016)

Automatic Collapsing of Non-Rectangular Loops. - Philippe Clauss; Ervin Altintas; Matthieu Kuhn (IPDPS, 2017)

Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones. - Juan Manuel Martinez Caamaño; Manuel Selva; Philippe Clauss; Artyom Baloian; Willy Wolff (Concurr. Comput. Pract. Exp., 2017)

Runtime Vectorization Transformations of Binary Code. - Nabil Hallou; Erven Rohou; Philippe Clauss (Int. J. Parallel Program., 2017)

AutoParallel: A Python module for automatic parallelization and distributed execution of affine loop nests. - Cristian Ramon-Cortes; Ramon Amela; Jorge Ejarque; Philippe Clauss; Rosa M. Badia (CoRR, 2018)

Runtime multi-versioning and specialization inside a memoized speculative loop optimizer. - Raquel Lazcano; Daniel Madroñal; Eduardo Juárez 001; Philippe Clauss (CC, 2020)

Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy. - Salwa Kobeissi; Alain Ketterlin; Philippe Clauss (SAMOS, 2020)

AutoParallel: Automatic parallelisation and distributed execution of affine loop nests in Python. - Cristian Ramon-Cortes; Ramon Amela; Jorge Ejarque; Philippe Clauss; Rosa M. Badia (Int. J. High Perform. Comput. Appl., 2020)