#### Filter Results:

- Full text PDF available (129)

#### Publication Year

1963

2018

- This year (10)
- Last 5 years (54)
- Last 10 years (114)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
- ICDT
- 2001

With the proliferation of database views and curated databases, the issue of data provenance { where a piece of data came from and the process by which it arrived in the database { is becoming… (More)

- Michael B. Greenwald, Sanjeev Khanna
- SIGMOD Conference
- 2001

An ∈-approximate quantile summary of a sequence of <i>N</i> elements is a data structure that can answer quantile queries about the sequence to within a precision of ∈<i>N</i>.
We present… (More)

- Chandra Chekuri, Sanjeev Khanna
- SODA
- 1999

We study the approximability of multi-dimensional generalizations of the classical problems of multiprocessor scheduling, bin packing and the knapsack problem. Specifically, we study the vector… (More)

- Foto N. Afrati, Evripidis Bampis, +8 authors Maxim Sviridenko
- FOCS
- 1999

We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation… (More)

Many fundamental combinatorial problems can be formulated as Boolean constraint satisfaction problems. Roughly speaking, an instance of such a problem consists of a collection of simple constraints… (More)

- Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson
- SIAM J. Comput.
- 2000

We study optimization problems that may be expressed as “Boolean constraint satisfaction problems.” An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n… (More)

- Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
- FOCS
- 1994

We attempt to reconcile the two distinct views of approximationclasses: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems,… (More)

- Michael B. Greenwald, Sanjeev Khanna
- PODS
- 2004

We study the problem of power-conserving computation of order statistics in sensor networks. Significant power-reducing optimizations have been devised for computing simple aggregate queries such as… (More)

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths problem (EDP), we are given a network G with source-sink pairs (si,ti), 1 ≤ i ≤ k, and the goal is… (More)

- Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
- PODS
- 2002

We study two classes of view update problems in relational databases. We are given a source database <i>S</i>, a monotone query <i>Q</i>, and the view <i>Q</i>(<i>S</i>) generated by the query. The… (More)