Ivan D. Baev

11 papers A* 2A 1B 2Journal 5Unranked 1
YearRankTypeTitle / Venue / Authors
2009 A conf
Techniques for Region-Based Register Allocation.
CGO
Ivan D. Baev
2008 J jnl
Approximation Algorithms for Data Placement Problems.
SIAM J. Comput.
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
2006 B conf
Prematerialization: reducing register pressure for free.
PACT
Ivan D. Baev, Richard E. Hank, David H. Gross
2002 J jnl
An Experimental Study of Algorithms for Weighted Completion Time Scheduling.
Algorithmica
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
2002 J jnl
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots.
Int. J. Parallel Program.
Ivan D. Baev, Waleed Meleis, Santosh G. Abraham
2002 J jnl
Lower bounds on precedence-constrained scheduling for parallel processors.
Inf. Process. Lett.
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
2001 A* conf
Approximation algorithms for data placement in arbitrary networks.
SODA
Ivan D. Baev, Rajmohan Rajaraman
2001 J jnl
Scheduling Superblocks with Bound-Based Branch Trade-Offs.
IEEE Trans. Computers
Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev
2000 — conf
Efficient Backtracking Instruction Schedulers.
IEEE PACT
Santosh G. Abraham, Waleed Meleis, Ivan D. Baev
2000 B conf
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors.
ICPP
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
1999 A* conf
Algorithms for Total Weighted Completion Time Scheduling.
SODA
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger