Madhukar N. Thakur

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