The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter W. Shor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  62. The Power of Unentanglement. [Citation Graph (, )][DBLP]


  63. Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. [Citation Graph (, )][DBLP]


  64. Quantum Adiabatic Algorithms, Small Gaps, and Different Paths [Citation Graph (, )][DBLP]


  65. Quantum interactive proofs with short messages [Citation Graph (, )][DBLP]


  66. Quantum money from knots [Citation Graph (, )][DBLP]


  67. The Power of Unentanglement. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002