Publications 

Chinmoy Dutta
2018

Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley
2018

Chinmoy Dutta and Chris Sholley
2018

Coalescing Branching Random Walks on Graphs
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman and Scott Roche
ACM Transactions on Parallel Computing (TOPC) 2015
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun and Emanuele Viola
ACM-SIAM SODA 2013


Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman and Srivathsan Srinivasagopalan
IEEE FOCS 2012


More on a Problem of Zarankiewicz
Chinmoy Dutta and Jaikumar Radhakrishnan
ISAAC 2012


Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
Chinmoy Dutta and Jaikumar Radhakrishnan
IEEE FOCS 2008


A Tight Bound for Parity in Noisy Communication Networks
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath and Jaikumar Radhakrishnan
ACM-SIAM SODA 2008


Tradeoffs in Depth-Two Superconcentrators
Chinmoy Dutta and Jaikumar Radhakrishnan
STACS 2006


Enhancing Bandwidth Utilization in Bluetooth using Optimal SAR
Ashish Agarwal, Chinmoy Dutta and Dheeraj Sanghi
ICCC 2002 

Patents 

Unidirectional Lookalike Campaigns in a Messaging Platform 
Chinmoy Dutta with multiple co-authors
US Patent # 
US 9 361 322; Assignee: Twitter, Inc., San Francisco, CA; Issued: Jun 07 2016 

Selecting Keywords Representative of a Document 
Chinmoy Dutta and Amit A. Nanavati 
US Patent # 7 856 435; Assignee: IBM Corporation, Armonk NY; Issued: Dec 21 2010 


Ontology-Based Term Disambiguation 
Chinmoy Dutta and Amit A. Nanavati 
US Patent Application # 10/955255; Petitioner: IBM Corporation, Armonk NY 

Ph.D. Dissertation 

Lower bounds for Noisy Computations 
Tata Institute of Fundamental Research, 2009 
TAA Sasken Best Thesis Award


Others

Tradeoffs in Depth-Two Superconcentrators
Chinmoy Dutta
Masters thesis, TIFR Mumbai, 2005


Capacity of Ad-Hoc Wireless Networks
Ashish Agarwal and Chinmoy Dutta
B. Tech Project Report, IIT Kanpur, 2002