Author

Ashish Goel

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

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Edson Pacheco Paladini'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

Efficient distributed locality sensitive hashing

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

Published At

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

Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM ’12

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

Co-Authors

Referenced By

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

A new approach to computing maximum flows using electrical flows