default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim von zur Gathen
Person information
- affiliation: University of Bonn, Germany
- affiliation: University of Paderborn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j65]Joachim von zur Gathen, Guillermo Matera:
Interpolation by decomposable univariate polynomials. J. Complex. 85: 101885 (2024)- 2023
- [j64]Joachim von zur Gathen:
Unicity distance of the Zodiac-340 cipher. Cryptologia 47(5): 474-488 (2023) - 2022
- [j63]Joachim von zur Gathen, Guillermo Matera:
Shifted varieties and discrete neighborhoods around varieties. J. Symb. Comput. 109: 31-49 (2022) - [c55]Joachim von zur Gathen:
Unicity Distance of the Zodiac-340 Cipher. HistoCrypt 2022: 91-100 - 2021
- [j62]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput. 105: 214-233 (2021) - [i9]Joachim von zur Gathen, Guillermo Matera:
Interpolation by decomposable univariate polynomials. CoRR abs/2103.15926 (2021) - [i8]Joachim von zur Gathen:
Unicity distance of the Zodiac-340 cipher. IACR Cryptol. ePrint Arch. 2021: 1620 (2021) - 2020
- [j61]Lucas Boppre Niehues, Joachim von zur Gathen, Lucas Pandolfo Perin, Ana Zumalacárregui:
Sidon sets and statistics of the ElGamal function. Cryptologia 44(5): 438-450 (2020)
2010 – 2019
- 2019
- [j60]Joachim von zur Gathen:
Iteration entropy. Math. Comput. 88(318): 1991-2003 (2019) - [c54]Juan José Cabezas, Francisco Castro, Joachim von zur Gathen, Jorge Tiscornia, Alfredo Viola:
Uruguayan Cryptography: Printed Book Covers. HistoCrypt 2019: 158:007 - [i7]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. CoRR abs/1912.00212 (2019) - 2018
- [j59]Joachim von zur Gathen, Daniel Loebenberger:
Why One Cannot Estimate the Entropy of English by Sampling. J. Quant. Linguistics 25(1): 77-106 (2018) - [c53]Juan José Cabezas, Joachim von zur Gathen, Jorge Tiscornia:
Uruguayan Cryptographic Carpet. HistoCrypt 2018: 149:009 - [i6]Joachim von zur Gathen, Guillermo Matera:
Shifted varieties and discrete neighborhoods around varieties. CoRR abs/1812.07020 (2018) - 2015
- [b3]Joachim von zur Gathen:
CryptoSchool. Springer 2015, ISBN 978-3-662-48423-4, pp. 1-888 - [j58]Joachim von zur Gathen:
Counting Decomposable Univariate Polynomials. Comb. Probab. Comput. 24(1): 294-328 (2015) - [j57]Joachim von zur Gathen, Igor E. Shparlinski
:
Circulant graphs and GCD and LCM of subsets. Inf. Process. Lett. 115(2): 134-138 (2015) - [p2]Joachim von zur Gathen, Konstantin Ziegler:
Survey on Counting Special Types of Polynomials. Computer Algebra and Polynomials 2015: 50-75 - 2014
- [j56]Joachim von zur Gathen:
Normal form for Ritt's Second Theorem. Finite Fields Their Appl. 27: 41-71 (2014) - [i5]Joachim von zur Gathen, Igor E. Shparlinski:
Circulant graphs and GCD and LCM of Subsets. CoRR abs/1402.5449 (2014) - [i4]Joachim von zur Gathen, Konstantin Ziegler:
Survey on counting special types of polynomials. CoRR abs/1407.2970 (2014) - 2013
- [b2]Joachim von zur Gathen, Jürgen Gerhard:
Modern Computer Algebra (3. ed.). Cambridge University Press 2013, ISBN 978-1-107-03903-2, pp. I-XIII, 1-795 - [j55]Joachim von zur Gathen, Igor E. Shparlinski:
Generating safe primes. J. Math. Cryptol. 7(4): 333-365 (2013) - [j54]Joachim von zur Gathen:
Lower bounds for decomposable univariate wild polynomials. J. Symb. Comput. 50: 409-430 (2013) - [j53]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. J. Symb. Comput. 59: 113-145 (2013) - [j52]Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler:
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. SIAM J. Discret. Math. 27(2): 855-891 (2013) - [p1]Joachim von zur Gathen:
Factorization of univariate polynomials. Handbook of Finite Fields 2013: 380-381 - 2012
- [j51]Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond:
Interval Partitions and Polynomial Factorization. Algorithmica 63(1-2): 363-397 (2012) - [c52]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. ISSAC 2012: 91-98 - [i3]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. CoRR abs/1202.5810 (2012) - 2011
- [j50]Joachim von zur Gathen:
Counting decomposable multivariate polynomials. Appl. Algebra Eng. Commun. Comput. 22(3): 165-185 (2011) - 2010
- [j49]Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski:
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45(8): 879-886 (2010) - [c51]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials: statement of results. ISSAC 2010: 123-130 - [c50]Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret:
Decomposition of generic multivariate polynomials. ISSAC 2010: 131-137 - [c49]Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler:
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. LATIN 2010: 243-254 - [i2]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials. CoRR abs/1005.1087 (2010)
2000 – 2009
- 2009
- [j48]Joachim von zur Gathen, Igor E. Shparlinski:
Subset sum pseudorandom numbers: fast generation and distribution. J. Math. Cryptol. 3(2): 149-163 (2009) - [c48]Joachim von zur Gathen:
The number of decomposable univariate polynomials. extended abstract. ISSAC 2009: 359-366 - 2008
- [j47]Joachim von zur Gathen:
Counting reducible and singular bivariate polynomials. Finite Fields Their Appl. 14(4): 944-978 (2008) - [c47]Joachim von zur Gathen, Igor E. Shparlinski:
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283 - [e1]Joachim von zur Gathen, José Luis Imaña, Çetin Kaya Koç:
Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings. Lecture Notes in Computer Science 5130, Springer 2008, ISBN 978-3-540-69498-4 [contents] - 2007
- [j46]Joachim von zur Gathen:
Zimmermann Telegram: The Original Draft. Cryptologia 31(1): 2-37 (2007) - [c46]Joachim von zur Gathen:
Counting reducible and singular bivariate polynomials. ISSAC 2007: 369-376 - [c45]Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi:
Efficient Multiplication Using Type 2 Optimal Normal Bases. WAIFI 2007: 55-68 - [i1]Laila El Aimani, Joachim von zur Gathen:
Finding Low Weight Polynomial Multiples Using Lattices. IACR Cryptol. ePrint Arch. 2007: 423 (2007) - 2006
- [j45]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006) - [c44]Joachim von zur Gathen:
Who was who in polynomial factorization: 1. ISSAC 2006: 2 - [c43]Joachim von zur Gathen, Jamshid Shokrollahi:
Fast arithmetic for polynomials over F2in hardware. ITW 2006: 107-111 - 2005
- [j44]Joachim von zur Gathen, Michael Nöcker:
Polynomial and Normal Bases for Finite Fields. J. Cryptol. 18(4): 337-355 (2005) - [c42]Joachim von zur Gathen, Jamshid Shokrollahi:
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. Selected Areas in Cryptography 2005: 359-369 - 2004
- [j43]Joachim von zur Gathen:
Friederich Johann buck: Arithmetic Puzzles in Cryptography. Cryptologia 28(4): 309-324 (2004) - [j42]Joachim von zur Gathen, Michael Nöcker:
Computing special powers in finite fields. Math. Comput. 73(247): 1499-1523 (2004) - [j41]Joachim von zur Gathen, Michael Nöcker:
Fast arithmetic with general Gauß periods. Theor. Comput. Sci. 315(2-3): 419-452 (2004) - [c41]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Forms. ISAAC 2004: 464-469 - [c40]Joachim von zur Gathen:
Arithmetic Circuits for Discrete Logarithms. LATIN 2004: 557-566 - [c39]Joachim von zur Gathen, Igor E. Shparlinski:
Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251 - [c38]Joachim von zur Gathen, Igor E. Shparlinski:
Polynomial interpolation from multiples. SODA 2004: 1132-1137 - 2003
- [b1]Joachim von zur Gathen, Jürgen Gerhard:
Modern computer algebra (2. ed.). Cambridge University Press 2003, ISBN 978-0-521-82646-4, pp. I-XIII, 1-785 - [j40]Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio:
Multivariate Polynomial Decomposition. Appl. Algebra Eng. Commun. Comput. 14(1): 11-31 (2003) - [j39]Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski:
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12(1-2): 23-47 (2003) - [j38]Joachim von zur Gathen:
Claude Comiers: the First Arithmetical Cryptography. Cryptologia 27(4): 339-349 (2003) - [j37]Joachim von zur Gathen:
Irreducible trinomials over finite fields. Math. Comput. 72(244): 1987-2000 (2003) - [j36]Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003) - [j35]Joachim von zur Gathen, Thomas Lücking:
Subresultants revisited. Theor. Comput. Sci. 297(1-3): 199-239 (2003) - [c37]Cornelia Grabbe, Marcus Bednara, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich:
A High Performance VLIW Processor for Finite Field Arithmetic. IPDPS 2003: 189 - [c36]Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi:
FPGA designs of parallel high performance GF(2233) multipliers. ISCAS (2) 2003: 268-271 - [c35]Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski:
An authentication scheme based on roots of sparse polynomials. ITW 2003: 159-162 - 2002
- [j34]Joachim von zur Gathen, Jürgen Gerhard:
Polynomial factorization over F2. Math. Comput. 71(240): 1677-1698 (2002) - [c34]Marcus Bednara, M. Daldrup, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich:
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. IPDPS 2002 - [c33]Marcus Bednara, M. Daldrup, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi:
Tradeoff analysis of FPGA based elliptic curve cryptography. ISCAS (5) 2002: 797-800 - 2001
- [j33]Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller:
Factoring a binary polynomial of degree over one million. SIGSAM Bull. 35(1): 16-18 (2001) - [j32]Joachim von zur Gathen, Daniel Panario:
Factoring Polynomials Over Finite Fields: A Survey. J. Symb. Comput. 31(1/2): 3-17 (2001) - [c32]Joachim von zur Gathen:
Irreducible trinomials over finite fields. ISSAC 2001: 332-336 - 2000
- [j31]Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup:
Algorithms for Exponentiation in Finite Fields. J. Symb. Comput. 29(6): 879-889 (2000) - [j30]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000) - [c31]Joachim von zur Gathen, Thomas Lücking:
Subresultants Revisited. LATIN 2000: 318-342
1990 – 1999
- 1999
- [j29]Sandra Feisel, Joachim von zur Gathen, Amin Shokrollahi:
Normal bases via general Gauss periods. Math. Comput. 68(225): 271-290 (1999) - [c30]Joachim von zur Gathen, Igor E. Shparlinski:
Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409 - [c29]Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio:
On Multivariate Polynomial Decomposition. CASC 1999: 463-478 - [c28]Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas:
GCD of Many Integers. COCOON 1999: 310-317 - [c27]Joachim von zur Gathen, Michael Nöcker:
Computing Special Powers in Finite Fields (extended abstract). ISSAC 1999: 83-90 - 1998
- [j28]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998) - [j27]Joachim von zur Gathen, Silke Hartlieb:
Factoring Modular Polynomials. J. Symb. Comput. 26(5): 583-606 (1998) - [j26]Shuhong Gao, Joachim von zur Gathen, Daniel Panario:
Gauss periods: orders and cryptographical applications. Math. Comput. 67(221): 343-352 (1998) - [j25]Joachim von zur Gathen, Igor E. Shparlinski:
Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998) - [c26]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315 - 1997
- [j24]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting Curves and Their Projections. Comput. Complex. 6(1): 64-99 (1997) - [j23]Joachim von zur Gathen, James R. Roche:
Polynomials with two Values. Comb. 17(3): 345-362 (1997) - [c25]Joachim von zur Gathen, Michael Nöcker:
Exponentiation in Finite Fields: Theory and Practice. AAECC 1997: 88-113 - [c24]Joachim von zur Gathen, Jürgen Gerhard:
Fast Algorithms for Taylor Shifts and Certain Difference Equations. ISSAC 1997: 40-47 - 1996
- [c23]Joachim von zur Gathen, Jürgen Gerhard:
Arithmetic and Factorization of Polynomial Over F2 (extended abstract). ISSAC 1996: 1-9 - [c22]Joachim von zur Gathen, Silke Hartlieb:
Factoring Modular Polynomials (extended abstract). ISSAC 1996: 10-17 - 1995
- [j22]Keju Ma, Joachim von zur Gathen:
The Computational Complexity of Recognizing Permutation Functions. Comput. Complex. 5(1): 76-97 (1995) - [j21]Joachim von zur Gathen, Jürgen Weiss:
Homogeneous Bivariate Decompositions. J. Symb. Comput. 19(5): 409-434 (1995) - [c21]Joachim von zur Gathen, Igor E. Shparlinski:
Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292 - [c20]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215 - [c19]Shuhong Gao, Joachim von zur Gathen, Daniel Panario:
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). LATIN 1995: 311-322 - 1994
- [c18]Joachim von zur Gathen, Igor E. Shparlinski:
Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305 - [c17]Keju Ma, Joachim von zur Gathen:
The computational complexity of recognizing permutation functions. STOC 1994: 392-401 - 1993
- [c16]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting curves and their projections. STOC 1993: 805-812 - 1992
- [j20]Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials. Comput. Complex. 2: 187-224 (1992) - [j19]Joachim von zur Gathen:
A polynomial factorization challenge. SIGSAM Bull. 26(2): 22-24 (1992) - [j18]Joachim von zur Gathen:
Processor-Efficient Exponentiation in Finite Fields. Inf. Process. Lett. 41(2): 81-86 (1992) - [c15]Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract). STOC 1992: 97-105 - 1991
- [j17]Joachim von zur Gathen:
Efficient and Optimal Exponentiation in Finite Fields. Comput. Complex. 1: 360-394 (1991) - [j16]Joachim von zur Gathen, Gadiel Seroussi:
Boolean Circuits Versus Arithmetic Circuits. Inf. Comput. 91(1): 142-154 (1991) - [j15]Joachim von zur Gathen:
Tests for Permutation Polynomials. SIAM J. Comput. 20(3): 591-602 (1991) - [c14]Joachim von zur Gathen:
Efficient Exponentiation in Finite Fields (Extended Abstract). FOCS 1991: 384-391 - 1990
- [j14]Joachim von zur Gathen:
Inversion in Finite Fields Using Logarithmic Depth. J. Symb. Comput. 9(2): 175-183 (1990) - [j13]Joachim von zur Gathen:
Functional Decomposition of Polynomials: The Tame Case. J. Symb. Comput. 9(3): 281-299 (1990) - [j12]Keju Ma, Joachim von zur Gathen:
Analysis of Euclidean Algorithms for Polynomials over Finite Fields. J. Symb. Comput. 9(4): 429-455 (1990) - [j11]Joachim von zur Gathen:
Functional Decomposition of Polynomials: The Wild Case. J. Symb. Comput. 10(5): 437-452 (1990) - [j10]Joachim von zur Gathen, Mark Giesbrecht:
Constructing Normal Bases in Finite Fields. J. Symb. Comput. 10(6): 547-570 (1990) - [c13]Joachim von zur Gathen:
Polynomials over Finite Fields with Large Images. ISSAC 1990: 140-144
1980 – 1989
- 1989
- [c12]Joachim von zur Gathen:
Testing Permutation Polynomials (Extended Abstract). FOCS 1989: 88-92 - 1987
- [j9]Joachim von zur Gathen:
Feasible Arithmetic Computations: Valiant's Hypothesis. J. Symb. Comput. 4(2): 137-172 (1987) - [j8]Joachim von zur Gathen:
Computing Powers in Parallel. SIAM J. Comput. 16(5): 930-945 (1987) - [j7]Joachim von zur Gathen:
Factoring Polynomials and Primitive Elements for Special Primes. Theor. Comput. Sci. 52: 77-89 (1987) - [c11]Joachim von zur Gathen, Dexter Kozen, Susan Landau:
Functional Decomposition of Polynomials. FOCS 1987: 127-131 - 1986
- [j6]Joachim von zur Gathen:
Representations and Parallel Computations for Rational Functions. SIAM J. Comput. 15(2): 432-452 (1986) - [c10]Joachim von zur Gathen:
Permanent and Determinant. FOCS 1986: 398-401 - [c9]Joachim von zur Gathen:
Irreducible Polynomials over Finite Fields. FSTTCS 1986: 252-262 - [c8]Joachim von zur Gathen:
Parallel Arithmetic Computations: A Survey. MFCS 1986: 93-112 - 1985
- [j5]Joachim von zur Gathen:
Irreducibility of Multivariate Polynomials. J. Comput. Syst. Sci. 31(2): 225-264 (1985) - [j4]Joachim von zur Gathen, Erich L. Kaltofen:
Factoring Sparse Multivariate Polynomials. J. Comput. Syst. Sci. 31(2): 265-287 (1985) - 1984
- [j3]Joachim von zur Gathen:
Parallel Algorithms for Algebraic Problems. SIAM J. Comput. 13(4): 802-824 (1984) - [c7]Joachim von zur Gathen:
Parallel Powering. FOCS 1984: 31-36 - 1983
- [c6]Joachim von zur Gathen:
Representations of Rational Functions. FOCS 1983: 133-137 - [c5]Joachim von zur Gathen:
Factoring Sparse Multivariate Polynomials. FOCS 1983: 172-179 - [c4]Joachim von zur Gathen, Erich L. Kaltofen:
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP 1983: 250-263 - [c3]Joachim von zur Gathen:
Parallel algorithms for algebraic problems. STOC 1983: 17-23 - 1982
- [j2]Allan Borodin, Joachim von zur Gathen, John E. Hopcroft:
Fast Parallel Matrix and GCD Computations. Inf. Control. 52(3): 241-256 (1982) - [c2]Allan Borodin, Joachim von zur Gathen, John E. Hopcroft:
Fast Parallel Matrix and GCD Computations. FOCS 1982: 65-71 - 1980
- [j1]Joachim von zur Gathen, Volker Strassen:
Some Polynomials that are Hard to Compute. Theor. Comput. Sci. 11: 331-335 (1980)
1970 – 1979
- 1976
- [c1]Joachim von zur Gathen, Malte Sieveking:
Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben. Komplexität von Entscheidungsproblemen 1976 1976: 49-71
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-08-10 01:23 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:
