Travelled to:5 × USA
Collaborated with:R.L.Graham D.S.Johnson E.G.C.Jr. L.J.Stockmeyer J.D.Ullman C.Courcoubetis L.A.McGeoch P.W.Shor R.R.Weber M.Yannakakis
Talks about:case (3) schedul (2) problem (2) complet (2) some (2) nonpreempt (1) processor (1) preemptiv (1) fundament (1) distribut (1)
Person: M. R. Garey
DBLP: Garey:M=_R=
Contributed to:
199119761974
19731972Wrote 6 papers:
- STOC-1991-CoffmanCGJMSWY #analysis #case study
- Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study (EGCJ, CC, MRG, DSJ, LAM, PWS, RRW, MY), pp. 230–240.
- STOC-1991-CoffmanG #proving #scheduling
- Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling (EGCJ, MRG), pp. 241–248.
- STOC-1976-GareyGJ #geometry #problem
- Some NP-Complete Geometric Problems (MRG, RLG, DSJ), pp. 10–22.
- STOC-1974-GareyJS #problem
- Some Simplified NP-Complete Problems (MRG, DSJ, LJS), pp. 47–63.
- SOSP-1973-GareyG #bound #scheduling
- Bounds on Scheduling with Limited Resources (MRG, RLG), pp. 104–111.
- STOC-1972-GareyGU #algorithm #analysis #memory management #worst-case
- Worst-Case Analysis of Memory Allocation Algorithms (MRG, RLG, JDU), pp. 143–150.