M. R. Garey
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
4
Active years
1972–1991
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 1991 | STOC | Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study | Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis |
| 1991 | STOC | Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling | Edward G. Coffman Jr., M. R. Garey |
| 1983 | PODC | Scheduling File Transfers in a Distributed Network. | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh |
| 1981 | FOCS | The Complexity of Searching a Graph (Preliminary Version) | Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou |
| 1978 | FOCS | The Complexity of Checkers on an N * N Board - Preliminary Report | Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha |
| 1976 | STOC | Some NP-Complete Geometric Problems | M. R. Garey, Ronald L. Graham, David S. Johnson |
| 1975 | FOCS | An Application of Graph Coloring to Printed Circuit Testing (Working Paper) | M. R. Garey, David S. Johnson, Hing C. So |
| 1974 | STOC | Some Simplified NP-Complete Problems | M. R. Garey, David S. Johnson, Larry J. Stockmeyer |
| 1973 | SOSP | Bounds on Scheduling with Limited Resources. | M. R. Garey, Ronald L. Graham |
| 1972 | STOC | Worst-Case Analysis of Memory Allocation Algorithms | M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman |