Peter W. Shor

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with M. R. Garey

> Home > Persons > Peter W. Shor

Publications

2002
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/siamrev/CoffmanCGJSWY02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamrev/CoffmanCGJSWY02
Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. SIAM Rev. 44(1): 95-108 (2002)
2000
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/CoffmanCGJSWY00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CoffmanCGJSWY00
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discret. Math. 13(3): 384-402 (2000)
1991
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/CoffmanCGJMSWY91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/CoffmanCGJMSWY91
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study. STOC 1991: 230-240

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.