default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter W. Shor
- > Home > Persons > Peter W. Shor
Publications
- 2011
[c29]Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold
, Peter W. Shor, Dinesh Weerapurage:
A complete resolution of the Keller maximum clique problem. SODA 2011: 129-135- 2010
- [j53]Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. Sterling, Suresh Venkatasubramanian:
Questions answered. in theory.: http://cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010) - 2006
- [j45]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) - 2003
- [c25]David L. 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 - 2002
- [j38]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) - [i1]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) - 2000
- [j36]Bonnie Berger, Jonathan A. King, Russell Schwartz, Peter W. Shor:
Local rule mechanism for selecting icosahedral shell geometry. Discret. Appl. Math. 104(1-3): 97-111 (2000) - [j35]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) - [c24]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 - 1999
- [j34]Bonnie Berger, G. W. Hoest, J. R. Paulson, Peter W. Shor:
On the Structure of the Scaffolding Core of Bacteriophage T4. J. Comput. Biol. 6(1): 1-12 (1999) - [j33]John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24(2): 362-382 (1999) - [c23]János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265 - 1998
- [j31]A. Robert Calderbank, Eric M. Rains, Peter W. Shor, Neil J. A. Sloane:
Quantum Error Correction Via Codes Over GF(4). IEEE Trans. Inf. Theory 44(4): 1369-1387 (1998) - 1997
- [j29]Bonnie Berger, Peter W. Shor:
Tight Bounds for the Maximum Acyclic Subgraph Problem. J. Algorithms 25(1): 1-18 (1997) - [j28]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) - [j27]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) - [e1]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, ISBN 0-89791-888-6 [contents] - 1995
- [j25]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chic. J. Theor. Comput. Sci. 1995 (1995) - [c21]Joan Feigenbaum, Daphne Koller, Peter W. Shor:
A Game-Theoretic Classification of Interactive Complexity Classes. SCT 1995: 227-237 - 1994
- [j23]J. C. Lagarias, Peter W. Shor:
Cube-Tilings of Rn and Nonlinear Codes. Discret. Comput. Geom. 11: 359-391 (1994) - [j22]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) - [c19]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions. SCT 1994: 280-293 - 1993
- [j21]Edward G. Coffman Jr., Peter W. Shor:
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9(3): 253-277 (1993) - [j20]Moni Naor, Alon Orlitsky, Peter W. Shor:
Three results on interactive communication. IEEE Trans. Inf. Theory 39(5): 1608-1615 (1993) - [c17]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314 - [c16]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 - 1992
- [j19]Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor:
The Rectilinear Steiner Arborescence Problem. Algorithmica 7(2&3): 277-288 (1992) - [j18]Warren D. Smith, Peter W. Shor:
Steiner Tree Problems. Algorithmica 7(2&3): 329-332 (1992) - [j17]Peter W. Shor, Christopher J. Van Wyk:
Detecting and Decomposing Self-overlapping Curves. Comput. Geom. 2: 31-50 (1992) - [j16]Marco Pellegrini, Peter W. Shor:
Finding Stabbing Lines in 3-Space. Discret. Comput. Geom. 8: 191-208 (1992) - [j15]Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi:
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Oper. Res. 40(6): 1095-1106 (1992) - 1991
- [j14]Alok Aggarwal, Maria M. Klawe, Peter W. Shor:
Multilayer Grid Embeddings for VLSI. Algorithmica 6(1): 129-151 (1991) - [j13]Anders Björner, László Lovász, Peter W. Shor:
Chip-firing Games on Graphs. Eur. J. Comb. 12(4): 283-291 (1991) - [j12]Edward G. Coffman Jr., Peter W. Shor:
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound. SIAM J. Discret. Math. 4(1): 48-57 (1991) - [c15]Tishya Leong, Peter W. Shor, Clifford Stein:
Implementation of a Combinatorial Multicommodity Flow Algorithm. Network Flows And Matching 1991: 387-405 - [c13]Marco Pellegrini, Peter W. Shor:
Finding Stabbing Lines in 3-Dimensional Space. SODA 1991: 24-31 - [c12]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 - 1990
- [j11]Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder:
Generalized Planar Matching. J. Algorithms 11(2): 153-184 (1990) - [c10]Bonnie Berger, Peter W. Shor:
Approximation Algorithms for the Maximum Acyclic Subgraph Problem. SODA 1990: 236-243 - 1989
- [j10]Tom Leighton, Peter W. Shor:
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. Comb. 9(2): 161-187 (1989) - [j9]Kenneth L. Clarkson, Peter W. Shor:
Application of Random Sampling in Computational Geometry, II. Discret. Comput. Geom. 4: 387-421 (1989) - [j8]Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discret. Comput. Geom. 4: 591-604 (1989) - [j7]Pankaj K. Agarwal, Micha Sharir, Peter W. Shor:
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory A 52(2): 228-274 (1989) - [c9]Peter W. Shor, Christopher J. Van Wyk:
Detecting and Decomposing Self-Overlapping Curves. SCG 1989: 44-50 - [c8]Bonnie Berger, John Rompel, Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. FOCS 1989: 54-59 - [c7]Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989: 115-134 - 1988
- [c6]Kenneth L. Clarkson, Peter W. Shor:
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. SCG 1988: 12-17 - 1987
- [j6]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) - [c5]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 - 1986
- [c4]Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm. SCG 1986: 285-292 - [c3]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 - 1984
- [j2]Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor:
Regressions and monotone chains: a ramsey - type extermal problem for partial orders. Comb. 4(1): 117-119 (1984)
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
