( en | de | ru )

 

Disambiguation of "Dhamdhere, Kedar"

Author of the publication

copydeleteadd this publication to your clipboard
On Two-Stage Stochastic Minimum Spanning Trees.

, , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jayalakshmi Kedarisetti

Kedar Shrikant Ranade

Kedar Nath Prasad Sinha

 

Other publications of authors with the same name

Approximation Algorithms for Minimizing Average Distortion., , and . Theory Comput. Syst., 39 (1): 93-111 (2006)How Important is a Neuron., , and . ICLR (Poster), OpenReview.net, (2019)A New Interaction Index inspired by the Taylor Series., , and . CoRR, (2019)The Shapley Taylor Interaction Index., , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 9259-9268. PMLR, (2020)Did the Model Understand the Question?, , , and . ACL (1), page 1896-1906. Association for Computational Linguistics, (2018)Approximating Additive Distortion of Embeddings into Line Metrics.. APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 96-104. Springer, (2004)How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems., , , and . FOCS, page 367-378. IEEE Computer Society, (2005)Finding (Recently) Frequent Items in Distributed Data Streams., , , and . ICDE, page 767-778. IEEE Computer Society, (2005)On Two-Stage Stochastic Minimum Spanning Trees., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)Minimizing weighted flow time., and . SODA, page 508-516. ACM/SIAM, (2003)