Madhukar N. Thakur

According to our database, Madhukar N. Thakur authored at least 8 papers between 1987 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates.

Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1996

Integer Programming as a Framework for Optimization and Approximability.

Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1994

Logical Definability of NP Optimization Problems

Phokion G. Kolaitis, Madhukar N. Thakur

Inf. Comput., December, 1994

1993

Scheduling real-time disk transfers for continuous media applications.

Darrell D. E. Long, Madhukar N. Thakur

Proceedings of the Twelfth IEEE Symposium on Mass Storage Systems, 1993

Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract).

Phokion G. Kolaitis, Madhukar N. Thakur

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Descriptive Complexity of #P Functions.

Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Approximation Properties of NP Minimization Classes.

Phokion G. Kolaitis, Madhukar N. Thakur

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1987

Time representation based on knowledge partitioning (abstract only).

Madhukar N. Thakur, John Dinsmore

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987