The SCEAS System
| |||||||

## Search the dblp DataBase
Kedar Dhamdhere:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kedar Dhamdhere
**Approximating Additive Distortion of Embeddings into Line Metrics.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:96-104 [Conf] - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere
**Scheduling for Flow-Time with Admission Control.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:43-54 [Conf] - Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins
**Metric Embeddings with Relaxed Guarantees.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:83-100 [Conf] - Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh
**How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:367-378 [Conf] - Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar
**Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:667-678 [Conf] - Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz
**Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (2), 2006, pp:799-806 [Conf] - Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston
**Finding (Recently) Frequent Items in Distributed Data Streams.**[Citation Graph (0, 0)][DBLP] ICDE, 2005, pp:767-778 [Conf] - Kedar Dhamdhere, R. Ravi, Mohit Singh
**On Two-Stage Stochastic Minimum Spanning Trees.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:321-334 [Conf] - Natalie Castellana, Kedar Dhamdhere, Srinath Sridhar, Russell Schwartz
**Relaxing Haplotype Block Models for Association Testing.**[Citation Graph (0, 0)][DBLP] Pacific Symposium on Biocomputing, 2006, pp:454-466 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:119-128 [Conf] - Nikhil Bansal, Kedar Dhamdhere
**Minimizing weighted flow time.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:508-516 [Conf] - Kedar Dhamdhere, Anupam Gupta, Harald Räcke
**Improved embeddings of graph metrics into random trees.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:61-69 [Conf] - Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
**Non-clairvoyant Scheduling for Minimizing Mean Slowdown.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:260-270 [Conf] - Kedar Dhamdhere, Anupam Gupta, R. Ravi
**Approximation Algorithms for Minimizing Average Distortion.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:234-245 [Conf] - Sandeep Pandey, Kedar Dhamdhere, Christopher Olston
**WIC: A General-Purpose Algorithm for Monitoring Web Information Sources.**[Citation Graph (0, 0)][DBLP] VLDB, 2004, pp:360-371 [Conf] - Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
**Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:4, pp:305-318 [Journal] - Kedar Dhamdhere, Anupam Gupta, R. Ravi
**Approximation Algorithms for Minimizing Average Distortion.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:93-111 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |