default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDon Coppersmith
Person information
- affiliation: IDA Center for Communications Research, Princeton, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j67]Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman, Jeffrey M. Vanderkam:
Ideal solutions in the Prouhet-Tarry-Escott problem. Math. Comput. 93(349): 2473-2501 (2023)
2010 – 2019
- 2012
- [j66]Don Coppersmith, Victor S. Miller:
Binary Nontiles. SIAM J. Discret. Math. 26(1): 30-38 (2012) - 2011
- [j65]Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu
, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang:
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60(2): 421-450 (2011) - [j64]Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu:
The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Trans. Algorithms 7(3): 37:1-37:22 (2011) - 2010
- [j63]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6(3): 55:1-55:13 (2010)
2000 – 2009
- 2009
- [i9]Don Coppersmith, Victor S. Miller:
Binary Non-tiles. CoRR abs/0911.1388 (2009) - 2008
- [j62]Don Coppersmith, Jean-Sébastien Coron, François Grieu, Shai Halevi, Charanjit S. Jutla, David Naccache, Julien P. Stern:
Cryptanalysis of ISO/IEC 9796-1. J. Cryptol. 21(1): 27-51 (2008) - [j61]Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin:
Robust reductions from ranking to classification. Mach. Learn. 72(1-2): 139-153 (2008) - [j60]Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj:
Divisors in residue classes, constructively. Math. Comput. 77(261): 531-545 (2008) - [j59]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions. Random Struct. Algorithms 32(1): 49-70 (2008) - [j58]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38(3): 1157-1174 (2008) - 2007
- [c45]Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin:
Robust Reductions from Ranking to Classification. COLT 2007: 604-619 - 2006
- [j57]Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski:
Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4(2): 324-335 (2006) - [j56]Don Coppersmith, Michael Elkin:
Sparse Sourcewise and Pairwise Distance Preservers. SIAM J. Discret. Math. 20(2): 463-501 (2006) - [c44]Nikhil Bansal, Don Coppersmith, Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM 2006: 27-38 - [c43]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling. SODA 2006: 344-353 - [c42]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA 2006: 776-782 - 2005
- [j55]Don Coppersmith, Jon Lee:
Parsimonious binary-encoding in integer programming. Discret. Optim. 2(3): 190-200 (2005) - [j54]Don Coppersmith, Moshe Lewenstein:
Constructive Bounds on Ordered Factorizations. SIAM J. Discret. Math. 19(2): 301-303 (2005) - [j53]Béla Bollobás, Don Coppersmith, Michael Elkin:
Sparse Distance Preservers and Additive Spanners. SIAM J. Discret. Math. 19(4): 1029-1055 (2005) - [c41]Don Coppersmith, Michael Elkin:
Sparse source-wise and pair-wise distance preservers. SODA 2005: 660-669 - [i8]Don Coppersmith, Atri Rudra:
On the Robust Testability of Product of Codes. Electron. Colloquium Comput. Complex. TR05 (2005) - [i7]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j52]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. Random Struct. Algorithms 24(4): 502-545 (2004) - [c40]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. APPROX-RANDOM 2004: 273-285 - [c39]Don Coppersmith, Ravi Kumar:
An improved data stream algorithm for frequency moments. SODA 2004: 151-156 - [i6]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions. Electron. Colloquium Comput. Complex. TR04 (2004) - [i5]Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj:
Divisors in Residue Classes, Constructively. IACR Cryptol. ePrint Arch. 2004: 339 (2004) - 2003
- [c38]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. SODA 2003: 364-373 - [c37]Béla Bollobás, Don Coppersmith, Michael Elkin:
Sparse distance preservers and additive spanners. SODA 2003: 414-423 - [c36]Don Coppersmith, Madhu Sudan:
Reconstructing curves in three (and higher) dimensional space from noisy data. STOC 2003: 136-142 - 2002
- [j51]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1): 1-13 (2002) - [c35]Don Coppersmith, Shai Halevi, Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002: 515-532 - [c34]Don Coppersmith, Markus Jakobsson:
Almost Optimal Hash Sequence Traversal. Financial Cryptography 2002: 102-119 - [c33]Shai Halevi, Don Coppersmith, Charanjit S. Jutla:
Scream: A Software-Efficient Stream Cipher. FSE 2002: 195-209 - [c32]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long range percolation graph. SODA 2002: 329-337 - [i4]Shai Halevi, Don Coppersmith, Charanjit S. Jutla:
Scream: a software-efficient stream cipher. IACR Cryptol. ePrint Arch. 2002: 19 (2002) - [i3]Don Coppersmith, Shai Halevi, Charanjit S. Jutla:
Cryptanalysis of stream ciphers with linear masking. IACR Cryptol. ePrint Arch. 2002: 20 (2002) - [i2]Don Coppersmith, Markus Jakobsson:
Almost Optimal Hash Sequence Traversal. IACR Cryptol. ePrint Arch. 2002: 23 (2002) - 2001
- [j50]Don Coppersmith:
Weakness in Quaternion Signatures. J. Cryptol. 14(2): 77-85 (2001) - [c31]Don Coppersmith:
Finding Small Solutions to Small Degree Polynomials. CaLC 2001: 20-31 - [c30]Don Coppersmith:
L Infinity Embeddings. RANDOM-APPROX 2001: 223-228 - 2000
- [j49]Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin:
Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. 104(1-3): 63-96 (2000) - [j48]Don Coppersmith:
Cryptography. IBM J. Res. Dev. 44(1): 246-250 (2000) - [j47]Don Coppersmith, Igor E. Shparlinski:
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptol. 13(3): 339-360 (2000) - [c29]Don Coppersmith, Rosario Gennaro, Shai Halevi, Charanjit S. Jutla, Stephen M. Matyas, Mohammad Peyravian, David Safford, Nevenko Zunic:
IBM Comments. AES Candidate Conference 2000: 333-336 - [c28]Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell:
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm. CRYPTO 2000: 184-196
1990 – 1999
- 1999
- [j46]Mohammad Peyravian, Don Coppersmith:
A structured symmetric-key block cipher. Comput. Secur. 18(2): 134-147 (1999) - [j45]Don Coppersmith, Se June Hong, Jonathan R. M. Hosking:
Partitioning Nominal Attributes in Decision Trees. Data Min. Knowl. Discov. 3(2): 197-217 (1999) - [j44]Don Coppersmith, Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations. J. Complex. 15(1): 17-29 (1999) - [j43]Don Coppersmith, Gregory B. Sorkin:
Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algorithms 15(2): 113-144 (1999) - [j42]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29(3): 697-711 (1999) - [c27]Don Coppersmith:
Weakness in Quaternion Signatures. CRYPTO 1999: 305-314 - [c26]Don Coppersmith, Frederick C. Mintzer, Charles Philippe Tresser, Chai Wah Wu, Minerva M. Yeung:
Fragile imperceptible digital watermark with privacy control. Security and Watermarking of Multimedia Contents 1999: 79-84 - 1998
- [j41]Don Coppersmith, James B. Shearer:
New Bounds for Union-free Families of Sets. Electron. J. Comb. 5 (1998) - [j40]Don Coppersmith:
Attacking Four-Round Luby-Rackoff Ciphers. Cryptologia 22(3): 266-278 (1998) - [j39]Phillip Rogaway, Don Coppersmith:
A Software-Optimized Encryption Algorithm. J. Cryptol. 11(4): 273-287 (1998) - [c25]Don Coppersmith:
Specialized Integer Factorization. EUROCRYPT 1998: 542-545 - [c24]Don Coppersmith, David A. Wagner, Bruce Schneier, John Kelsey:
Cryptanalysis of TWOPRIME. FSE 1998: 32-48 - [c23]Don Coppersmith, Gregory B. Sorkin:
Constructive Bounds and Exact Expectations for the Random Assignment Problem. RANDOM 1998: 319-330 - 1997
- [j38]Don Coppersmith, Chris L. Holloway, Stephen M. Matyas, Nevenko Zunic:
The data encryption standard. Inf. Secur. Tech. Rep. 2(2): 22-24 (1997) - [j37]Don Coppersmith:
Rectangular Matrix Multiplication Revisited. J. Complex. 13(1): 42-49 (1997) - [j36]Don Coppersmith, Jacques Stern, Serge Vaudenay:
The Security of the Birational Permutation Signature Schemes. J. Cryptol. 10(3): 207-221 (1997) - [j35]Don Coppersmith:
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. J. Cryptol. 10(4): 233-260 (1997) - [c22]Don Coppersmith, Adi Shamir:
Lattice Attacks on NTRU. EUROCRYPT 1997: 52-61 - [c21]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SODA 1997: 221-229 - 1996
- [j34]Robert J. Cimikowski, Don Coppersmith:
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discret. Math. 149(1-3): 303-309 (1996) - [j33]Don Coppersmith, Don B. Johnson, Stephen M. Matyas:
A proposed mode for triple-DES encryption. IBM J. Res. Dev. 40(2): 253-262 (1996) - [j32]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing in Optical Networks. J. ACM 43(6): 973-1001 (1996) - [j31]Don Coppersmith, Steven J. Phillips:
On a Question of Erdös on Subsequence Sums. SIAM J. Discret. Math. 9(2): 173-177 (1996) - [j30]Don Coppersmith, Uriel Feige, James B. Shearer:
Random Walks on Regular and Irregular Graphs. SIAM J. Discret. Math. 9(2): 301-308 (1996) - [j29]Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan:
Linearity testing in characteristic two. IEEE Trans. Inf. Theory 42(6): 1781-1795 (1996) - [c20]Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter:
Low-Exponent RSA with Related Messages. EUROCRYPT 1996: 1-9 - [c19]Don Coppersmith:
Finding a Small Root of a Univariate Modular Equation. EUROCRYPT 1996: 155-165 - [c18]Don Coppersmith:
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. EUROCRYPT 1996: 178-189 - 1995
- [c17]Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan:
Linearity Testing in Characteristic Two. FOCS 1995: 432-441 - [e1]Don Coppersmith:
Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings. Lecture Notes in Computer Science 963, Springer 1995, ISBN 3-540-60221-6 [contents] - 1994
- [j28]Don Coppersmith:
The Data Encryption Standard (DES) and its strength against attacks. IBM J. Res. Dev. 38(3): 243-250 (1994) - [j27]Don Coppersmith, Ephraim Feig, Elliot N. Linzer:
Hadamard transforms on multiply/add architectures. IEEE Trans. Signal Process. 42(4): 969-970 (1994) - [c16]Don Coppersmith:
Attack on the Cryptographic Scheme NIKS-TAS. CRYPTO 1994: 294-307 - [c15]Don Coppersmith, C. Andrew Neff:
Roots of a Polynomial and its Derivatives. SODA 1994: 271-279 - [c14]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing and Scheduling Algorithms for Optical Networks. SODA 1994: 412-423 - [c13]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
The minimum latency problem. STOC 1994: 163-171 - [i1]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
On the minimum latency problem. CoRR abs/math/9409223 (1994) - 1993
- [j26]Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir:
Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. ACM 40(3): 421-453 (1993) - [j25]Don Coppersmith:
Modifications to the Number Field Sieve. J. Cryptol. 6(3): 169-180 (1993) - [j24]Don Coppersmith, Prasad Tetali, Peter Winkler:
Collisions Among Random Walks on a Graph. SIAM J. Discret. Math. 6(3): 363-374 (1993) - [c12]Don Coppersmith, Hugo Krawczyk, Yishay Mansour:
The Shrinking Generator. CRYPTO 1993: 22-39 - [c11]Don Coppersmith, Jacques Stern, Serge Vaudenay:
Attacks on the Birational Permutation Signature Schemes. CRYPTO 1993: 435-443 - [c10]Phillip Rogaway, Don Coppersmith:
A Software-Optimised Encryption Algorithm. FSE 1993: 56-63 - 1992
- [c9]Don Coppersmith, Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary). FOCS 1992: 288-295 - 1990
- [j23]Don Coppersmith, Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9(3): 251-280 (1990) - [c8]Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir:
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). STOC 1990: 369-378
1980 – 1989
- 1989
- [j22]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average. Inf. Comput. 81(3): 318-333 (1989) - [j21]Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30(4): 205-208 (1989) - 1988
- [j20]Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko:
Balancing sets of vectors. IEEE Trans. Inf. Theory 34(1): 128-130 (1988) - 1987
- [j19]Don Coppersmith:
Cryptography. IBM J. Res. Dev. 31(2): 244-248 (1987) - [c7]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average. FOCS 1987: 260-269 - [c6]Don Coppersmith, Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions. STOC 1987: 1-6 - 1986
- [j18]Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel:
Discrete Logarithms in GF(p). Algorithmica 1(1): 1-15 (1986) - [j17]Don Coppersmith, Maria M. Klawe, Nicholas Pippenger:
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15(1): 189-192 (1986) - 1985
- [j16]Don Coppersmith, Uzi Vishkin:
Solving NP-hard problems in 'almost trees': Vertex cover. Discret. Appl. Math. 10(1): 27-45 (1985) - [j15]Don Coppersmith:
Each Four-Celled Animal Tiles the Plane. J. Comb. Theory A 40(2): 444-449 (1985) - [j14]Don Coppersmith, James H. Davenport:
An Application of Factoring. J. Symb. Comput. 1(2): 241-243 (1985) - [c5]Don Coppersmith:
Another Birthday Attack. CRYPTO 1985: 14-17 - [c4]Don Coppersmith:
Cheating at Mental Poker. CRYPTO 1985: 104-107 - [c3]Don Coppersmith:
The Real Reason for Rivest's Phenomenon. CRYPTO 1985: 535-536 - 1984
- [j13]Don Coppersmith, Gadiel Seroussi:
On the minimum distance of some quadratic residue codes. IEEE Trans. Inf. Theory 30(2): 407-411 (1984) - [j12]Don Coppersmith:
Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inf. Theory 30(4): 587-593 (1984) - [c2]Don Coppersmith:
Evaluating Logarithms in GF(2^n). STOC 1984: 201-207 - 1983
- [j11]Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg:
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. IEEE Trans. Computers 32(2): 190-194 (1983) - [j10]Inder S. Gopal, Don Coppersmith, C. K. Wong:
Optimal Wiring of Movable Terminals. IEEE Trans. Computers 32(9): 845-858 (1983) - [j9]Roy L. Adler, Don Coppersmith, Martin Hassner:
Algorithms for sliding block codes - An application of symbolic dynamics to information theory. IEEE Trans. Inf. Theory 29(1): 5-22 (1983) - 1982
- [j8]Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong:
Analysis of a General Mass Storage System. SIAM J. Comput. 11(1): 94-116 (1982) - [j7]Don Coppersmith:
Rapid Multiplication of Rectangular Matrices. SIAM J. Comput. 11(3): 467-471 (1982) - [j6]Don Coppersmith, Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput. 11(3): 472-492 (1982) - [j5]Inder S. Gopal, Don Coppersmith, C. K. Wong:
Minimizing Packet Waiting Time in a Multibeam Satellite System. IEEE Trans. Commun. 30(2): 305-316 (1982) - 1981
- [j4]Giancarlo Bongiovanni, Don Coppersmith, C. K. Wong:
An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders. IEEE Trans. Commun. 29(5): 721-726 (1981) - [c1]Don Coppersmith, Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary). FOCS 1981: 82-90
1970 – 1979
- 1976
- [j3]C. K. Wong, Don Coppersmith:
The Generation of Permutations in Magnetic Bubble Memories. IEEE Trans. Computers 25(3): 254-262 (1976) - 1975
- [j2]Don Coppersmith:
The Complement of Certain Recursively Defined Sets. J. Comb. Theory A 18(3): 243-251 (1975) - 1974
- [j1]C. K. Wong, Don Coppersmith:
A Combinatorial Problem Related to Multimodule Memory Organizations. J. ACM 21(3): 392-402 (1974)
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-07-09 21:07 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:
