The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Madhukar N. Thakur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002