Tradeoffs in Depth-Two Superconcentrators. - Chinmoy Dutta; Jaikumar Radhakrishnan (STACS, 2006)

Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. - Chinmoy Dutta; Jaikumar Radhakrishnan (FOCS, 2008)

A tight lower bound for parity in noisy communication networks. - Chinmoy Dutta; Yashodhan Kanoria; D. Manjunath; Jaikumar Radhakrishnan (SODA, 2008)

Information Spreading in Dynamic Networks - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Zhifeng Sun (CoRR, 2011)

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

More on a Problem of Zarankiewicz. - Chinmoy Dutta; Jaikumar Radhakrishnan (ISAAC, 2012)

On the Complexity of Information Spreading in Dynamic Networks. - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Zhifeng Sun; Emanuele Viola (SODA, 2013)

Global Information Sharing under Network Dynamics. - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Zhifeng Sun; Emanuele Viola (CoRR, 2014)

How Hard is Computing Parity with Noisy Communications? - Chinmoy Dutta; Yashodhan Kanoria; D. Manjunath; Jaikumar Radhakrishnan (CoRR, 2015)

A Sampling Technique of Proving Lower Bounds for Noisy Computations. - Chinmoy Dutta; Jaikumar Radhakrishnan (CoRR, 2015)

Coalescing-Branching Random Walks on Graphs. - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Scott T. Roche (ACM Trans. Parallel Comput., 2015)

Online Matching in a Ride-Sharing Platform. - Chinmoy Dutta; Chris Sholley (CoRR, 2018)

Maximum Weight Online Matching with Deadlines. - Itai Ashlagi; Maximilien Burq; Chinmoy Dutta; Patrick Jaillet; Amin Saberi; Chris Sholley (CoRR, 2018)

When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing. - Chinmoy Dutta (CoRR, 2018)

When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing. - Chinmoy Dutta (AAAI, 2021)

Edge-Weighted Online Windowed Matching. - Itai Ashlagi; Maximilien Burq; Chinmoy Dutta; Patrick Jaillet; Amin Saberi; Chris Sholley (Math. Oper. Res., 2023)