| An XOR-based erasure-resilient coding scheme J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman | 543 | 1995 |
| Polynomial time approximation schemes for dense instances of NP-hard problems S Arora, D Karger, M Karpinski Journal of computer and system sciences 58 (1), 193-210, 1999 | 507 | 1999 |
| A compendium of NP optimization problems P Crescenzi, V Kann, M Halldórsson | 504 | 1995 |
| Resolution for quantified Boolean formulas HK Buning, M Karpinski, A Flogel Information and computation 117 (1), 12-18, 1995 | 397 | 1995 |
| On some tighter inapproximability results P Berman, M Karpinski International Colloquium on Automata, Languages, and Programming, 200-209, 1999 | 373 | 1999 |
| New approximation algorithms for the Steiner tree problems M Karpinski, A Zelikovsky Journal of Combinatorial Optimization 1 (1), 47-65, 1997 | 239 | 1997 |
| Learning read-once formulas with queries D Angluin, L Hellerstein, M Karpinski Journal of the ACM (JACM) 40 (1), 185-210, 1993 | 236 | 1993 |
| 1.375-approximation algorithm for sorting by reversals P Berman, S Hannenhalli, M Karpinski European Symposium on Algorithms, 200-210, 2002 | 227 | 2002 |
| Approximation schemes for clustering problems WF De La Vega, M Karpinski, C Kenyon, Y Rabani Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 183 | 2003 |
| Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks M Karpinski, A Macintyre Journal of Computer and System Sciences 54 (1), 169-176, 1997 | 181 | 1997 |
| Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields DY Grigoriev, M Karpinski, MF Singer SIAM Journal on Computing 19 (6), 1059-1063, 1990 | 161 | 1990 |
| 8/7-approximation algorithm for (1, 2)-TSP P Berman, M Karpinski Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 148 | 2006 |
| The matching problem for bipartite graphs with polynomially bounded permanents is in NC DY Grigoriev, M Karpinski 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 166-172, 1987 | 144 | 1987 |
| Approximation hardness of short symmetric instances of MAX-3SAT P Berman, M Karpinski, A Scott | 140 | 2004 |
| Greater trochanteric pain syndrome. A report of 15 cases MR Karpinski, H Piggott The Journal of bone and joint surgery. British volume 67 (5), 762-763, 1985 | 129 | 1985 |
| Efficient algorithms for Lempel-Ziv encoding L Gasieniec, M Karpinski, W Plandowski, W Rytter Scandinavian Workshop on Algorithm Theory, 392-403, 1996 | 127 | 1996 |
| Polynomial bounds for VC dimension of sigmoidal neural networks M Karpinski, A Macintyre Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 117 | 1995 |
| An exponential lower bound for depth 3 arithmetic circuits D Grigoriev, M Karpinski Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 111 | 1998 |
| New inapproximability bounds for TSP M Karpinski, M Lampis, R Schmied Journal of Computer and System Sciences 81 (8), 1665-1677, 2015 | 106 | 2015 |
| Fast parallel algorithms for graph matching problems M Karpiński, M Karpinski, W Rytter Oxford University Press, 1998 | 103 | 1998 |
