Ivan D. Baev

Algorithms for total weighted completion time scheduling

Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev, 1999, SODA '99.

Techniques for Region-Based Register Allocation

Ivan D. Baev, 2009, 2009 International Symposium on Code Generation and Optimization.

Efficient backtracking instruction schedulers

Waleed Meleis, Santosh G. Abraham, Ivan D. Baev, 2000, Proceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622).

Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots

Waleed Meleis, Santosh G. Abraham, Ivan D. Baev, 2004, International Journal of Parallel Programming.

Approximation Algorithms for Data Placement Problems

Chaitanya Swamy, Rajmohan Rajaraman, Ivan D. Baev, 2008, SIAM J. Comput..

Lower bounds on precedence-constrained scheduling for parallel processors

Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev, 2002, Inf. Process. Lett..

Prematerialization: Reducing register pressure for free

Richard E. Hank, Ivan D. Baev, David H. Gross, 2006, 2006 International Conference on Parallel Architectures and Compilation Techniques (PACT).

Lower bounds on precedence-constrained scheduling for parallel processors

Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev, 2000, Proceedings 2000 International Conference on Parallel Processing.

Approximation algorithms for data placement in arbitrary networks

Rajmohan Rajaraman, Ivan D. Baev, R. Rajaraman, 2001, SODA '01.

Scheduling Superblocks with Bound-Based Branch Trade-Offs

Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev, 2001, IEEE Trans. Computers.

An Experimental Study of Algorithms for Weighted Completion Time Scheduling

Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev, 2002, Algorithmica.