default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKedar Dhamdhere
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c19]Mukund Sundararajan, Kedar Dhamdhere, Ashish Agarwal:
The Shapley Taylor Interaction Index. ICML 2020: 9259-9268
2010 – 2019
- 2019
- [j6]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - [c18]Kedar Dhamdhere, Mukund Sundararajan, Qiqi Yan:
How Important is a Neuron. ICLR (Poster) 2019 - [i5]Ashish Agarwal, Kedar Dhamdhere, Mukund Sundararajan:
A New Interaction Index inspired by the Taylor Series. CoRR abs/1902.05622 (2019) - 2018
- [c17]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
Did the Model Understand the Question? ACL (1) 2018: 1896-1906 - [i4]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
It was the training data pruning too! CoRR abs/1803.04579 (2018) - [i3]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
Did the Model Understand the Question? CoRR abs/1805.05492 (2018) - [i2]Kedar Dhamdhere, Mukund Sundararajan, Qiqi Yan:
How Important Is a Neuron? CoRR abs/1805.12233 (2018) - 2017
- [c16]Kedar Dhamdhere, Kevin S. McCurley
, Ralfi Nahmias, Mukund Sundararajan, Qiqi Yan:
Analyza: Exploring Data with Conversation. IUI 2017: 493-504 - [i1]Kedar Dhamdhere, Kevin S. McCurley, Mukund Sundararajan, Ankur Taly:
Abductive Matching in Question Answering. CoRR abs/1709.03036 (2017)
2000 – 2009
- 2009
- [j5]T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009) - 2007
- [j4]Nikhil Bansal, Kedar Dhamdhere:
Minimizing weighted flow time. ACM Trans. Algorithms 3(4): 39 (2007) - [j3]Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz:
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 561-571 (2007) - 2006
- [j2]Kedar Dhamdhere, Anupam Gupta, R. Ravi:
Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006) - [c15]Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar:
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) 2006: 667-678 - [c14]Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz:
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. International Conference on Computational Science (2) 2006: 799-806 - [c13]Natalie Castellana, Kedar Dhamdhere, Srinath Sridhar, Russell Schwartz:
Relaxing Haplotype Block Models for Association Testing. Pacific Symposium on Biocomputing 2006: 454-466 - [c12]Kedar Dhamdhere, Anupam Gupta, Harald Räcke:
Improved embeddings of graph metrics into random trees. SODA 2006: 61-69 - 2005
- [c11]Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100 - [c10]Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh:
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. FOCS 2005: 367-378 - [c9]Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston:
Finding (Recently) Frequent Items in Distributed Data Streams. ICDE 2005: 767-778 - [c8]Kedar Dhamdhere, R. Ravi, Mohit Singh:
On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334 - [c7]Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos:
Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128 - 2004
- [j1]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004) - [c6]Kedar Dhamdhere:
Approximating Additive Distortion of Embeddings into Line Metrics. APPROX-RANDOM 2004: 96-104 - [c5]Kedar Dhamdhere, Anupam Gupta, R. Ravi:
Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245 - [c4]Sandeep Pandey, Kedar Dhamdhere, Christopher Olston:
WIC: A General-Purpose Algorithm for Monitoring Web Information Sources. VLDB 2004: 360-371 - 2003
- [c3]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere:
Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54 - [c2]Nikhil Bansal, Kedar Dhamdhere:
Minimizing weighted flow time. SODA 2003: 508-516 - [c1]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
