|
Search the dblp DataBase
Ivan D. Baev:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Santosh G. Abraham, Waleed Meleis, Ivan D. Baev
Efficient Backtracking Instruction Schedulers. [Citation Graph (0, 0)][DBLP] IEEE PACT, 2000, pp:301-308 [Conf]
- Ivan D. Baev, Richard E. Hank, David H. Gross
Prematerialization: reducing register pressure for free. [Citation Graph (0, 0)][DBLP] PACT, 2006, pp:285-294 [Conf]
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors. [Citation Graph (0, 0)][DBLP] ICPP, 2000, pp:549-554 [Conf]
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
Algorithms for Total Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:852-853 [Conf]
- Ivan D. Baev, Rajmohan Rajaraman
Approximation algorithms for data placement in arbitrary networks. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:661-670 [Conf]
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
An Experimental Study of Algorithms for Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:33, n:1, pp:34-51 [Journal]
- Ivan D. Baev, Waleed Meleis, Santosh G. Abraham
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots. [Citation Graph (0, 0)][DBLP] International Journal of Parallel Programming, 2002, v:30, n:6, pp:397-418 [Journal]
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
Lower bounds on precedence-constrained scheduling for parallel processors. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:27-32 [Journal]
- Waleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev
Scheduling Superblocks with Bound-Based Branch Trade-Offs. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 2001, v:50, n:8, pp:784-797 [Journal]
Techniques for Region-Based Register Allocation. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
|