default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarald Niederreiter
Person information
- affiliation: National University of Singapore
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j85]Jean-Paul Allouche, Guo-Niu Han, Harald Niederreiter:
Perfect linear complexity profile and apwenian sequences. Finite Fields Their Appl. 68: 101761 (2020)- [i4]Jean-Paul Allouche, Guo-Niu Han, Harald Niederreiter:
Perfect linear complexity profile and Apwenian sequences. CoRR abs/2008.12160 (2020)
2010 – 2019
- 2018
- [j84]Domingo Gómez-Pérez
, László Mérai, Harald Niederreiter:
On the Expansion Complexity of Sequences Over Finite Fields. IEEE Trans. Inf. Theory 64(6): 4228-4232 (2018) - 2017
- [j83]László Mérai, Harald Niederreiter, Arne Winterhof:
Expansion complexity and linear complexity of sequences over finite fields. Cryptogr. Commun. 9(4): 501-509 (2017) - [j82]Harald Niederreiter:
Recent constructions of low-discrepancy sequences. Math. Comput. Simul. 135: 18-27 (2017) - 2016
- [j81]Harald Niederreiter:
A survey of some applications of finite fields. Des. Codes Cryptogr. 78(1): 129-139 (2016) - [j80]Wilfried Meidl, Harald Niederreiter:
Multisequences with high joint nonlinear complexity. Des. Codes Cryptogr. 81(2): 337-346 (2016) - [j79]Peter Kritzer, Harald Niederreiter:
Mixed orthogonal arrays, -nets, and -sequences. Discret. Math. 339(9): 2199-2208 (2016) - 2015
- [j78]Peter Kritzer, Harald Niederreiter:
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences. J. Complex. 31(3): 457-473 (2015) - [j77]Michael Gnewuch, Frances Y. Kuo, Harald Niederreiter, Henryk Wozniakowski:
Guest Editors' Preface. J. Complex. 31(3): vi (2015) - 2014
- [j76]Harald Niederreiter, Chaoping Xing:
Sequences With High Nonlinear Complexity. IEEE Trans. Inf. Theory 60(10): 6696-6701 (2014) - [c26]Roswitha Hofer, Harald Niederreiter:
Vandermonde Nets and Vandermonde Sequences. MCQMC 2014: 87-105 - [c25]Colas Schretter, Zhijian He, Mathieu Gerber, Nicolas Chopin, Harald Niederreiter:
Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve. MCQMC 2014: 531-544 - [e2]Peter Kritzer, Harald Niederreiter, Friedrich Pillichshammer, Arne Winterhof:
Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications. Radon Series on Computational and Applied Mathematics 15, De Gruyter 2014, ISBN 978-3-11-031793-0 [contents] - [i3]Wilfried Meidl, Harald Niederreiter:
Multisequences with high joint nonlinear complexity. CoRR abs/1411.2348 (2014) - 2013
- [j75]Colas Schretter, Harald Niederreiter:
A direct inversion method for non-uniform quasi-random point sequences. Monte Carlo Methods Appl. 19(1): 1-9 (2013) - [p4]Harald Niederreiter:
LFSR sequences and maximal period sequences. Handbook of Finite Fields 2013: 311-316 - [p3]Harald Niederreiter:
(t, m, s)-nets and (t, s)-sequences. Handbook of Finite Fields 2013: 619-629 - [p2]Harald Niederreiter:
Algebraic-geometry codes. Handbook of Finite Fields 2013: 703-712 - [p1]Harald Niederreiter:
Finite Fields and Quasirandom Points. Finite Fields and Their Applications 2013: 169-196 - [i2]Harald Niederreiter, Chaoping Xing:
Sequences with high nonlinear complexity. CoRR abs/1312.1583 (2013) - 2012
- [j74]Harald Niederreiter, Michael Vielhaber, Li-Ping Wang:
Improved results on the probabilistic theory of the joint linear complexity of multisequences. Sci. China Inf. Sci. 55(1): 165-170 (2012) - [j73]Harald Niederreiter:
The independence of two randomness properties of sequences over finite fields. J. Complex. 28(2): 154-161 (2012) - 2010
- [j72]Ayineedi Venkateswarlu, Harald Niederreiter:
Improved results on periodic multisequences with large error linear complexity. Finite Fields Their Appl. 16(6): 463-476 (2010)
2000 – 2009
- 2009
- [j71]Fang-Wei Fu, Harald Niederreiter, Ferruh Özbudak:
Joint linear complexity of multisequences consisting of linear recurring sequences. Cryptogr. Commun. 1(1): 3-29 (2009) - [j70]Fang-Wei Fu, Harald Niederreiter, Ferruh Özbudak:
Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences. Finite Fields Their Appl. 15(4): 475-496 (2009) - [j69]Josef Dick, Harald Niederreiter:
Duality for digital sequences. J. Complex. 25(5): 406-414 (2009) - 2008
- [j68]Dirk Hachenberger, Harald Niederreiter, Chaoping Xing:
Function-field codes. Appl. Algebra Eng. Commun. Comput. 19(3): 201-211 (2008) - [j67]Harald Niederreiter, Ayineedi Venkateswarlu:
Periodic multisequences with large error linear complexity. Des. Codes Cryptogr. 49(1-3): 33-45 (2008) - [j66]Harald Niederreiter, Arne Winterhof:
Exponential sums for nonlinear recurring sequences. Finite Fields Their Appl. 14(1): 59-64 (2008) - [j65]Li-Ping Wang, Harald Niederreiter:
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. J. Complex. 24(2): 144-153 (2008) - [j64]Josef Dick, Harald Niederreiter:
On the exact t-value of Niederreiter and Sobol' sequences. J. Complex. 24(5-6): 572-581 (2008) - 2007
- [j63]Harald Niederreiter, Ferruh Özbudak:
Further improvements on asymptotic bounds for codes using distinguished divisors. Finite Fields Their Appl. 13(3): 423-443 (2007) - [j62]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
From the Editors. J. Complex. 23(1): 1 (2007) - [j61]Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu:
Error linear complexity measures for multisequences. J. Complex. 23(2): 169-192 (2007) - [j60]Fang-Wei Fu, Harald Niederreiter:
On the counting function of the lattice profile of periodic sequences. J. Complex. 23(4-6): 423-435 (2007) - [j59]Harald Niederreiter, Ferruh Özbudak:
Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields. SIAM J. Discret. Math. 21(4): 865-899 (2007) - [j58]Cunsheng Ding, Harald Niederreiter:
Cyclotomic Linear Codes of Order 3. IEEE Trans. Inf. Theory 53(6): 2274-2277 (2007) - [c24]Harald Niederreiter, Arne Winterhof:
On the Structure of Inversive Pseudorandom Number Generators. AAECC 2007: 208-216 - 2006
- [j57]San Ling, Harald Niederreiter, Patrick Solé:
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots. Des. Codes Cryptogr. 38(3): 337-361 (2006) - [j56]Claude Carlet, Cunsheng Ding, Harald Niederreiter:
Authentication Schemes from Highly Nonlinear Functions. Des. Codes Cryptogr. 40(1): 71-79 (2006) - [j55]Li-Ping Wang, Harald Niederreiter:
Enumeration results on the joint linear complexity of multisequences. Finite Fields Their Appl. 12(4): 613-637 (2006) - [j54]Harald Niederreiter:
Probability and computing: randomized algorithms and probabilistic analysis. Math. Comput. 75(255) (2006) - [c23]Claude Carlet, Cunsheng Ding, Harald Niederreiter:
Authentication Schemes from Highly Nonlinear Functions. ISIT 2006: 739-743 - [c22]Harald Niederreiter:
The Probabilistic Theory of the Joint Linear Complexity of Multisequences. SETA 2006: 5-16 - [c21]Fang-Wei Fu, Harald Niederreiter, Ming Su:
The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity. SETA 2006: 88-103 - 2005
- [j53]Harald Niederreiter, Arne Winterhof:
Cyclotomic R-orthomorphisms of finite fields. Discret. Math. 295(1-3): 161-171 (2005) - [j52]Harald Niederreiter:
Constructions of (t, m, s)-nets and (t, s)-sequences. Finite Fields Their Appl. 11(3): 578-600 (2005) - [j51]Fang-Wei Fu, Harald Niederreiter, Ming Su:
The expectation and variance of the joint linear complexity of random periodic multisequences. J. Complex. 21(6): 804-822 (2005) - [c20]Harald Niederreiter, Li-Ping Wang:
Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences. INDOCRYPT 2005: 13-22 - 2004
- [j50]Harald Niederreiter, Ferruh Özbudak:
Matrix-product constructions of digital nets. Finite Fields Their Appl. 10(3): 464-479 (2004) - [j49]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
From the Editors. J. Complex. 20(1): 1-2 (2004) - [j48]Harald Niederreiter, Chaoping Xing:
Disjoint Linear Codes From Algebraic Function Fields. IEEE Trans. Inf. Theory 50(9): 2174-2177 (2004) - [j47]Cunsheng Ding, Harald Niederreiter:
Systematic authentication codes from highly nonlinear functions. IEEE Trans. Inf. Theory 50(10): 2421-2428 (2004) - [c19]Harald Niederreiter, Arne Winterhof:
On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers. SETA 2004: 266-274 - 2003
- [j46]Wilfried Meidl, Harald Niederreiter:
Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. Appl. Algebra Eng. Commun. Comput. 14(4): 273-286 (2003) - [j45]Wilfried Meidl, Harald Niederreiter:
The expected value of the joint linear complexity of periodic multisequences. J. Complex. 19(1): 61-72 (2003) - [j44]Fred J. Hickernell, Harald Niederreiter:
The existence of good extensible rank-1 lattices. J. Complex. 19(3): 286-300 (2003) - [j43]Harald Niederreiter:
Some current issues in quasi-Monte Carlo methods. J. Complex. 19(3): 428-433 (2003) - [j42]Harald Niederreiter:
Periodic sequences with large k-error linear complexity. IEEE Trans. Inf. Theory 49(2): 501-505 (2003) - [c18]Harald Niederreiter, Igor E. Shparlinski:
Dynamical Systems Generated by Rational Functions. AAECC 2003: 6-17 - [c17]Harald Niederreiter, Igor E. Shparlinski:
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. IMACC 2003: 183-189 - [c16]Harald Niederreiter:
Linear Complexity and Related Complexity Measures for Sequences. INDOCRYPT 2003: 1-17 - 2002
- [j41]Harald Niederreiter, Arne Winterhof:
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers. Appl. Algebra Eng. Commun. Comput. 13(4): 319-326 (2002) - [j40]Wilfried Meidl, Harald Niederreiter:
Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. J. Complex. 18(1): 87-103 (2002) - [j39]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
2001 Best Paper Award. J. Complex. 18(3): 680- (2002) - [j38]Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing:
The minimum distance of the duals of binary irreducible cyclic codes. IEEE Trans. Inf. Theory 48(10): 2679-2689 (2002) - [j37]Wilfried Meidl, Harald Niederreiter:
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. IEEE Trans. Inf. Theory 48(11): 2817-2825 (2002) - 2001
- [j36]Harald Niederreiter, Arne Winterhof:
On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields. Appl. Algebra Eng. Commun. Comput. 12(3): 265-272 (2001) - [j35]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
ANNOUNCEMENT: 2000 Best Paper Award. J. Complex. 17(3): 494- (2001) - [j34]Harald Niederreiter, Gottlieb Pirsic:
The Microstructure of (t, m, s)-Nets. J. Complex. 17(4): 683-696 (2001) - [j33]Harald Niederreiter, Igor E. Shparlinski:
On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comput. 70(236): 1569-1574 (2001) - [j32]Harald Niederreiter, Arne Winterhof:
On a new class of inversive pseudorandom numbers for parallelized simulation methods. Period. Math. Hung. 42(1-2): 77-87 (2001) - 2000
- [j31]Harald Niederreiter, Igor E. Shparlinski:
On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. Appl. Algebra Eng. Commun. Comput. 10(3): 189-202 (2000) - [j30]Harald Niederreiter, Chaoping Xing:
A Propagation Rule for Linear Codes. Appl. Algebra Eng. Commun. Comput. 10(6): 425-432 (2000) - [j29]Cunsheng Ding, Harald Niederreiter, Chaoping Xing:
Some new codes from algebraic curves. IEEE Trans. Inf. Theory 46(7): 2638-2642 (2000)
1990 – 1999
- 1999
- [j28]Harald Niederreiter, Chaoping Xing, Kwok-Yan Lam:
A New Construction of Algebraic Geometry Codes. Appl. Algebra Eng. Commun. Comput. 9(5): 373-381 (1999) - [j27]Harald Niederreiter, Michael Vielhaber:
An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time. Theor. Comput. Sci. 226(1-2): 93-104 (1999) - [j26]Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:
Constructions of Algebraic-Geometry Codes. IEEE Trans. Inf. Theory 45(4): 1186-1193 (1999) - [j25]Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:
A generalization of algebraic-geometry codes. IEEE Trans. Inf. Theory 45(7): 2498-2501 (1999) - [c15]Frances Griffin, Harald Niederreiter, Igor E. Shparlinski:
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. AAECC 1999: 87-93 - [e1]Cunsheng Ding, Tor Helleseth, Harald Niederreiter:
Sequences and their Applications - Proceedings of SETA 1998, Singapore, December 14-17, 1998. Discrete Mathematics and Theoretical Computer Science, Springer 1999, ISBN 978-1-85233-196-2 [contents] - 1998
- [j24]Harald Niederreiter, Michael Vielhaber:
Simultaneous Shifted Continued Fraction Expansions in Quadratic Time. Appl. Algebra Eng. Commun. Comput. 9(2): 125-138 (1998) - [j23]Peter Hellekalek, Harald Niederreiter:
The Weighted Spectral Test: Diaphony. ACM Trans. Model. Comput. Simul. 8(1): 43-60 (1998) - [c14]Harald Niederreiter, Chaoping Xing:
A General Method of Constructing Global Function Fields. ANTS 1998: 555-566 - [c13]Harald Niederreiter:
Some Computable Complexity Measures for Binary Sequences. SETA 1998: 67-78 - [c12]Harald Niederreiter, Heike Paschinger:
Counting Functions and Expected Values in the Stability Theory of Stream Ciphers. SETA 1998: 318-329 - 1997
- [j22]Harald Niederreiter, Michael Vielhaber:
Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles. J. Complex. 13(3): 353-383 (1997) - [j21]Jürgen Eichenauer-Herrmann, Harald Niederreiter:
Inversive congruential pseudorandom numbers: distribution of triples. Math. Comput. 66(220): 1629-1644 (1997) - 1996
- [j20]Harald Niederreiter, Michael Vielhaber:
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences. J. Complex. 12(3): 187-198 (1996) - 1995
- [c11]Harald Niederreiter:
Some Linear and Nonlinear Methods for Pseudorandom Number Generation. WSC 1995: 250-254 - 1994
- [j19]Jürgen Eichenauer-Herrmann, Harald Niederreiter:
On the Statistical Independence of Nonlinear Congruential Pseudorandom Numbers. ACM Trans. Model. Comput. Simul. 4(1): 89-95 (1994) - [j18]Harald Niederreiter:
Pseudorandom Vector Generation by the Inverse Method. ACM Trans. Model. Comput. Simul. 4(2): 191-212 (1994) - [j17]Jürgen Eichenauer-Herrmann, Harald Niederreiter:
Digital Inversive Pseudorandom Numbers. ACM Trans. Model. Comput. Simul. 4(4): 339-349 (1994) - [j16]Paul Bratley, Bennett L. Fox, Harald Niederreiter:
Programs to generate Niederreiter's low-discrepancy sequences. ACM Trans. Math. Softw. 20(4): 494-495 (1994) - [c10]Rainer Göttfert, Harald Niederreiter:
General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences. EUROCRYPT 1994: 223-229 - 1993
- [j15]Harald Niederreiter:
A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields. Appl. Algebra Eng. Commun. Comput. 4: 81-87 (1993) - [j14]Harald Niederreiter:
Proof of Williams' Conjecture on Experimental Designs Balanced for Pairs of Interacting Residual Effects. Eur. J. Comb. 14(1): 55-58 (1993) - [j13]Harald Niederreiter:
Improved Error Bounds for Lattice Rules. J. Complex. 9(1): 60-75 (1993) - [j12]Harald Niederreiter, Rainer Göttfert:
Factorization of Polynomials over Finite Fields and Characteristic Sequences. J. Symb. Comput. 16(5): 401-412 (1993) - [j11]Harald Niederreiter, Claus-Peter Schnorr:
Local Randomness in Polynomial Random Number and Random Function Generators. SIAM J. Comput. 22(4): 684-694 (1993) - [c9]Rainer Göttfert, Harald Niederreiter:
On the Linear Complexity of Products of Shift-Register Sequences. EUROCRYPT 1993: 151-158 - 1992
- [b1]Harald Niederreiter:
Random number generation and Quasi-Monte Carlo methods. CBMS-NSF regional conference series in applied mathematics 63, SIAM 1992, ISBN 978-0-89871-295-7, pp. I-VI, 1-241 - [j10]Harald Niederreiter:
Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes. Discret. Math. 106-107: 361-367 (1992) - [j9]Paul Bratley, Bennett L. Fox, Harald Niederreiter:
Implementation and Tests of Low Discrepancy Sequences. ACM Trans. Model. Comput. Simul. 2(3): 195-213 (1992) - [c8]Harald Niederreiter, Claus-Peter Schnorr:
Local Randomness in Candidate One-Way Functions. EUROCRYPT 1992: 408-419 - [c7]Harald Niederreiter:
New methods for pseudorandom numbers and pseudorandom vector generation. WSC 1992: 264-269 - 1991
- [j8]Harald Niederreiter:
Recent trends in random number and random vector generation. Ann. Oper. Res. 31(1): 323-345 (1991) - [j7]Harald Niederreiter:
A combinatorial problem for vector spaces over finite fields. Discret. Math. 96(3): 221-228 (1991) - 1990
- [j6]Harald Niederreiter:
A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields. Appl. Algebra Eng. Commun. Comput. 1: 55-57 (1990) - [j5]Harald Niederreiter:
An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field. Appl. Algebra Eng. Commun. Comput. 1: 119-124 (1990) - [j4]Harald Niederreiter:
A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences. J. Cryptol. 2(2): 105-112 (1990) - [c6]Harald Niederreiter:
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. EUROCRYPT 1990: 174-188
1980 – 1989
- 1989
- [c5]Harald Niederreiter:
Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point. EUROCRYPT 1989: 523-532 - 1988
- [c4]Harald Niederreiter:
The Probabilistic Theory of Linear Complexity. EUROCRYPT 1988: 191-209 - 1987
- [j3]Gary L. Mullen, Harald Niederreiter:
Optimal characteristic polynomials for digital multistep pseudorandom numbers. Computing 39(2): 155-163 (1987) - [c3]Harald Niederreiter:
Sequences With Almost Perfect Linear Complexity Profile. EUROCRYPT 1987: 37-51 - 1986
- [c2]N. S. James, Rudolf Lidl, Harald Niederreiter:
Breaking the Cade Cipher. CRYPTO 1986: 60-63 - [i1]N. S. James, Rudolf Lidl, Harald Niederreiter:
A Cryptanalytic Attack on the CADE Cryptosystem. EUROCRYPT 1986: 27 - 1985
- [c1]Harald Niederreiter:
A Public-Key Cryptosystem based on Shift Register Sequences. EUROCRYPT 1985: 35-39
1970 – 1979
- 1979
- [j2]Harald Niederreiter, Kevin S. McCurley:
Optimization of functions by quasi-random search methods. Computing 22(2): 119-123 (1979) - 1977
- [j1]Harald Niederreiter:
Weights of Cyclic Codes. Inf. Control. 34(2): 130-140 (1977)
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-05-02 21:03 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:
