| Logical definability of NP optimization problems PG Kolaitis, MN Thakur Information and Computation 115 (2), 321-353, 1994 | 143 | 1994 |
| Approximation properties of NP minimization classes PG Kolaitis, MN Thakur Journal of Computer and System Sciences 50 (3), 391-411, 1995 | 142* | 1995 |
| Descriptive complexity of# P functions S Saluja, KV Subrahmanyam, MN Thakur Journal of Computer and System Sciences 50 (3), 493-505, 1995 | 69 | 1995 |
| On the complexity of the containment problem for conjunctive queries with built-in predicates PG Kolaitis, DL Martin, MN Thakur Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1998 | 57 | 1998 |
| Scheduling real-time disk transfers for continuous media applications DDE Long, MN Thakur [1993] Proceedings Twelfth IEEE Symposium on Mass Storage systems, 227-232, 1993 | 26 | 1993 |
| Integer programming as a framework for optimization and approximability I Barland, PG Kolaitis, MN Thakur Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996 | 9 | 1996 |
| Integer programming as a framework for optimization and approximability I Barland, PG Kolaitis, MN Thakur Journal of Computer and System Sciences 57 (2), 144-161, 1998 | 6 | 1998 |
| Polynomial-time optimization, parallel approximation, and fixpoint logic P Kolaitis, MN Thakur [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993 | 5 | 1993 |
| Descriptive complexity of optimization and counting problems MN Thakur University of California, Santa Cruz, 1992 | 1 | 1992 |
| Article No. SS981607 E Bach, I Barland, P Beame, A Bonner, SR Buss, JY Cai, H Caussinus, ... Journal of Computer and System Sciences 57, 402, 1998 | | 1998 |
| Descriptive Complexity of f P Functions MN THAKUR | | 1995 |
| Descriptive complexity of Hash P functions S Saluja, KV Subrahmanyam, MN Thakur 1992 Seventh Annual Structure in Complexity Theory Conference, 169,170,171 …, 1992 | | 1992 |
David MartinUniversity of California, Santa CruzVerified email at ucsc.edu
