Author

Sanjeev Khanna

Created by Alysson Bolognesi Prado at 2019-03-27 14:43:38.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Joao Crisóstomo Weyl Albuquerque Costa'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

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

Approximation schemes for preemptive weighted flow time

Algorithms for minimizing weighted flow time

Space-efficient online computation of quantile summaries

Perfect matchings in o(nlogn) time in regular bipartite graphs

A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

Published At

Proceedings of the 42nd ACM symposium on Theory of computing - STOC ’10

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 2001 ACM SIGMOD international conference on Management of data - SIGMOD ’01

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02

Co-Authors

Referenced By

Random sampling and approximation of MAX-CSP problems

Spatially-decaying aggregation over a network

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

A near-linear time ?-approximation algorithm for geometric bipartite matching

A new approach to computing maximum flows using electrical flows