| 2003 |
|---|
| 10 | EE | Lal George,
Matthias Blume:
Taming the IXP network processor.
PLDI 2003: 26-37 |
| 2001 |
|---|
| 9 | | Andrew W. Appel,
Lal George:
Optimal Spilling for CISC Machines with Few Registers.
PLDI 2001: 243-253 |
| 1999 |
|---|
| 8 | EE | Allen Leung,
Lal George:
Static Single Assignment Form for machine Code.
PLDI 1999: 204-214 |
| 1996 |
|---|
| 7 | EE | Lal George,
Andrew W. Appel:
Iterated Register Coalescing.
POPL 1996: 208-218 |
| 6 | EE | Lal George,
Andrew W. Appel:
Iterated Register Coalescing.
ACM Trans. Program. Lang. Syst. 18(3): 300-324 (1996) |
| 1994 |
|---|
| 5 | | Lal George,
Florent Guillame,
John H. Reppy:
A Portable and Optimizing Back End for the SML/NJ Compiler.
CC 1994: 83-97 |
| 1992 |
|---|
| 4 | | Lal George,
Gary Lindstrom:
Using a Functional Language id Graph Reduction to Program Multiprocessor Machines, or Functional Control of Imperative Programs.
IPPS 1992: 370-373 |
| 1990 |
|---|
| 3 | | Lal George:
A Scheduling Strategy for Shared Memory Multiprocessors.
ICPP (1) 1990: 67-71 |
| 1989 |
|---|
| 2 | EE | Lal George:
An Abstract Machine for Parallel Graph Reduction.
FPCA 1989: 214-229 |
| 1987 |
|---|
| 1 | | Gary Lindstrom,
Lal George,
Dowming Yeh:
Generating Efficient Code from Strictness Annotations.
TAPSOFT, Vol.2 1987: 140-154 |
