| 2008 |
|---|
| 65 | EE | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
IEEE Conference on Computational Complexity 2008: 223-236 |
| 64 | EE | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
Electronic Colloquium on Computational Complexity (ECCC) 15(051): (2008) |
| 63 | EE | Andrew S. Fletcher,
Peter W. Shor,
Moe Z. Win:
Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel.
IEEE Transactions on Information Theory 54(12): 5705-5718 (2008) |
| 62 | EE | Pooya Hatami,
Peter W. Shor:
A lower bound for the length of a partial transversal in a Latin square.
J. Comb. Theory, Ser. A 115(7): 1103-1113 (2008) |
| 2006 |
|---|
| 61 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing.
J. ACM 53(1): 1-65 (2006) |
| 2005 |
|---|
| 60 | EE | Charles H. Bennett,
Patrick M. Hayden,
Debbie W. Leung,
Peter W. Shor,
Andreas J. Winter:
Remote preparation of quantum states.
IEEE Transactions on Information Theory 51(1): 56-74 (2005) |
| 2004 |
|---|
| 59 | EE | Peter W. Shor:
The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions.
IBM Journal of Research and Development 48(1): 115-138 (2004) |
| 2003 |
|---|
| 58 | | David Applegate,
Luciana S. Buriol,
Bernard L. Dillard,
David S. Johnson,
Peter W. Shor:
The Cutting-Stock Approach to Bin Packing: Theory and Experiments.
ALENEX 2003: 1-15 |
| 57 | EE | Peter W. Shor:
Why haven't more quantum algorithms been found?.
J. ACM 50(1): 87-90 (2003) |
| 2002 |
|---|
| 56 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing
CoRR cs.DS/0210013: (2002) |
| 55 | | Charles H. Bennett,
Peter W. Shor,
John A. Smolin,
Ashish V. Thapliyal:
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem.
IEEE Transactions on Information Theory 48(10): 2637-2655 (2002) |
| 2000 |
|---|
| 54 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the sum-of-squares algorithm for bin packing.
STOC 2000: 208-217 |
| 53 | | Bonnie Berger,
Jonathan A. King,
Russell Schwartz,
Peter W. Shor:
Local rule mechanism for selecting icosahedral shell geometry.
Discrete Applied Mathematics 104(1-3): 97-111 (2000) |
| 52 | EE | 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. Discrete Math. 13(3): 384-402 (2000) |
| 1999 |
|---|
| 51 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
Peter W. Shor,
Richard R. Weber:
A Self Organizing Bin Packing Heuristic.
ALENEX 1999: 246-265 |
| 50 | | Bonnie Berger,
G. W. Hoest,
J. R. Paulson,
Peter W. Shor:
On the Structure of the Scaffolding Core of Bacteriophage T4.
Journal of Computational Biology 6(1): 1-12 (1999) |
| 1998 |
|---|
| 49 | | A. Robert Calderbank,
Eric M. Rains,
Peter W. Shor,
Neil J. A. Sloane:
Quantum Error Correction Via Codes Over GF(4).
IEEE Transactions on Information Theory 44(4): 1369-1387 (1998) |
| 48 | | Charles H. Bennett,
Peter W. Shor:
Quantum Information Theory.
IEEE Transactions on Information Theory 44(6): 2724-2742 (1998) |
| 1997 |
|---|
| 47 | | Bonnie Berger,
Peter W. Shor:
Tight Bounds for the Maximum Acyclic Subgraph Problem.
J. Algorithms 25(1): 1-18 (1997) |
| 46 | | Edward G. Coffman Jr.,
David S. Johnson,
Peter W. Shor,
Richard R. Weber:
Bin packing with discrete item sizes, part II: Tight bounds on First Fit.
Random Struct. Algorithms 10(1-2): 69-101 (1997) |
| 45 | | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions.
SIAM J. Comput. 26(2): 369-400 (1997) |
| 44 | | Peter W. Shor:
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
SIAM J. Comput. 26(5): 1484-1509 (1997) |
| 1996 |
|---|
| 43 | | Peter W. Shor:
Fault-Tolerant Quantum Computation.
FOCS 1996: 56-65 |
| 1995 |
|---|
| 42 | | Joan Feigenbaum,
Daphne Koller,
Peter W. Shor:
A Game-Theoretic Classification of Interactive Complexity Classes.
Structure in Complexity Theory Conference 1995: 227-237 |
| 41 | EE | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.
Chicago J. Theor. Comput. Sci. 1995: (1995) |
| 40 | | Peter W. Shor:
A New Proof of Cayley's Formula for Counting Labeled Trees.
J. Comb. Theory, Ser. A 71(1): 154-158 (1995) |
| 1994 |
|---|
| 39 | | Peter W. Shor:
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer.
ANTS 1994: 289 |
| 38 | | Peter W. Shor:
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
FOCS 1994: 124-134 |
| 37 | | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions.
Structure in Complexity Theory Conference 1994: 280-293 |
| 36 | | J. C. Lagarias,
Peter W. Shor:
Cube-Tilings of Rn and Nonlinear Codes.
Discrete & Computational Geometry 11: 359-391 (1994) |
| 35 | | Bonnie Berger,
John Rompel,
Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry.
J. Comput. Syst. Sci. 49(3): 454-477 (1994) |
| 1993 |
|---|
| 34 | EE | Anne Condon,
Joan Feigenbaum,
Carsten Lund,
Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.
STOC 1993: 305-314 |
| 33 | EE | Edward G. Coffman Jr.,
David S. Johnson,
Peter W. Shor,
Richard R. Weber:
Markov chains, computer proofs, and average-case analysis of best fit bin packing.
STOC 1993: 412-421 |
| 32 | | Edward G. Coffman Jr.,
Peter W. Shor:
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms.
Algorithmica 9(3): 253-277 (1993) |
| 31 | | Moni Naor,
Alon Orlitsky,
Peter W. Shor:
Three results on interactive communication.
IEEE Transactions on Information Theory 39(5): 1608-1615 (1993) |
| 1992 |
|---|
| 30 | | Sailesh K. Rao,
P. Sadayappan,
Frank K. Hwang,
Peter W. Shor:
The Rectilinear Steiner Arborescence Problem.
Algorithmica 7(2&3): 277-288 (1992) |
| 29 | | Warren D. Smith,
Peter W. Shor:
Steiner Tree Problems.
Algorithmica 7(2&3): 329-332 (1992) |
| 28 | | Peter W. Shor,
Christopher J. Van Wyk:
Detecting and Decomposing Self-overlapping Curves.
Comput. Geom. 2: 31-50 (1992) |
| 27 | | Marco Pellegrini,
Peter W. Shor:
Finding Stabbing Lines in 3-Space.
Discrete & Computational Geometry 8: 191-208 (1992) |
| 1991 |
|---|
| 26 | | Peter W. Shor:
How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing
FOCS 1991: 752-759 |
| 25 | | Marco Pellegrini,
Peter W. Shor:
Finding Stabbing Lines in 3-Dimensional Space.
SODA 1991: 24-31 |
| 24 | | 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 |
| 23 | | Alok Aggarwal,
Maria M. Klawe,
Peter W. Shor:
Multilayer Grid Embeddings for VLSI.
Algorithmica 6(1): 129-151 (1991) |
| 22 | | Edward G. Coffman Jr.,
Peter W. Shor:
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound.
SIAM J. Discrete Math. 4(1): 48-57 (1991) |
| 1990 |
|---|
| 21 | | Bonnie Berger,
Peter W. Shor:
Approximation Algorithms for the Maximum Acyclic Subgraph Problem.
SODA 1990: 236-243 |
| 20 | | Francine Berman,
David S. Johnson,
Frank Thomson Leighton,
Peter W. Shor,
Larry Snyder:
Generalized Planar Matching.
J. Algorithms 11(2): 153-184 (1990) |
| 1989 |
|---|
| 19 | | Bonnie Berger,
John Rompel,
Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry
FOCS 1989: 54-59 |
| 18 | EE | Peter W. Shor,
Christopher J. Van Wyk:
Detecting and Decomposing Self-Overlapping Curves.
Symposium on Computational Geometry 1989: 44-50 |
| 17 | | Alok Aggarwal,
Shlomo Moran,
Peter W. Shor,
Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).
WADS 1989: 115-134 |
| 16 | | Tom Leighton,
Peter W. Shor:
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms.
Combinatorica 9(2): 161-187 (1989) |
| 15 | | Kenneth L. Clarkson,
Peter W. Shor:
Application of Random Sampling in Computational Geometry, II.
Discrete & Computational Geometry 4: 387-421 (1989) |
| 14 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Discrete & Computational Geometry 4: 591-604 (1989) |
| 13 | EE | Pankaj K. Agarwal,
Micha Sharir,
Peter W. Shor:
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences.
J. Comb. Theory, Ser. A 52(2): 228-274 (1989) |
| 1988 |
|---|
| 12 | EE | Kenneth L. Clarkson,
Peter W. Shor:
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental.
Symposium on Computational Geometry 1988: 12-17 |
| 1987 |
|---|
| 11 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon
STOC 1987: 39-45 |
| 10 | | Alok Aggarwal,
Maria M. Klawe,
Shlomo Moran,
Peter W. Shor,
Robert E. Wilber:
Geometric Applications of a Matrix-Searching Algorithm.
Algorithmica 2: 195-208 (1987) |
| 9 | EE | Karen L. Collins,
Peter W. Shor,
John R. Stembridge:
A lower bound for 0, 1, * tournament codes.
Discrete Mathematics 63(1): 15-19 (1987) |
| 1986 |
|---|
| 8 | | Frank Thomson Leighton,
Peter W. Shor:
Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms
STOC 1986: 91-103 |
| 7 | EE | Alok Aggarwal,
Maria M. Klawe,
Shlomo Moran,
Peter W. Shor,
Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm.
Symposium on Computational Geometry 1986: 285-292 |
| 6 | | Peter W. Shor:
the average-case analysis of some on-line algorithms for bin packing.
Combinatorica 6(2): 179-200 (1986) |
| 1985 |
|---|
| 5 | | Peter W. Shor:
A Counterexample to the Triangle Conjecture.
J. Comb. Theory, Ser. A 38(1): 110-112 (1985) |
| 1984 |
|---|
| 4 | | Peter W. Shor:
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing
FOCS 1984: 193-200 |
| 3 | | Jonathan F. Buss,
Peter W. Shor:
On the Pagenumber of Planar Graphs
STOC 1984: 98-100 |
| 2 | | Douglas B. West,
William T. Trotter,
G. W. Peck,
Peter W. Shor:
Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
Combinatorica 4(1): 117-119 (1984) |
| 1982 |
|---|
| 1 | | Peter W. Shor:
A Lower Bound for the Length of a Partial Transversal in a Latin Square.
J. Comb. Theory, Ser. A 33(1): 1-8 (1982) |
