M. R. Garey
Affiliations: Bell Labs
According to our database^{1},
M. R. Garey
authored at least 61 papers
between 1972 and 2002.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1995, "For fundamental contributions to the theory of complexity and algorithms and for outstanding service to ACM.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on viaf.org

on id.loc.gov

on dnb.info

on dl.acm.org
On csauthors.net:
Bibliography
2002
Perfect Packing Theorems and the AverageCase Behavior of Optimal and Online Bin Packing.
SIAM Rev., 2002
2000
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.
SIAM J. Discret. Math., 2000
1993
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive TwoProcessor Scheduling.
J. ACM, 1993
1991
Fundamental Discrepancies between AverageCase Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
1989
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989
1988
IEEE Trans. Commun., 1988
SIAM J. Discret. Math., 1988
Math. Oper. Res., 1988
J. ACM, 1988
1987
J. Complex., 1987
1985
SIAM J. Comput., 1985
SIAM J. Comput., 1985
Networks, 1985
J. Complex., 1985
1984
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.
IEEE Trans. Computers, 1984
J. Graph Theory, 1984
AT&T Bell Lab. Tech. J., 1984
1983
SIAM J. Comput., 1983
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983
1982
IEEE Trans. Inf. Theory, 1982
1981
SIAM J. Comput., 1981
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1980
SIAM J. Algebraic Discret. Methods, 1980
SIAM J. Comput., 1980
1979
Computers and Intractability: A Guide to the Theory of NPCompleteness.
W. H. Freeman, ISBN: 0716710447, 1979
1978
SIGACT News, 1978
SIAM J. Comput., 1978
Networks, 1978
J. ACM, 1978
Inf. Process. Lett., 1978
Inf. Process. Lett., 1978
Oper. Res., 1978
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
1977
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units.
IEEE Trans. Computers, 1977
SIAM J. Comput., 1977
The Rectilinear Steiner Tree Problem is NP Complete.
SIAM Journal of Applied Mathematics, 1977
Networks, 1977
Scheduling EqualLength Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness.
Math. Oper. Res., 1977
1976
Theor. Comput. Sci., 1976
SIAM J. Comput., 1976
Math. Oper. Res., 1976
J. Comb. Theory, Ser. A, 1976
J. ACM, 1976
J. ACM, 1976
Discret. Math., 1976
Computational aspects of deciding if all roots of a polynomial lie within the unit circle.
Computing, 1976
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976
1975
SIAM J. Comput., 1975
SIAM J. Comput., 1975
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
J. ACM, 1975
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1974
SIAM J. Comput., 1974
SIAM J. Comput., 1974
Acta Informatica, 1974
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974
1973
Discret. Math., 1973
Proceedings of the Fourth Symposium on Operating System Principles, 1973
1972
IEEE Trans. Computers, 1972
IEEE Trans. Computers, 1972
SIAM J. Comput., 1972
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972