|
Search the dblp DataBase
Madhukar N. Thakur:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Madhukar N. Thakur, John Dinsmore
Time representation based on knowledge partitioning (abstract only). [Citation Graph (0, 0)][DBLP] ACM Conference on Computer Science, 1987, pp:414- [Conf]
- Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
Integer Programming as a Framework for Optimization and Approximability. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:249-259 [Conf]
- Phokion G. Kolaitis, Madhukar N. Thakur
Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:353-366 [Conf]
- Phokion G. Kolaitis, Madhukar N. Thakur
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:31-41 [Conf]
- Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:169-184 [Conf]
- Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. [Citation Graph (0, 12)][DBLP] PODS, 1998, pp:197-204 [Conf]
- Phokion G. Kolaitis, Madhukar N. Thakur
Logical Definability of NP Optimization Problems [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:115, n:2, pp:321-353 [Journal]
- Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
Integer Programming as a Framework for Optimization and Approximability. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1998, v:57, n:2, pp:144-161 [Journal]
- Phokion G. Kolaitis, Madhukar N. Thakur
Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:50, n:3, pp:391-411 [Journal]
- Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:50, n:3, pp:493-505 [Journal]
Search in 0.001secs, Finished in 0.002secs
|