Travelled to:
2 × Canada
9 × USA
Collaborated with:
∅ M.R.Garey P.W.Shor R.R.Weber A.C.Klug E.G.C.Jr. R.L.Graham L.J.Stockmeyer M.Yannakakis L.A.McGeoch C.Young D.R.Karger M.D.Smith S.Krishnan J.Chhugani S.Kumar S.Venkatasubramanian E.Dahlhaus C.H.Papadimitriou P.D.Seymour J.L.Bentley F.T.Leighton C.C.McGeoch J.Csirik C.Kenyon J.B.Orlin C.Courcoubetis
Talks about:
problem (4) pack (4) bin (4) some (3) case (3) algorithm (2) complet (2) averag (2) under (2) optim (2)
Person: David S. Johnson
DBLP: Johnson:David_S=
Facilitated 4 volumes:
Contributed to:
Wrote 12 papers:
- VLDB-2004-JohnsonKCKV #matrix #order #scalability #using
- Compressing Large Boolean Matrices using Reordering Techniques (DSJ, SK, JC, SK, SV), pp. 13–23.
- STOC-2000-CsirikJKOSW #algorithm #on the
- On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
- PLDI-1997-YoungJKS #branch
- Near-optimal Intraprocedural Branch Alignment (CY, DSJ, DRK, MDS), pp. 183–193.
- STOC-1993-CoffmanJSW #analysis #markov #proving
- Markov chains, computer proofs, and average-case analysis of best fit bin packing (EGCJ, DSJ, PWS, RRW), pp. 412–421.
- STOC-1992-DahlhausJPSY #complexity #multi
- The Complexity of Multiway Cuts (ED, DSJ, CHP, PDS, MY), pp. 241–251.
- 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.
- ICALP-1990-Johnson #optimisation #problem
- Local Optimization and the Traveling Salesman Problem (DSJ), pp. 446–461.
- STOC-1984-BentleyJLMM #behaviour
- Some Unexpected Expected Behavior Results for Bin Packing (JLB, DSJ, FTL, CCM, LAM), pp. 279–288.
- PODS-1982-JohnsonK #dependence #functional #query #testing
- Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (DSJ, ACK), pp. 164–169.
- 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.
- STOC-1973-Johnson #algorithm #approximate #combinator #problem
- Approximation Algorithms for Combinatorial Problems (DSJ), pp. 38–49.