default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew M. Odlyzko
Person information
- affiliation: University of Minnesota, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j80]Jeffrey Johnson, Andrew M. Odlyzko:
Workings of science: Trust in science and mathematics. Ubiquity 2022(June): 1-9 (2022)
2010 – 2019
- 2019
- [j79]Peter J. Denning, Andrew M. Odlyzko:
An interview with Andrew Odlyzko on cyber security. Commun. ACM 62(9): 28-30 (2019) - [j78]Andrew M. Odlyzko:
Cybersecurity is not very important. Ubiquity 2019(June): 1-23 (2019) - 2017
- [j77]Andrew M. Odlyzko:
The glorious promise of the post-truth world. Ubiquity 2017(March): 2:1-2:7 (2017) - 2014
- [j76]Hong Yang, Elias W. Krumholz, Evan D. Brutinel, Nagendra P. Palani
, Michael J. Sadowsky, Andrew M. Odlyzko, Jeffrey A. Gralnick, Igor G. L. Libourel:
Genome-Scale Metabolic Network Validation of Shewanella oneidensis Using Transposon Insertion Frequency Analysis. PLoS Comput. Biol. 10(9) (2014) - [c38]Chris Hall, Dongting Yu, Zhi-Li Zhang, Jonathan Stout, Andrew M. Odlyzko, Andrew W. Moore, L. Jean Camp, Kevin Benton, Ross J. Anderson:
Collaborating with the Enemy on Network Management. Security Protocols Workshop 2014: 154-162 - [p3]Antoine Joux, Andrew M. Odlyzko, Cécile Pierrot:
The Past, Evolving Present, and Future of the Discrete Logarithm. Open Problems in Mathematics and Computational Science 2014: 5-36 - 2013
- [p2]Andrew M. Odlyzko:
Discrete logarithms over finite fields. Handbook of Finite Fields 2013: 393-400 - [i2]Andrew M. Odlyzko:
Open Access, library and publisher competition, and the evolution of general commerce. CoRR abs/1302.1105 (2013) - 2012
- [j75]Andrew M. Odlyzko:
Web history and economics. Comput. Networks 56(18): 3886-3890 (2012) - [j74]Ghaith A. Hiary, Andrew M. Odlyzko:
The zeta function on the critical line: Numerical evidence for moments and random matrix theory models. Math. Comput. 81(279): 1723-1752 (2012) - 2011
- [j73]Andrew M. Odlyzko:
Review: Experimental Mathematics in Action. A K Peters, Wellesley, MA, 2007. xii + 322 pp., ISBN 978-1-56881-271-7. $65. by D. H. Bailey, J. M. Borwein, N. J. Calkin, R. Girgensohn, D. R. Luke, and V. H. Moll. Am. Math. Mon. 118(10): 946-951 (2011) - [c37]Andrew M. Odlyzko:
Economics, QoS, and Charging in the Next Great Telecom Revolution. ICQT 2011: 1 - 2010
- [j72]Andrew M. Odlyzko:
Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland. Electron. Commer. Res. Appl. 9(1): 26-28 (2010) - [j71]Andrew M. Odlyzko:
Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information sciences. First Monday 15(9) (2010) - [j70]Deborah Estrin, K. Mani Chandy, Robert Michael Young, Larry Smarr, Andrew M. Odlyzko, David D. Clark, Viviane Reding, Toru Ishida, Sharad Sharma, Vinton G. Cerf, Urs Hölzle, Luiz André Barroso, Geoff Mulligan, Adrian Hooke, Chip Elliott:
Internet Predictions. IEEE Internet Comput. 14(1): 12-42 (2010) - [c36]Zhi-Li Zhang, Papak Nabipay, Andrew M. Odlyzko, Roch Guérin:
Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model. INFOCOM 2010: 46-50 - [c35]Andrew M. Odlyzko:
Providing security with insecure systems. WISEC 2010: 87-88
2000 – 2009
- 2008
- [c34]Andrew M. Odlyzko:
Economics and technology in the evolution of networks. CISS 2008 - 2007
- [c33]Andrew M. Odlyzko:
Privacy and the clandestine evolution of e-commerce. ICEC 2007: 3-6 - [c32]Andrew M. Odlyzko:
Digital rights management: desirable, inevitable, and almost irrelevant. Digital Rights Management Workshop 2007: 39-40 - 2006
- [j69]Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew M. Odlyzko, Julien P. Stern:
Index Calculation Attacks on RSA Signature and Encryption. Des. Codes Cryptogr. 38(1): 41-53 (2006) - 2004
- [p1]Andrew M. Odlyzko:
Privacy, Economics, and Price Discrimination on the Internet. Economics of Information Security 2004: 187-211 - 2003
- [j68]Andrew M. Odlyzko:
The many paradoxes of broadband. First Monday 8(9) (2003) - [c31]Andrew M. Odlyzko:
Privacy, economics, and price discrimination on the Internet. ICEC 2003: 355-366 - [c30]Andrew M. Odlyzko:
The Unsolvable Privacy Problem and Its Implications for Security Technologies. ACISP 2003: 51-54 - [c29]Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot:
Does Anyone Really Need MicroPayments? Financial Cryptography 2003: 69-76 - [c28]Andrew M. Odlyzko:
The Case Against Micropayments. Financial Cryptography 2003: 77-83 - [c27]Andrew M. Odlyzko:
Economics, Psychology, and Sociology of Security. Financial Cryptography 2003: 182-189 - 2002
- [j67]Andrew M. Odlyzko:
The rapid evolution of scholarly communication. Learn. Publ. 15(1): 7-19 (2002) - 2001
- [j66]Andrew M. Odlyzko:
Internet pricing and the history of communications. Comput. Networks 36(5/6): 493-517 (2001) - [j65]Andrew M. Odlyzko:
Content is Not King. First Monday 6(2) (2001) - 2000
- [j64]Andrew M. Odlyzko:
Discrete Logarithms: The Past and the Future. Des. Codes Cryptogr. 19(2/3): 129-145 (2000) - [j63]Peter C. Fishburn, Andrew M. Odlyzko:
Dynamic behavior of differential pricing and quality of service options for the internet. Decis. Support Syst. 28(1-2): 123-136 (2000) - [j62]Andrew M. Odlyzko:
The Internet and other networks: utilization rates and their implications. Inf. Econ. Policy 12(4): 341-365 (2000) - [j61]Andrew M. Odlyzko:
An improved bound for the de Bruijn-Newman constant. Numer. Algorithms 25(1-4): 293-303 (2000) - [c26]Andrew M. Odlyzko:
Integer Factorization and Discrete Logarithms (Abstract). LATIN 2000: 258 - [c25]Andrew M. Odlyzko:
Keynote Talk: Internet Charging. QofIS 2000: 360
1990 – 1999
- 1999
- [j60]Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald:
The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electron. J. Comb. 6 (1999) - [j59]Andrew M. Odlyzko, Michael Rubinstein, Marek Wolf:
Jumping Champions. Exp. Math. 8(2): 107-118 (1999) - [j58]Andrew M. Odlyzko:
The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances. First Monday 4(9) (1999) - [j57]Cliff Barney, Andrew M. Odlyzko:
Letters to the Editor. First Monday 4(10) (1999) - [c24]Andrew M. Odlyzko:
Paris metro pricing for the internet. EC 1999: 140-147 - [i1]Andrew M. Odlyzko:
Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals. CoRR cs.DL/9901009 (1999) - 1998
- [j56]Kerry Coffman, Andrew M. Odlyzko:
The Size and Growth Rate of the Internet. First Monday 3(10) (1998) - [j55]Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater:
Attacks on Shamir's 'RSA for Paranoids'. Inf. Process. Lett. 68(4): 197-199 (1998) - [j54]Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp:
An Optimal Acceptance Policy for an Urn Scheme. SIAM J. Discret. Math. 11(2): 183-195 (1998) - [c23]Peter C. Fishburn, Andrew M. Odlyzko:
Dynamic behavior of differential pricing and quality of service options for the Internet. ICE 1998: 128-139 - 1997
- [j53]Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders:
Monotonic subsequences in dimensions higher than one. Electron. J. Comb. 4(2) (1997) - [j52]Peter C. Fishburn, Andrew M. Odlyzko, Ryan C. Siders:
Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars. First Monday 2(7) (1997) - [j51]Andrew M. Odlyzko:
The Economics of Electronic Journals. First Monday 2(8) (1997) - [j50]Andrew M. Odlyzko:
Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries. Libr. Trends 46(1) (1997) - [c22]Andrew M. Odlyzko:
The slow evolution of electronic publishing. ELPUB 1997 - [c21]Stanislaw Jarecki, Andrew M. Odlyzko:
An Efficient Micropayment System Based on Probabilistic Polling. Financial Cryptography 1997: 173-192 - 1996
- [j49]Andrew M. Odlyzko:
Analytic methods in asymptotic enumeration. Discret. Math. 153(1-3): 229-238 (1996) - [j48]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. Fundam. Informaticae 28(3-4): 297-301 (1996) - [c20]Andrew M. Odlyzko:
Computer Algebra and its Applications: Where are we Going? GI Jahrestagung 1996: 33-41 - [c19]Andrew M. Odlyzko:
The bumpy road of Electronic Commerce. WebNet 1996 - 1995
- [j47]Andrew M. Odlyzko, Warren D. Smith:
Nonabelian sets with distinct k-sums. Discret. Math. 146(1-3): 169-177 (1995) - [j46]Andrew M. Odlyzko:
Tragic loss or good riddance? The impending demise of traditional scholarly journals. Int. J. Hum. Comput. Stud. 42(1): 71-122 (1995) - [j45]Andrew M. Odlyzko:
Search for the Maximum of a Random Walk. Random Struct. Algorithms 6(2/3): 275-296 (1995) - 1994
- [j44]Andrew M. Odlyzko:
Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals. J. Univers. Comput. Sci. 0(0): 3-52 (1994) - [j43]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang:
Minimal-distance routing for KYKLOS II. Networks 24(2): 103-108 (1994) - [j42]Albert G. Greenberg, Andrew M. Odlyzko, Jennifer Rexford, David Espinosa:
Fast Parallel Solution of Fixed Point Equations for the Performance Evaluation of Circuit-Switched Networks. Perform. Evaluation 20(1-3): 67-81 (1994) - [c18]Andrew M. Odlyzko:
Search for the maximum of a random walk. STOC 1994: 336-345 - 1993
- [j41]Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond:
The Distribution of Heights of Binary Trees and Other Simple Trees. Comb. Probab. Comput. 2: 145-156 (1993) - 1992
- [j40]Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern:
Improved Low-Density Subset Sum Algorithms. Comput. Complex. 2: 111-128 (1992) - [c17]Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid:
The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). EUROCRYPT 1992: 194-199 - [c16]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. ISSAC 1992: 117-122 - 1991
- [j39]Brian A. LaMacchia, Andrew M. Odlyzko:
Computation of Discrete Logarithms in Prime Fields. Des. Codes Cryptogr. 1(1): 47-62 (1991) - [c15]Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr:
An Improved Low-Denisty Subset Sum Algorithm. EUROCRYPT 1991: 54-67 - 1990
- [j38]Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman:
On the number of alignments of k sequences. Graphs Comb. 6(2): 133-146 (1990) - [j37]Philippe Flajolet, Andrew M. Odlyzko:
Singularity Analysis of Generating Functions. SIAM J. Discret. Math. 3(2): 216-240 (1990) - [c14]Brian A. LaMacchia, Andrew M. Odlyzko:
Solving Large Sparse Linear Systems over Finite Fields. CRYPTO 1990: 109-133 - [c13]Brian A. LaMacchia, Andrew M. Odlyzko:
Computation of Discrete Logarithms in Prime Fields (Extended Abstract). CRYPTO 1990: 616-618
1980 – 1989
- 1989
- [c12]Philippe Flajolet, Andrew M. Odlyzko:
Random Mapping Statistics. EUROCRYPT 1989: 329-354 - 1988
- [j36]Eric Goles, Andrew M. Odlyzko:
Decreasing Energy Functions and Lengths of Transients for Some Cellular Automata. Complex Syst. 2(5) (1988) - [j35]Andrew M. Odlyzko:
On subspaces spanned by random selections of plus/minus 1 vectors. J. Comb. Theory A 47(1): 124-133 (1988) - [j34]Ernest F. Brickell, Andrew M. Odlyzko:
Cryptanalysis: a survey of recent results. Proc. IEEE 76(5): 578-593 (1988) - [j33]Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko:
Balancing sets of vectors. IEEE Trans. Inf. Theory 34(1): 128-130 (1988) - [j32]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko:
Simple, Efficient Asynchronous Parallel Algorithms for Maximization. ACM Trans. Program. Lang. Syst. 10(2): 313-337 (1988) - 1987
- [j31]Andrew M. Odlyzko, Dana Randall:
On the Periods of Some Graph Transformations. Complex Syst. 1(1) (1987) - [j30]Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
Ramsey-Sperner theory. Discret. Math. 63(2-3): 143-152 (1987) - [j29]J. C. Lagarias, Andrew M. Odlyzko:
Computing pi(x): An Analytic Method. J. Algorithms 8(2): 173-191 (1987) - [j28]Andrew M. Odlyzko, Herbert S. Wilf:
Bandwidths and profiles of trees. J. Comb. Theory B 42(3): 348-370 (1987) - [c11]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang:
Minimal-Distance Routing for Kykios II. ICPP 1987: 546-549 - [e1]Andrew M. Odlyzko:
Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings. Lecture Notes in Computer Science 263, Springer 1987 [contents] - 1986
- [j27]Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel:
Discrete Logarithms in GF(p). Algorithmica 1(1): 1-15 (1986) - [j26]J. C. Lagarias, Andrew M. Odlyzko, Don Zagier:
On the Capacity of Disjointly Shared Networks. Comput. Networks 10: 275-285 (1986) - [j25]Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
k-Color Sperner theorems. J. Comb. Theory A 42(1): 31-54 (1986) - [j24]Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay:
Constant Time Generation of Free Trees. SIAM J. Comput. 15(2): 540-548 (1986) - [j23]Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg:
On the existence of optimum cyclic burst-correcting codes. IEEE Trans. Inf. Theory 32(6): 768-775 (1986) - 1985
- [j22]Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky:
Partitions of planar sets into small triangles. Discret. Math. 57(1-2): 89-97 (1985) - [j21]Edward A. Bender, Andrew M. Odlyzko, L. Bruce Richmond:
The Asymptotic Number of Irreducible Partitions. Eur. J. Comb. 6(1): 1-6 (1985) - [j20]J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. J. ACM 32(1): 229-246 (1985) - [j19]Andrew M. Odlyzko, L. Bruce Richmond:
On the Number of Distinct Block Sizes in Partitions of a Set. J. Comb. Theory A 38(2): 170-181 (1985) - [c10]Yvo Desmedt, Andrew M. Odlyzko:
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. CRYPTO 1985: 516-522 - [c9]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko:
Simple, Efficient Asynchronous Parallel Algorithms for Maximization. PODC 1985: 300-308 - 1984
- [j18]Andrew M. Odlyzko:
Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme. IEEE Trans. Inf. Theory 30(4): 594-600 (1984) - [c8]Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret:
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. EUROCRYPT 1984: 142-149 - [c7]Andrew M. Odlyzko:
Discrete Logarithms in Finite Fields and Their Cryptographic Significance. EUROCRYPT 1984: 224-314 - 1983
- [j17]Benjamin F. Logan, James E. Mazo, Andrew M. Odlyzko, Larry A. Shepp:
On the average product of Gauss-Markov variables. Bell Syst. Tech. J. 62(10): 2993-3006 (1983) - [j16]Peter Frankl, Andrew M. Odlyzko:
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer. Eur. J. Comb. 4(3): 215-220 (1983) - [j15]Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Tightest Packing of Sums of Vectors. Eur. J. Comb. 4(3): 231-236 (1983) - [j14]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. J. Comb. Theory A 34(2): 123-139 (1983) - [c6]Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko:
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO 1983: 39-42 - [c5]J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. FOCS 1983: 1-10 - 1982
- [j13]Andrew M. Odlyzko, L. Bruce Richmond:
On the Unimodality of some Partition Polynomials. Eur. J. Comb. 3(1): 69-84 (1982) - [j12]Philippe Flajolet, Andrew M. Odlyzko:
The Average Height of Binary Trees and Other Simple Trees. J. Comput. Syst. Sci. 25(2): 171-213 (1982) - [j11]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. J. Comb. Theory A 33(2): 167-185 (1982) - 1981
- [j10]Leonidas J. Guibas, Andrew M. Odlyzko:
Periods in Strings. J. Comb. Theory A 30(1): 19-42 (1981) - [j9]Leonidas J. Guibas, Andrew M. Odlyzko:
String Overlaps, Pattern Matching, and Nontransitive Games. J. Comb. Theory A 30(2): 183-208 (1981) - [c4]Leonard M. Adleman, Andrew M. Odlyzko:
Irreducibility Testing and Factorization of Polynomials (Extended Abstract). FOCS 1981: 409-418 - 1980
- [j8]Leonidas J. Guibas, Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. SIAM J. Comput. 9(4): 672-682 (1980) - [c3]Philippe Flajolet, Andrew M. Odlyzko:
Exploring Binary Trees and Other Simple Trees. FOCS 1980: 207-216
1970 – 1979
- 1979
- [j7]Andrew M. Odlyzko, Neil J. A. Sloane:
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions. J. Comb. Theory A 26(2): 210-214 (1979) - [c2]Allen Gersho, B. Gopinath, Andrew M. Odlyzko:
Coefficient inaccuracy in FIR filters. ICASSP 1979: 375-377 - 1978
- [j6]F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward:
Self-Dual Codes over GF(4). J. Comb. Theory A 25(3): 288-318 (1978) - [j5]Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane:
Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24(1): 81-93 (1978) - 1977
- [j4]F. Jessie MacWilliams, Andrew M. Odlyzko:
Pelikán's Conjecture Cyclotomic Cosets. J. Comb. Theory A 22(1): 110-114 (1977) - [c1]Leonidas J. Guibas, Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. FOCS 1977: 189-195 - 1975
- [j3]Colin L. Mallows, Andrew M. Odlyzko, Neil J. A. Sloane:
An upper bound for self-dual codes (Corresp.). IEEE Trans. Inf. Theory 21(1): 115 (1975) - 1974
- [j2]Anthony M. Kerdock, F. Jessie MacWilliams, Andrew M. Odlyzko:
A new theorem about the Mattson-Solomon polynomial, and some applications. IEEE Trans. Inf. Theory 20(1): 85-89 (1974) - 1973
- [j1]Andrew M. Odlyzko:
On covering a product of sets with products of their subsets. Discret. Math. 5(4): 373-380 (1973)
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 2025-01-21 00:00 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:
