| 2008 |
|---|
| 7 | EE | Florent Bouchez,
Alain Darte,
Fabrice Rastello:
Advanced conservative and optimistic register coalescing.
CASES 2008: 147-156 |
| 2007 |
|---|
| 6 | EE | Florent Bouchez,
Alain Darte,
Fabrice Rastello:
On the Complexity of Register Coalescing.
CGO 2007: 102-114 |
| 5 | EE | Florent Bouchez,
Alain Darte,
Fabrice Rastello:
On the complexity of spill everywhere under SSA form.
LCTES 2007: 103-112 |
| 4 | EE | Florent Bouchez,
Alain Darte,
Fabrice Rastello:
On the Complexity of Spill Everywhere under SSA Form
CoRR abs/0710.3642: (2007) |
| 2006 |
|---|
| 3 | EE | Florent Bouchez,
Alain Darte,
Christophe Guillon,
Fabrice Rastello:
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How.
LCPC 2006: 283-298 |
| 2005 |
|---|
| 2 | EE | Christophe Guillon,
Fabrice Rastello,
Thierry Bidault,
Florent Bouchez:
Procedure placement using temporal-ordering information: Dealing with code size expansion.
J. Embedded Computing 1(4): 437-459 (2005) |
| 2004 |
|---|
| 1 | EE | Christophe Guillon,
Fabrice Rastello,
Thierry Bidault,
Florent Bouchez:
Procedure placement using temporal-ordering information: dealing with code size expansion.
CASES 2004: 268-279 |
