Author of the publication

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.

, , , , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 4 (4): 561-571 (2007)

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.

No persons found for author name Dhamdhere, Kedar
add a person with the name Dhamdhere, Kedar
 

Other publications of authors with the same name

Relaxing Haplotype Block Models for Association Testing., , , and . Pacific Symposium on Biocomputing, page 454-466. World Scientific, (2006)Improved embeddings of graph metrics into random trees., , and . SODA, page 61-69. ACM Press, (2006)Approximation Algorithms for Minimizing Average Distortion., , and . Theory Comput. Syst., 39 (1): 93-111 (2006)Finding (Recently) Frequent Items in Distributed Data Streams., , , and . ICDE, page 767-778. IEEE Computer Society, (2005)Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice., , , , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 4 (4): 561-571 (2007)Metric Embeddings with Relaxed Guarantees., , , , , , , and . FOCS, page 83-100. IEEE Computer Society, (2005)How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems., , , and . FOCS, page 367-378. IEEE Computer Society, (2005)A New Interaction Index inspired by the Taylor Series., , and . CoRR, (2019)Approximating Additive Distortion of Embeddings into Line Metrics.. APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 96-104. Springer, (2004)How Important is a Neuron., , and . ICLR (Poster), OpenReview.net, (2019)