Follow
Chinmoy Dutta
Chinmoy Dutta
Turing Research
Verified email at turingres.com - Homepage
Title
Cited by
Cited by
Year
Method and system for identifying users across mobile and desktop devices
C Dutta, S Kancha, J Li, W Lu, M Mahajan, S Pandey, X Qin, A Ranadive, ...
US Patent 10,423,985, 2019
1112019
On the complexity of information spreading in dynamic networks
C Dutta, G Pandurangan, R Rajaraman, Z Sun, E Viola
Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2013
842013
Edge weighted online windowed matching
I Ashlagi, M Burq, C Dutta, P Jaillet, A Saberi, C Sholley
Proceedings of the 20th ACM Conference on Economics and Computation, 729-742, 2019
802019
Unidirectional lookalike campaigns in a messaging platform
C Dutta, J Li, V Rastogi, W Lu, S Pandey, U Srivastava
US Patent 9,361,322, 2016
762016
A tight lower bound for parity in noisy communication networks
C Dutta, Y Kanoria, D Manjunath, J Radhakrishnan
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2008
492008
Maximum weight online matching with deadlines
I Ashlagi, M Burq, C Dutta, P Jaillet, A Saberi, C Sholley
arXiv preprint arXiv:1808.03526, 2018
292018
Selecting keywords representative of a document
AA Nanavati, C Dutta
US Patent 7,856,435, 2010
23*2010
Coalescing-branching random walks on graphs
C Dutta, G Pandurangan, R Rajaraman, S Roche
ACM Transactions on Parallel Computing (TOPC) 2 (3), 1-29, 2015
172015
Information spreading in dynamic networks
C Dutta, G Pandurangan, R Rajaraman, Z Sun
arXiv preprint arXiv:1112.0384, 2011
152011
Ontology-based term disambiguation
A Nanavati, C Dutta
US Patent App. 10/955,255, 2006
142006
Split and join: Strong partitions and universal steiner trees for graphs
C Busch, C Dutta, J Radhakrishnan, R Rajaraman, S Srinivasagopalan
Proceedings of the 53rd IEEE Annual Symposium on Foundations of Computer …, 2012
122012
Assigning rides based on probability of provider acceptance
C Dutta, A Greenhall, C Sholley, J Young, J Chopra
US Patent 11,158,020, 2021
112021
When Hashing Met Matching: Efficient spatio-temporal search for ridesharing
C Dutta
Proceedings of the 35th AAAI Conference on Artificial Intelligence, 2021
11*2021
Lower bounds for noisy wireless networks using sampling algorithms
C Dutta, J Radhakrishnan
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer …, 2008
102008
Online matching in a ride-sharing platform
C Dutta, C Sholley
Marketplace Innovation Workshop, 2017
92017
Capacity of ad hoc wireless networks
A Agarwal, C Dutta, D Sanghi
Proc. 7th Annu. Int. Conf. Mobile Comput. Netw, 61-69, 2002
42002
More on a problem of Zarankiewicz
C Dutta, J Radhakrishnan
Proceedings of the 23rd International Symposium on Algorithms and …, 2012
3*2012
Tradeoffs in depth-two superconcentrators
C Dutta, J Radhakrishnan
Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer …, 2006
32006
Method and system for identifying users across mobile and desktop devices
C Dutta, S Kancha, J Li, W Lu, M Mahajan, S Pandey, X Qin, A Ranadive, ...
US Patent 10,861,055, 2020
22020
Lower Bounds for Noisy Computations
C Dutta
Mumbai, 2009
22009
The system can't perform the operation now. Try again later.
Articles 1–20