Peter W. Shor

	2011
82		Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy Myrvold, Peter W. Shor, Dinesh Weerapurage: A complete resolution of the Keller maximum clique problem. SODA 2011: 129-135
81		Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng: High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping. IEEE Transactions on Information Theory 57(10): 7180-7188 (2011)
80		Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor: Quantum adiabatic algorithms, small gaps, and different paths. Quantum Information & Computation 11(3&4): 181-214 (2011)
79		Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor: Unstructured randomness, small gaps and localization. Quantum Information & Computation 11(9&10): 840-854 (2011)
	2010
78		Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor: Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31
77		Salman Beigi, Peter W. Shor, John Watrous: Quantum interactive proofs with short messages CoRR abs/1004.0411: (2010)
76		Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor: Quantum money from knots CoRR abs/1004.5127: (2010)
75		Aram Wettroth Harrow, Peter W. Shor: Time reversal and exchange symmetries of unitary gate capacities. IEEE Transactions on Information Theory 56(1): 462-475 (2010)
74		Salman Beigi, Peter W. Shor: C_3, semi-Clifford and genralized semi-Clifford operations. Quantum Information & Computation 10(1&2): 41-59 (2010)
73		Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian: Questions answered. in theory.: http: //cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010)
	2009
72		Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor: Quantum Adiabatic Algorithms, Small Gaps, and Different Paths CoRR abs/0909.4766: (2009)
71		Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. Theory of Computing 5(1): 1-42 (2009)
	2008
70		Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. IEEE Conference on Computational Complexity 2008: 223-236
69		Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. Electronic Colloquium on Computational Complexity (ECCC) 15(051): (2008)
68		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)
67		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)
66		Alan W. Leung, Peter W. Shor: Entanglement purification with two-way classical communication. Quantum Information & Computation 8(3): 311-329 (2008)
65		Peter W. Shor, Stephen P. Jordan: Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Information & Computation 8(8): 681-714 (2008)
	2006
64		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
63		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
62		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)
61		Peter W. Shor: The classical capacity achievable by a quantum channel assisted by a limited entanglement. Quantum Information & Computation 4(6): 537-545 (2004)
	2003
60		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
59		Peter W. Shor: Why haven't more quantum algorithms been found?. J. ACM 50(1): 87-90 (2003)
58		Peter W. Shor: Capacities of quantum channels and how to find them. Math. Program. 97(1-2): 311-335 (2003)
	2002
57		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)
56		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
55		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
54		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)
53		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
52		János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber: A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265
51		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
50		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)
49		Charles H. Bennett, Peter W. Shor: Quantum Information Theory. IEEE Transactions on Information Theory 44(6): 2724-2742 (1998)
	1997
48		Frank Thomson Leighton, Peter W. Shor: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997 ACM 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		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		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		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		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		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		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		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		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)

Coauthor Index

1	Scott Aaronson	[69] [70] [71] [78]
2	Pankaj K. Agarwal	[13]
3	Alok Aggarwal	[7] [10] [11] [14] [17] [23]
4	David Applegate	[60]
5	Salman Beigi	[69] [70] [71] [74] [77]
6	Charles H. Bennett	[49] [56] [63]
7	Bonnie Berger	[19] [21] [35] [47] [51] [54]
8	Francine Berman (Fran Berman)	[20]
9	Luciana S. Buriol	[60]
10	Jonathan F. Buss	[3]
11	A. Robert Calderbank	[50]
12	Dave Clarke (David G. Clarke)	[73]
13	Kenneth L. Clarkson	[12] [15]
14	Edward G. Coffman Jr.	[22] [24] [32] [33] [46] [53]
15	Karen L. Collins	[9]
16	Anne Condon	[34] [37] [41] [45]
17	Costas Courcoubetis	[24] [53]
18	János Csirik	[52] [55] [57] [64]
19	Jennifer Debroni	[82]
20	Bernard L. Dillard	[60]
21	Andrew Drucker	[69] [70] [71]
22	John D. Eblen	[82]
23	David Eppstein	[73]
24	Edward Farhi	[72] [76] [78] [79] [80]
25	Bill Fefferman	[69] [70] [71]
26	Joan Feigenbaum	[34] [37] [41] [42] [45]
27	Andrew S. Fletcher	[68]
28	M. R. Garey (Michael R. Garey)	[24] [53]
29	Kaveh Ghasemloo	[73]
30	Jeffrey Goldstone	[72] [79] [80]
31	David Gosset	[72] [76] [78] [79] [80]
32	Leonidas J. Guibas	[11] [14]
33	Sam Gutmann	[72] [79] [80]
34	Aram Wettroth Harrow	[75]
35	Avinatan Hassidim	[76] [78]
36	Pooya Hatami	[67]
37	Patrick M. Hayden	[63]
38	G. W. Hoest	[51]
39	Frank K. Hwang (Frank Kwang-Ming Hwang)	[30]
40	David S. Johnson	[20] [24] [33] [46] [52] [53] [55] [57] [60] [64]
41	Stephen P. Jordan	[65]
42	Jonathan A. Kelner	[78]
43	Jonathan A. King	[54]
44	Maria M. Klawe	[7] [10] [23]
45	Daphne Koller	[42]
46	Jeffrey C. Lagarias (J. C. Lagarias)	[36]
47	Michael A. Langston	[82]
48	Frank Thomson Leighton (Tom Leighton)	[8] [16] [20] [48]
49	Alan W. Leung	[66]
50	Debbie W. Leung	[63]
51	Carsten Lund	[34] [37] [41] [45]
52	Andrew Lutomirski	[76] [78]
53	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[52] [55] [57] [64]
54	Lyle A. McGeoch	[24]
55	Harvey B. Meyer	[72] [80]
56	Shlomo Moran	[7] [10] [17]
57	Wendy Myrvold	[82]
58	Moni Naor	[31]
59	James B. Orlin	[55] [57] [64]
60	Alon Orlitsky	[31]
61	J. R. Paulson	[51]
62	G. W. Peck	[2]
63	Marco Pellegrini	[25] [27]
64	Eric M. Rains	[50]
65	Sailesh K. Rao	[30]
66	Lev Reyzin	[73]
67	John Rompel	[19] [35]
68	P. Sadayappan (Ponnuswamy Sadayappan)	[30]
69	András Z. Salamon	[73]
70	James B. Saxe	[11] [14]
71	Russell Schwartz	[54]
72	Micha Sharir	[13]
73	Neil J. A. Sloane (N. J. A. Sloane)	[50]
74	Graeme Smith	[81]
75	Warren D. Smith	[29]
76	John A. Smolin	[56] [81]
77	Lawrence Snyder (Larry Snyder)	[20]
78	John R. Stembridge	[9]
79	Aaron Sterling	[73]
80	Subhash Suri	[17]
81	Ashish V. Thapliyal	[56]
82	William T. Trotter	[2]
83	Suresh Venkatasubramanian	[73]
84	John Watrous	[77]
85	Richard R. Weber	[24] [33] [46] [52] [53] [55] [57] [64]
86	Dinesh Weerapurage	[82]
87	Douglas B. West	[2]
88	Robert E. Wilber	[7] [10]
89	Moe Z. Win	[68]
90	Andreas J. Winter	[63]
91	Christopher J. Van Wyk	[18] [28]
92	Mihalis Yannakakis	[24] [53]
93	Bei Zeng	[81]

Colors in the list of coauthors

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page