| Enabling discovery of ocean science data in the modern era using geospatial and information science R Michael, B Jonathan, S David BOOK OF ABSTRACTS, 2018 | | 2018 |
| Manipulation of Dirac cones in intercalated epitaxial graphene C Michael, T Matthew, A Patricia Carbon, 2017 | | 2017 |
| Perfect packing theorems and the average-case behavior of optimal and online bin packing C Courcoubetist, MR Garey, DS Johnson, PW Short, RR Weberll, ... SIAM Review 44 (1), 95-108, 2002 | 3 | 2002 |
| Computers and intractability MR Garey, DS Johnson wh freeman, 2002 | 67000 | 2002 |
| Benchmarks for basic scheduling problems. H Gao, X Liu, A Allahverdi, D Barbara, J Couto, Y Li, RL Burdett, E Kozan, ... Information Technology Journal 6 (6), 111-127, 2000 | | 2000 |
| Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings EG Coffman Jr, C Courcoubetis, MR Garey, DS Johnson, PW Shor, ... SIAM Journal on Discrete Mathematics 13 (3), 384-402, 2000 | 89 | 2000 |
| Approximation algorithms for NP-hard problems EG Coffman Jr, MR Garey, DS Johnson Boston, MA, USA: PWS Publishing Co, 46-93, 1997 | 96 | 1997 |
| Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings EGC man Jr, C Courcoubetis, MR Garey, DS Johnson, PW Shor, ... SIAM J. Disc. Math. Submitted, 1997 | 8 | 1997 |
| Approximation algorithms EG Coffman, MR Garey, DS Johnson Approximation algorithms for bin packing: a survey. PWS Publishing Company …, 1997 | 3 | 1997 |
| Approximation algorithms for bin packing: A survey EGC man Jr, MR Garey, DS Johnson Approximation algorithms for NP-hard problems, 46-93, 1996 | 1275 | 1996 |
| Logic and information flow J Eijck, MR Garey, A Meyer Mit Press, 1994 | 18 | 1994 |
| Circuit complexity and neural networks I Parberry, MR Garey, A Meyer MIT press, 1994 | 225 | 1994 |
| Complexity theory CH Papadimitriou Reading: Addison Wesley, 1994 | 40 | 1994 |
| Methods for visual understanding of hierarchical systems K Sugiyama, S Tagawa, M Toda, MJ Carpano, MR Garey, DS Johnson, ... IEEE Trans. Syst. Man Cybern 25, 261-295, 1994 | 2 | 1994 |
| Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling EG Coffman Jr, MR Garey Journal of the ACM (JACM) 40 (5), 991-1018, 1993 | 23 | 1993 |
| Hilbert's tenth problem YV Matiyasevich, JE Fenstad MIT press, 1993 | 776 | 1993 |
| Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study EG Coffman Jr, C Courcoubetis, MR Garey, DS Johnson, LA McGeoch, ... Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 54 | 1991 |
| Basic category theory for computer scientists BC Pierce, C Benjamin, BC Pierce MIT press, 1991 | 701 | 1991 |
| The complexity of collapsing reachability graphs S Aggarwal, D Barbara, W Cunto, MR Garey International Conference on Computer Aided Verification, 264-274, 1989 | 1 | 1989 |
| Complexity results for multiprocessor scheduling under resource constraints MR Garey, DS Johnson Tutorial: hard real-time systems, 205-219, 1989 | 7 | 1989 |
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentDirección de correo verificada de research.att.com
