Alexandre E. Eichenberger

Baev, I. D., Meleis, W. M., & Eichenberger, A. (2002). An experimental study of algorithms for weighted completion time scheduling. ALGORITHMICA, 33(1), 34–51. https://doi.org/10.1007/s00453-001-0103-x

Baev, I. D., Meleis, W. M., & Eichenberger, A. (2002). Lower bounds on precedence-constrained scheduling for parallel processors. INFORMATION PROCESSING LETTERS, 83(1), 27–32. https://doi.org/10.1016/S0020-0190(01)00303-9

Meleis, W. M., Eichenberger, A. E., & Baev, I. D. (2001). Scheduling superblocks with bound-based branch trade-offs. IEEE Transactions on Computers, 50(8), 784–797. https://doi.org/10.1109/12.946999

Eichenberger, A. E., & Davidson, E. S. (1997, May). Efficient formulation for optimal module schedulers. ACM SIGPLAN NOTICES, Vol. 32, pp. 194–205. https://doi.org/10.1145/258916.258933