Travelled to:6 × USA
Collaborated with:M.R.Garey A.C.Yao N.Alon F.R.K.Chung D.S.Johnson J.D.Ullman Y.Hu Y.Zhu H.Chen C.Cheng
Talks about:algorithm (1) agreement (1) synthesi (1) communic (1) byzantin (1) schedul (1) resourc (1) problem (1) geometr (1) complet (1)
Person: Ronald L. Graham
DBLP: Graham:Ronald_L=
Contributed to:
2006
199319891976
19731972Wrote 6 papers:
- DAC-2006-HuZCGC #communication #latency #power management #synthesis
- Communication latency aware low power NoC synthesis (YH, YZ, HC, RLG, CKC), pp. 574–579.
- STOC-1993-AlonCG #graph #permutation
- Routing permutations on graphs via matchings (NA, FRKC, RLG), pp. 583–591.
- STOC-1989-GrahamY #on the
- On the Improbability of Reaching Byzantine Agreements (RLG, ACCY), pp. 467–478.
- STOC-1976-GareyGJ #geometry #problem
- Some NP-Complete Geometric Problems (MRG, RLG, DSJ), pp. 10–22.
- 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.