| 2021 | ISIT | Upper bound on the classical capacity of a quantum channel assisted by classical feedback. | Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde |
| 2019 | ISIT | Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. | Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde |
| 2018 | ISIT | Superadditivity in Trade-Off Capacities of Quantum Channels. | Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor |
| 2012 | ISIT | New constructions of codes for asymmetric channels via concatenation. | Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng |
| 2011 | SODA | A complete resolution of the Keller maximum clique problem. | Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold, Peter W. Shor, Dinesh Weerapurage |
| 2009 | ISIT | Generalized concatenation for quantum codes. | Markus Grassl, Peter W. Shor, Bei Zeng |
| 2003 | ALENEX | The Cutting-Stock Approach to Bin Packing: Theory and Experiments. | David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor |
| 2000 | STOC | On the sum-of-squares algorithm for bin packing. | Jnos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber |
| 1999 | ALENEX | A Self Organizing Bin Packing Heuristic. | Jnos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber |
| 1996 | FOCS | Fault-Tolerant Quantum Computation. | Peter W. Shor |
| 1994 | FOCS | Algorithms for Quantum Computation: Discrete Logarithms and Factoring | Peter W. Shor |
| 1993 | STOC | Markov chains, computer proofs, and average-case analysis of best fit bin packing. | Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber |
| 1993 | STOC | Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
| 1991 | FOCS | How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing | Peter W. Shor |
| 1991 | SODA | Finding Stabbing Lines in 3-Dimensional Space. | Marco Pellegrini, Peter W. Shor |
| 1991 | STOC | Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study | Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis |
| 1990 | SODA | Approximation Algorithms for the Maximum Acyclic Subgraph Problem. | Bonnie Berger, Peter W. Shor |
| 1989 | FOCS | Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry | Bonnie Berger, John Rompel, Peter W. Shor |
| 1989 | WADS | Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). | Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri |
| 1987 | STOC | A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon | Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor |
| 1986 | STOC | Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms | Frank Thomson Leighton, Peter W. Shor |
| 1984 | FOCS | The Average-Case Analysis of Some On-Line Algorithms for Bin Packing | Peter W. Shor |
| 1984 | STOC | On the Pagenumber of Planar Graphs | Jonathan F. Buss, Peter W. Shor |