Author

Stefano Leonardi

Created by ACM worker at 2019-04-10 08:43:39.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Renan de Padua's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

Minimizing the flow time without migration

Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines

Approximating total flow time on parallel machines

Published At

Journal of the ACM

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99

Co-Authors

Referenced By

Multi-processor scheduling to minimize flow time with ? resource augmentation

Scheduling jobs with varying parallelizability to reduce variance