| 2007 |
|---|
| 12 | EE | Robert Strandh,
John Hamer,
Gilbert Baumann:
Using Stealth Mixins to Achieve Modularity.
ASWEC 2007: 111-116 |
| 2004 |
|---|
| 11 | EE | Achille J.-P. Braquelaire,
Robert Strandh:
A color model for rendering linear passive graphic 2D objects.
Graphical Models 66(2): 71-88 (2004) |
| 1997 |
|---|
| 10 | | Alain Miniussi,
Robert Strandh:
An Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting Systems.
APPIA-GULP-PRODE 1997: 445-456 |
| 9 | | Bruno Salinier,
Robert Strandh:
Simulating Forward-Branching Systems with Constructor Systems.
TAPSOFT 1997: 153-164 |
| 1996 |
|---|
| 8 | | Bruno Salinier,
Robert Strandh:
Efficient Simulation of Forward-Branching Systems with Constructor Systems.
J. Symb. Comput. 22(4): 381-399 (1996) |
| 1994 |
|---|
| 7 | | Timo Metzemakers,
Alain Miniussi,
David Sherman,
Robert Strandh:
Improving Arithmetic Performance using Fine-Grain Unfolding.
PLILP 1994: 324-339 |
| 1992 |
|---|
| 6 | | David Sherman,
Robert Strandh:
Call Unfolding Strategies for Equational Logic Programs.
PEPM 1992: 48-53 |
| 1991 |
|---|
| 5 | | Irène Durand,
David Sherman,
Robert Strandh:
Partial Evaluation of an Intermediate Language for Equational Programs.
JTASPEFT/WSA 1991: 98-106 |
| 4 | | David Sherman,
Robert Strandh,
Irène Durand:
Optimization of Equational Programs Using Partial Evaluation.
PEPM 1991: 72-82 |
| 3 | | Srecko Brlek,
Pierre Castéran,
Robert Strandh:
On Addition Schemes.
TAPSOFT, Vol.2 1991: 379-393 |
| 1989 |
|---|
| 2 | | Robert Strandh:
Classes of Equational Programs that Compile into Efficient Machine Code.
RTA 1989: 449-461 |
| 1987 |
|---|
| 1 | | Robert Strandh:
Optimizing Equational Programs.
RTA 1987: 13-24 |
