Chinmoy Dutta

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 9

Top Topics

Candidate Matches

Bipartite Graph Matching

Efficient Search

Top Venues

ACM Trans. Parallel Comput.

Math. Oper. Res.

Publications

Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley
Edge-Weighted Online Windowed Matching. Math. Oper. Res. 48 (2) (2023)
Chinmoy Dutta
When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing. AAAI (2021)
Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley
Edge Weighted Online Windowed Matching. EC (2019)
Chinmoy Dutta, Chris Sholley
Online Matching in a Ride-Sharing Platform. CoRR (2018)
Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley
Maximum Weight Online Matching with Deadlines. CoRR (2018)
Chinmoy Dutta
When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing. CoRR (2018)
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
How Hard is Computing Parity with Noisy Communications? CoRR (2015)
Chinmoy Dutta, Jaikumar Radhakrishnan
A Sampling Technique of Proving Lower Bounds for Noisy Computations. CoRR (2015)
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche
Coalescing-Branching Random Walks on Graphs. ACM Trans. Parallel Comput. 2 (3) (2015)
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola
Global Information Sharing under Network Dynamics. CoRR (2014)
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche
Coalescing-branching random walks on graphs. SPAA (2013)
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola
On the Complexity of Information Spreading in Dynamic Networks. SODA (2013)
Chinmoy Dutta, Jaikumar Radhakrishnan
More on a Problem of Zarankiewicz. ISAAC (2012)
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS (2012)
Chinmoy Dutta, Jaikumar Radhakrishnan
More on a Problem of Zarankiewicz CoRR (2012)
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs CoRR (2011)
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun
Information Spreading in Dynamic Networks CoRR (2011)
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
A tight lower bound for parity in noisy communication networks. SODA (2008)
Chinmoy Dutta, Jaikumar Radhakrishnan
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. FOCS (2008)
Chinmoy Dutta, Jaikumar Radhakrishnan
Tradeoffs in Depth-Two Superconcentrators. STACS (2006)