Kedar Dhamdhere - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2020

The Shapley Taylor Interaction IndexMukund Sundararajan, Kedar Dhamdhere, Ashish Agarwal. icml 2020: 9259-9268 [doi]

2019

How Important is a NeuronKedar Dhamdhere, Mukund Sundararajan, Qiqi Yan. iclr 2019: [doi]

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional SpacesAnastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi 0001. siamdm, 33(1):454-473, 2019. [doi]

2018

Did the Model Understand the Question?Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere. acl 2018: 1896-1906 [doi]

2017

Analyza: Exploring Data with ConversationKedar Dhamdhere, Kevin S. McCurley, Ralfi Nahmias, Mukund Sundararajan, Qiqi Yan. IUI 2017: 493-504 [doi]

2009

Metric Embeddings with Relaxed GuaranteesT.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins. SICOMP, 38(6):2303-2329, 2009. [doi]

2007

Minimizing weighted flow timeNikhil Bansal, Kedar Dhamdhere. TALG, 3(4):39, 2007. [doi]

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and PracticeSrinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz. tcbb, 4(4):561-571, 2007. [doi]

2006

2005

Metric Embeddings with Relaxed GuaranteesIttai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins. focs 2005: 83-100 [doi]

Approximation algorithms for low-distortion embeddings into low-dimensional spacesMihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos. soda 2005: 119-128 [doi]

On Two-Stage Stochastic Minimum Spanning TreesKedar Dhamdhere, R. Ravi, Mohit Singh. ipco 2005: 321-334 [doi]

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering ProblemsKedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh. focs 2005: 367-378 [doi]

Finding (Recently) Frequent Items in Distributed Data StreamsAmit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston. icde 2005: 767-778 [doi]

2004

2003

Minimizing weighted flow timeNikhil Bansal, Kedar Dhamdhere. soda 2003: 508-516 [doi]

Non-clairvoyant Scheduling for Minimizing Mean SlowdownNikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha. STACS 2003: 260-270 [doi]

Scheduling for Flow-Time with Admission ControlNikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere. esa 2003: 43-54 [doi]

Sign in or sign up to see more results.

runs on WebDSL