dblp.uni-trier.dewww.uni-trier.de

Ivan D. Baev Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
10EEIvan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy: Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4): 1411-1429 (2008)
2006
9EEIvan D. Baev, Richard E. Hank, David H. Gross: Prematerialization: reducing register pressure for free. PACT 2006: 285-294
2002
8EEIvan D. Baev, Waleed Meleis, Alexandre E. Eichenberger: An Experimental Study of Algorithms for Weighted Completion Time Scheduling. Algorithmica 33(1): 34-51 (2002)
7EEIvan 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
5EEIvan D. Baev, Rajmohan Rajaraman: Approximation algorithms for data placement in arbitrary networks. SODA 2001: 661-670
4EEWaleed Meleis, Alexandre E. Eichenberger, Ivan D. Baev: Scheduling Superblocks with Bound-Based Branch Trade-Offs. IEEE Trans. Computers 50(8): 784-797 (2001)
2000
3EEIvan D. Baev, Waleed Meleis, Alexandre E. Eichenberger: Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors. ICPP 2000: 549-554
2EESantosh G. Abraham, Waleed Meleis, Ivan D. Baev: Efficient Backtracking Instruction Schedulers. IEEE PACT 2000: 301-308
1999
1EEIvan D. Baev, Waleed Meleis, Alexandre E. Eichenberger: Algorithms for Total Weighted Completion Time Scheduling. SODA 1999: 852-853

Coauthor Index

1Santosh G. Abraham [2] [6]
2Alexandre E. Eichenberger [1] [3] [4] [7] [8]
3David H. Gross [9]
4Richard E. Hank [9]
5Waleed Meleis [1] [2] [3] [4] [6] [7] [8]
6Rajmohan Rajaraman [5] [10]
7Chaitanya Swamy [10]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)