| 1998 |
|---|
| 10 | EE | 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: 197-204 |
| 9 | | Ian Barland,
Phokion G. Kolaitis,
Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability.
J. Comput. Syst. Sci. 57(2): 144-161 (1998) |
| 1996 |
|---|
| 8 | EE | Ian Barland,
Phokion G. Kolaitis,
Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability.
IEEE Conference on Computational Complexity 1996: 249-259 |
| 1995 |
|---|
| 7 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes.
J. Comput. Syst. Sci. 50(3): 391-411 (1995) |
| 6 | | Sanjeev Saluja,
K. V. Subrahmanyam,
Madhukar N. Thakur:
Descriptive Complexity of #P Functions.
J. Comput. Syst. Sci. 50(3): 493-505 (1995) |
| 1994 |
|---|
| 5 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Logical Definability of NP Optimization Problems
Inf. Comput. 115(2): 321-353 (1994) |
| 1993 |
|---|
| 4 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract).
Structure in Complexity Theory Conference 1993: 31-41 |
| 1992 |
|---|
| 3 | | Sanjeev Saluja,
K. V. Subrahmanyam,
Madhukar N. Thakur:
Descriptive Complexity of #P Functions.
Structure in Complexity Theory Conference 1992: 169-184 |
| 1991 |
|---|
| 2 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes.
Structure in Complexity Theory Conference 1991: 353-366 |
| 1987 |
|---|
| 1 | EE | Madhukar N. Thakur,
John Dinsmore:
Time representation based on knowledge partitioning (abstract only).
ACM Conference on Computer Science 1987: 414 |
