default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter W. Shor
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, USA
- award (1999): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i16]Robert Lin, Peter W. Shor:
A New Class of Algorithms for Finding Short Vectors in Lattices Lifted from Co-dimension k Codes. CoRR abs/2401.12383 (2024)- 2023
- [j64]Dawei Ding, Sumeet Khatri
, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde:
Bounding the Forward Classical Capacity of Bipartite Quantum Channels. IEEE Trans. Inf. Theory 69(5): 3034-3061 (2023) - 2021
- [c35]Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde:
Upper bound on the classical capacity of a quantum channel assisted by classical feedback. ISIT 2021: 906-911 - 2020
- [i15]Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde:
Bounding the forward classical capacity of bipartite quantum channels. CoRR abs/2010.01058 (2020)
2010 – 2019
- 2019
- [j63]Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in Trade-Off Capacities of Quantum Channels. IEEE Trans. Inf. Theory 65(6): 3973-3989 (2019) - [j62]Seth Lloyd, Peter W. Shor, Kevin Thompson:
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel. IEEE Trans. Inf. Theory 65(11): 7584-7595 (2019) - [c34]Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde:
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. ISIT 2019: 250-254 - [i14]Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde:
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. CoRR abs/1902.02490 (2019) - 2018
- [c33]Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in Trade-Off Capacities of Quantum Channels. ISIT 2018: 251-255 - 2017
- [i13]Yihui Quek, Peter W. Shor:
Quantum and Super-quantum enhancements to two-sender, two-receiver channels. CoRR abs/1701.03813 (2017) - [i12]Elton Yechao Zhu, Quntao Zhuang, Peter W. Shor:
Superadditivity of the classical capacity with limited entanglement assistance. CoRR abs/1704.06955 (2017) - [i11]Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in trade-off capacities of quantum channels. CoRR abs/1708.04314 (2017) - 2016
- [i10]Lior Eldar, Peter W. Shor:
The Systematic Normal Form of Lattices. CoRR abs/1604.07800 (2016) - 2015
- [j61]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New Constructions of Codes for Asymmetric Channels via Concatenation. IEEE Trans. Inf. Theory 61(4): 1879-1886 (2015) - [c32]Mohammad Bavarian, Peter W. Shor:
Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. ITCS 2015: 123-132 - 2014
- [j60]Jordan S. Cotler, Peter W. Shor:
A new relativistic orthogonal states quantum key distribution protocol. Quantum Inf. Comput. 14(13-14): 1081-1088 (2014) - [j59]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. IEEE Trans. Inf. Theory 60(5): 2926-2959 (2014) - 2013
- [i9]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New Constructions of Codes for Asymmetric Channels via Concatenation. CoRR abs/1310.7536 (2013) - [i8]Mohammad Bavarian, Peter W. Shor:
Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. CoRR abs/1311.5186 (2013) - 2012
- [c31]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. ITCS 2012: 276-289 - [c30]Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New constructions of codes for asymmetric channels via concatenation. ISIT 2012: 751-755 - 2011
- [j58]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor:
Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 11(3&4): 181-214 (2011) - [j57]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor:
Unstructured randomness, small gaps and localization. Quantum Inf. Comput. 11(9&10): 840-854 (2011) - [j56]Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping. IEEE Trans. Inf. Theory 57(10): 7180-7188 (2011) - [j55]Salman Beigi, Peter W. Shor, John Watrous:
Quantum Interactive Proofs with Short Messages. Theory Comput. 7(1): 101-117 (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
- [j54]Salman Beigi, Peter W. Shor:
C_3, semi-Clifford and genralized semi-Clifford operations. Quantum Inf. Comput. 10(1&2): 41-59 (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) - [j52]Aram W. Harrow, Peter W. Shor:
Time reversal and exchange symmetries of unitary gate capacities. IEEE Trans. Inf. Theory 56(1): 462-475 (2010) - [c28]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 - [i7]Salman Beigi, Peter W. Shor, John Watrous:
Quantum interactive proofs with short messages. CoRR abs/1004.0411 (2010) - [i6]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. CoRR abs/1004.5127 (2010)
2000 – 2009
- 2009
- [j51]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Theory Comput. 5(1): 1-42 (2009) - [c27]Markus Grassl, Peter W. Shor, Bei Zeng:
Generalized concatenation for quantum codes. ISIT 2009: 953-957 - [i5]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) - [i4]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
Quantum Reverse Shannon Theorem. CoRR abs/0912.5537 (2009) - 2008
- [j50]Pooya Hatami, Peter W. Shor:
A lower bound for the length of a partial transversal in a Latin square. J. Comb. Theory A 115(7): 1103-1113 (2008) - [j49]Patrick M. Hayden, Peter W. Shor, Andreas J. Winter:
Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation. Open Syst. Inf. Dyn. 15(1): 71-90 (2008) - [j48]Alan W. Leung, Peter W. Shor:
Entanglement purification with two-way classical communication. Quantum Inf. Comput. 8(3): 311-329 (2008) - [j47]Peter W. Shor, Stephen P. Jordan:
Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Inf. Comput. 8(8): 681-714 (2008) - [j46]Andrew S. Fletcher, Peter W. Shor, Moe Z. Win:
Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel. IEEE Trans. Inf. Theory 54(12): 5705-5718 (2008) - [c26]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. CCC 2008: 223-236 - [i3]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Patrick M. Hayden, Peter W. Shor, Andreas J. Winter:
Random quantum codes from Gaussian ensembles and an uncertainty relation. CoRR abs/0712.0975 (2007) - 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) - 2005
- [j44]Charles H. Bennett, Patrick M. Hayden, Debbie W. Leung, Peter W. Shor, Andreas J. Winter:
Remote preparation of quantum states. IEEE Trans. Inf. Theory 51(1): 56-74 (2005) - 2004
- [j43]Peter W. Shor:
The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions. IBM J. Res. Dev. 48(1): 115-138 (2004) - [j42]Peter W. Shor:
The classical capacity achievable by a quantum channel assisted by a limited entanglement. Quantum Inf. Comput. 4(6): 537-545 (2004) - [j41]Peter W. Shor:
Progress in Quantum Algorithms. Quantum Inf. Process. 3(1-5): 5-13 (2004) - 2003
- [j40]Peter W. Shor:
Why haven't more quantum algorithms been found?. J. ACM 50(1): 87-90 (2003) - [j39]Peter W. Shor:
Capacities of quantum channels and how to find them. Math. Program. 97(1-2): 311-335 (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) - [j37]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 Trans. Inf. Theory 48(10): 2637-2655 (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
1990 – 1999
- 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) - [j32]Peter W. Shor:
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Rev. 41(2): 303-332 (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) - [j30]Charles H. Bennett, Peter W. Shor:
Quantum Information Theory. IEEE Trans. Inf. Theory 44(6): 2724-2742 (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) - [j26]Peter W. Shor:
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26(5): 1484-1509 (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] - 1996
- [c22]Peter W. Shor:
Fault-Tolerant Quantum Computation. FOCS 1996: 56-65 - 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) - [j24]Peter W. Shor:
A New Proof of Cayley's Formula for Counting Labeled Trees. J. Comb. Theory A 71(1): 154-158 (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) - [c20]Peter W. Shor:
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer. ANTS 1994: 289 - [c19]Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Random Debaters and the Hardness of Approximating Stochastic Functions. SCT 1994: 280-293 - [c18]Peter W. Shor:
Algorithms for Quantum Computation: Discrete Logarithms and Factoring. FOCS 1994: 124-134 - 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 - [c14]Peter W. Shor:
How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing. FOCS 1991: 752-759 - [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) - [c11]Peter W. Shor:
Stretchability of Pseudolines is NP-Hard. Applied Geometry And Discrete Mathematics 1990: 531-554 - [c10]Bonnie Berger, Peter W. Shor:
Approximation Algorithms for the Maximum Acyclic Subgraph Problem. SODA 1990: 236-243
1980 – 1989
- 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) - [j5]Karen L. Collins, Peter W. Shor, John R. Stembridge:
A lower bound for 0, 1, * tournament codes. Discret. Math. 63(1): 15-19 (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
- [j4]Peter W. Shor:
the average-case analysis of some on-line algorithms for bin packing. Comb. 6(2): 179-200 (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 - 1985
- [j3]Peter W. Shor:
A Counterexample to the Triangle Conjecture. J. Comb. Theory A 38(1): 110-112 (1985) - 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) - [c2]Peter W. Shor:
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing. FOCS 1984: 193-200 - [c1]Jonathan F. Buss, Peter W. Shor:
On the Pagenumber of Planar Graphs. STOC 1984: 98-100 - 1982
- [j1]Peter W. Shor:
A Lower Bound for the Length of a Partial Transversal in a Latin Square. J. Comb. Theory A 33(1): 1-8 (1982)
Coauthor Index
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-10-30 20:34 CET 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:
