 | 2008 |
|---|
| 10 |       | Ivan D. Baev,
Rajmohan Rajaraman,
Chaitanya Swamy:
Approximation Algorithms for Data Placement Problems.
SIAM J. Comput. 38(4): 1411-1429 (2008) |
| 2006 |
|---|
| 9 | | Ivan D. Baev,
Richard E. Hank,
David H. Gross:
Prematerialization: reducing register pressure for free.
PACT 2006: 285-294 |
| 2002 |
|---|
| 8 | | Ivan D. Baev,
Waleed Meleis,
Alexandre E. Eichenberger:
An Experimental Study of Algorithms for Weighted Completion Time Scheduling.
Algorithmica 33(1): 34-51 (2002) |
| 7 | | Ivan D. Baev,
Waleed Meleis,
Alexandre E. Eichenberger:
Lower bounds on precedence-constrained scheduling for parallel processors.
Inf. Process. Lett. 83(1): 27-32 (2002) |
| 6 |  | Ivan D. Baev,
Waleed Meleis,
Santosh G. Abraham:
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots.
International Journal of Parallel Programming 30(6): 397-418 (2002) |
| 2001 |
|---|
| 5 | | Ivan D. Baev,
Rajmohan Rajaraman:
Approximation algorithms for data placement in arbitrary networks.
SODA 2001: 661-670 |
| 4 | | Waleed Meleis,
Alexandre E. Eichenberger,
Ivan D. Baev:
Scheduling Superblocks with Bound-Based Branch Trade-Offs.
IEEE Trans. Computers 50(8): 784-797 (2001) |
| 2000 |
|---|
| 3 | | Ivan D. Baev,
Waleed Meleis,
Alexandre E. Eichenberger:
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors.
ICPP 2000: 549-554 |
| 2 | | Santosh G. Abraham,
Waleed Meleis,
Ivan D. Baev:
Efficient Backtracking Instruction Schedulers.
IEEE PACT 2000: 301-308 |
| 1999 |
|---|
| 1 | | Ivan D. Baev,
Waleed Meleis,
Alexandre E. Eichenberger:
Algorithms for Total Weighted Completion Time Scheduling.
SODA 1999: 852-853 |
