 |
|
Online DBLP entries are available for Chandra Chekuri and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Moses Charikar
,
Chandra Chekuri,
Ashish Goel
,
Sudipto Guha
:
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and
k
-Median.
STOC 1998
: 114-123
-
Narayanan Shivakumar
,
Hector Garcia-Molina
,
Chandra Chekuri:
Filtering with Approximate Predicates.
VLDB 1998
: 263-274
- Chandra Chekuri,
Anand Rajaraman
:
Conjunctive Query Containment Revisited.
ICDT 1997
: 56-70
-
Moses Charikar
,
Chandra Chekuri,
Tomás Feder
,
Rajeev Motwani
:
Incremental Clustering and Dynamic Information Retrieval.
STOC 1997
: 626-635
-
D. Aingworth
,
Chandra Chekuri,
Rajeev Motwani
:
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication).
SODA 1996
: 547-553
- Chandra Chekuri,
Waqar Hasan
,
Rajeev Motwani
:
Scheduling Problems in Parallel Query Optimization.
PODS 1995
: 255-265
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
