Travelled to:6 × USA
Collaborated with:D.S.Johnson R.R.Weber F.T.Leighton J.F.Buss E.G.C.Jr. A.Condon J.Feigenbaum C.Lund A.Aggarwal L.J.Guibas J.B.Saxe J.Csirik C.Kenyon J.B.Orlin C.Courcoubetis M.R.Garey L.A.McGeoch M.Yannakakis
Talks about:algorithm (4) case (4) averag (3) pack (3) bin (3) analysi (2) comput (2) probabilist (1) fundament (1) distribut (1)
Person: Peter W. Shor
DBLP: Shor:Peter_W=
Facilitated 1 volumes:
EdContributed to:
200019931991198719861984Wrote 7 papers:
- STOC-2000-CsirikJKOSW #algorithm #on the
- On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
- 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-1993-CondonFLS #algorithm #approximate
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.
- 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-1987-AggarwalGSS #algorithm #diagrams #linear
- A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon (AA, LJG, JBS, PWS), pp. 39–45.
- STOC-1986-LeightonS #algorithm #analysis #bound #grid
- Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
- STOC-1984-BussS #graph #on the
- On the Pagenumber of Planar Graphs (JFB, PWS), pp. 98–100.