Kedar Dhamdhere Papers on DiSC'04 WIC: A General-Purpose Algorithm for Monitoring Web Information Sources Publications Note: Links lead to the DBLP on the Web. Kedar Dhamdhere 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 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 II : 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 II : Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003 : 260-270 1 [ 1 ] [ 2 ] [ 3 ] [ 4 ] 2 [ 3 ] 3 [ 3 ] 4 [ 6 ] 5 [ 1 ] [ 4 ] 6 [ 9 ] 7 [ 5 ] [ 9 ] 8 [ 5 ] 9 [ 6 ] [ 8 ] 10 [ 9 ] 11 [ 8 ] 12 [ 1 ] [ 4 ] ©2005 Association for Computing Machinery