| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Kedar Dhamdhere 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 Kedar Dhamdhere, Anupam Gupta , Harald Räcke : Improved embeddings of graph metrics into random trees. SODA 2006 : 61-69 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 Ittai Abraham , Yair Bartal , Hubert T.-H. Chan , Kedar Dhamdhere, Anupam Gupta , Jon M. Kleinberg , Ofer Neiman , Aleksandrs Slivkins : Metric Embeddings with Relaxed Guarantees. FOCS 2005 : 83-100 Amit Manjhi , Vladislav Shkapenyuk , Kedar Dhamdhere, Christopher Olston : Finding (Recently) Frequent Items in Distributed Data Streams. ICDE 2005 : 767-778 Kedar Dhamdhere, R. Ravi , Mohit Singh : On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005 : 321-334 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 Kedar Dhamdhere: Approximating Additive Distortion of Embeddings into Line Metrics. APPROX-RANDOM 2004 : 96-104 Kedar Dhamdhere, Anupam Gupta , R. Ravi : Approximation Algorithms for Minimizing Average Distortion. STACS 2004 : 234-245 Sandeep Pandey , Kedar Dhamdhere, Christopher Olston : WIC: A General-Purpose Algorithm for Monitoring Web Information Sources. VLDB 2004 : 360-371 Nikhil Bansal , Kedar Dhamdhere, Jochen Könemann , Amitabh Sinha : Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40 (4): 305-318 (2004) Nikhil Bansal , Avrim Blum , Shuchi Chawla , Kedar Dhamdhere: Scheduling for Flow-Time with Admission Control. ESA 2003 : 43-54 Nikhil Bansal , Kedar Dhamdhere: Minimizing weighted flow time. SODA 2003 : 508-516 Nikhil Bansal , Kedar Dhamdhere, Jochen Könemann , Amitabh Sinha : Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003 : 260-270 1 [ 11 ] 2 [ 8 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] 4 [ 11 ] 5 [ 14 ] 6 [ 3 ] 7 [ 11 ] 8 [ 3 ] 9 [ 12 ] 10 [ 6 ] [ 8 ] [ 11 ] [ 13 ] 11 [ 14 ] 12 [ 11 ] 13 [ 1 ] [ 4 ] 14 [ 10 ] 15 [ 11 ] 16 [ 5 ] [ 10 ] 17 [ 5 ] 18 [ 8 ] 19 [ 8 ] [ 13 ] 20 [ 6 ] [ 8 ] [ 9 ] [ 12 ] [ 14 ] 21 [ 14 ] 22 [ 10 ] 23 [ 8 ] 24 [ 9 ] [ 12 ] 25 [ 1 ] [ 4 ] 26 [ 11 ] 27 [ 14 ]  ©2006 Association for Computing Machinery |
