Madhukar N. Thakur

Publication Activity (10 Years)

Years Active: 1987-1998
Publications (10 Years): 0

Publications

Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. PODS (1998)
Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
Integer Programming as a Framework for Optimization and Approximability. J. Comput. Syst. Sci. 57 (2) (1998)
Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
Integer Programming as a Framework for Optimization and Approximability. Computational Complexity Conference (1996)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50 (3) (1995)
Phokion G. Kolaitis, Madhukar N. Thakur
Approximation Properties of NP Minimization Classes. J. Comput. Syst. Sci. 50 (3) (1995)
Phokion G. Kolaitis, Madhukar N. Thakur
Logical Definability of NP Optimization Problems Inf. Comput. 115 (2) (1994)
Darrell D. E. Long, Madhukar N. Thakur
Scheduling real-time disk transfers for continuous media applications. MSS (1993)
Phokion G. Kolaitis, Madhukar N. Thakur
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). Computational Complexity Conference (1993)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. Computational Complexity Conference (1992)
Phokion G. Kolaitis, Madhukar N. Thakur
Approximation Properties of NP Minimization Classes. Computational Complexity Conference (1991)
Madhukar N. Thakur, John Dinsmore
Time representation based on knowledge partitioning (abstract only). ACM Conference on Computer Science (1987)