Sylvain Lelait

According to our database, Sylvain Lelait authored at least 7 papers between 1995 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Efficiently implementing maximum independent set algorithms on circle graphs.

Nicholas Nash, Sylvain Lelait, David Gregg

ACM J. Exp. Algorithmics, 2008

2002

Circular-arc graph coloring: On chords and circuits in the meeting graph.

Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Elena Stöhr

Eur. J. Oper. Res., 2002

2000

Compilation Techniques for Multimedia Processors.

Andreas Krall, Sylvain Lelait

Int. J. Parallel Program., 2000

1999

On a Graph-theoretical Model for Cyclic Register Allocation.

Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Bruno Marmol

Discret. Appl. Math., 1999

Compiler-Directed Reordering of Data by Cyclic Graph Coloring.

Daniela Genius, Sylvain Lelait

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998

A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops.

Sylvain Lelait, Guang R. Gao, Christine Eisenbeis

Proceedings of the Compiler Construction, 7th International Conference, 1998

1995

The meeting graph: a new model for loop cyclic register allocation.

Christine Eisenbeis, Sylvain Lelait, Bruno Marmol

Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques, 1995