List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Approximation Algorithms for Data Placement Problems SIAM Journal on Computing | 2009-08-20 | Paper |
| Backtracking-based instruction scheduling to fill branch delay slots International Journal of Parallel Programming | 2003-05-06 | Paper |
| Lower bounds on precedence-constrained scheduling for parallel processors. Information Processing Letters | 2003-01-21 | Paper |
| An experimental study of algorithms for weighted completion time scheduling Algorithmica | 2002-06-17 | Paper |
| Approximation algorithms for data placement in arbitrary networks | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1305485 (Why is no real title available?) | 1999-01-01 | Paper |
Research outcomes over time
This page was built for person: Ivan D. Baev
