Chinmoy Dutta

According to our database, Chinmoy Dutta authored at least 16 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Edge-Weighted Online Windowed Matching.

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

Math. Oper. Res., May, 2023

2021

When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing.

Chinmoy Dutta

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2018

When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing.

Chinmoy Dutta

CoRR, 2018

Maximum Weight Online Matching with Deadlines.

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

CoRR, 2018

Online Matching in a Ride-Sharing Platform.

Chinmoy Dutta, Chris Sholley

CoRR, 2018

2015

Coalescing-Branching Random Walks on Graphs.

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche

ACM Trans. Parallel Comput., 2015

A Sampling Technique of Proving Lower Bounds for Noisy Computations.

Chinmoy Dutta, Jaikumar Radhakrishnan

CoRR, 2015

How Hard is Computing Parity with Noisy Communications?

Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan

CoRR, 2015

2014

Global Information Sharing under Network Dynamics.

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola

CoRR, 2014

2013

On the Complexity of Information Spreading in Dynamic Networks.

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

More on a Problem of Zarankiewicz.

Chinmoy Dutta, Jaikumar Radhakrishnan

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs.

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Information Spreading in Dynamic Networks

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun

CoRR, 2011

2008

A tight lower bound for parity in noisy communication networks.

Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Lower Bounds for Noisy Wireless Networks using Sampling Algorithms.

Chinmoy Dutta, Jaikumar Radhakrishnan

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006

Tradeoffs in Depth-Two Superconcentrators.

Chinmoy Dutta, Jaikumar Radhakrishnan

Proceedings of the STACS 2006, 2006