default search action
Bruno Salvy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j57]Vincent Neiger
, Bruno Salvy
Faster Modular Composition. J. ACM 71(2): 11:1-11:79 (2024) - [j56]Hadrien Brochet, Bruno Salvy
Reduction-based creative telescoping for definite summation of D-finite functions. J. Symb. Comput. 125: 102329 (2024) - [c31]Alaa Ibrahim, Bruno Salvy:
Positivity Certificates for Linear Recurrences. SODA 2024: 982-994 - [i36]Ali Eshragh, Matthew P. Skerritt, Bruno Salvy, Thomas McCallum:
Optimal Experimental Design for Partially Observable Pure Birth Processes. CoRR abs/2402.09772 (2024) - [i35]Jean-Michel Muller, Bruno Salvy:
Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function. CoRR abs/2405.03588 (2024) - 2023
- [j55]Alin Bostan, Tanguy Rivoal, Bruno Salvy:
Minimization of differential equations and algebraic values of 𝐸-functions. Math. Comput. 93(347): 1427-1472 (2023) - [i34]Alaa Ibrahim, Bruno Salvy:
Positivity certificates for linear recurrences. CoRR abs/2306.05930 (2023) - [i33]Hadrien Brochet, Bruno Salvy:
Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions. CoRR abs/2307.07216 (2023) - 2022
- [j54]Yann Bugeaud
Absolute Root Separation. Exp. Math. 31(3): 806-813 (2022) - [i32]Alin Bostan, Tanguy Rivoal, Bruno Salvy:
Minimization of differential equations and algebraic values of E-functions. CoRR abs/2209.01827 (2022) - 2021
- [j53]Stephen Melczer
Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems. J. Symb. Comput. 103: 234-279 (2021) - [i31]Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. CoRR abs/2110.08354 (2021) - 2020
- [j52]Joel Dahne
Computation of Tight Enclosures for Laplacian Eigenvalues. SIAM J. Sci. Comput. 42(5): A3210-A3232 (2020) - [i30]Joel Dahne, Bruno Salvy:
Computation of Tight Enclosures for Laplacian Eigenvalues. CoRR abs/2003.08095 (2020)
2010 – 2019
- 2019
- [j51]Bruno Salvy
Linear Differential Equations as a Data Structure. Found. Comput. Math. 19(5): 1071-1112 (2019) - [i29]Stephen Melczer, Bruno Salvy:
Effective Coefficient Asymptotics of Multivariate Rational Functions via Semi-Numerical Algorithms for Polynomial Systems. CoRR abs/1905.04187 (2019) - [i28]Yann Bugeaud, Andrej Dujella, Wenjie Fang, Tomislav Pejkovic, Bruno Salvy:
Absolute root separation. CoRR abs/1907.01232 (2019) - 2018
- [c30]Alin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. ISSAC 2018: 95-102 - [c29]Bruno Salvy
Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation. STACS 2018: 1:1-1:5 - [i27]Alin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy:
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. CoRR abs/1805.03445 (2018) - [i26]Bruno Salvy:
Linear Differential Equations as a Data-Structure. CoRR abs/1811.08616 (2018) - 2017
- [j50]Alin Bostan, Pierre Lairez, Bruno Salvy
Multiple binomial sums. J. Symb. Comput. 80: 351-386 (2017) - [j49]Alin Bostan, Louis Dumont, Bruno Salvy
Algebraic diagonals and walks: Algorithms, bounds, complexity. J. Symb. Comput. 83: 68-92 (2017) - [j48]Yann Bugeaud, Andrej Dujella, Tomislav Pejkovic, Bruno Salvy:
Absolute Real Root Separation. Am. Math. Mon. 124(10): 930-936 (2017) - 2016
- [c28]Alin Bostan, Louis Dumont, Bruno Salvy
Efficient Algorithms for Mixed Creative Telscoping. ISSAC 2016: 127-134 - [c27]Stephen Melczer
Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables. ISSAC 2016: 333-340 - [i25]Stephen Melczer, Bruno Salvy:
Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables. CoRR abs/1605.00402 (2016) - [i24]Alin Bostan, Louis Dumont, Bruno Salvy:
Efficient Algorithms for Mixed Creative Telescoping. CoRR abs/1605.05082 (2016) - 2015
- [j47]Magali Bardet, Jean-Charles Faugère, Bruno Salvy
On the complexity of the F5 Gröbner basis algorithm. J. Symb. Comput. 70: 49-70 (2015) - [c26]Alin Bostan, Louis Dumont, Bruno Salvy
Algebraic Diagonals and Walks. ISSAC 2015: 77-84 - [c25]Sébastien Maulat, Bruno Salvy
Formulas for Continued Fractions: An Automated Guess and Prove Approach. ISSAC 2015: 275-282 - [i23]Sébastien Maulat, Bruno Salvy:
Formulas for Continued Fractions. An Automated Guess and Prove Approach. CoRR abs/1507.04203 (2015) - [i22]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic Diagonals and Walks. CoRR abs/1510.04080 (2015) - [i21]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity. CoRR abs/1510.04526 (2015) - [i20]Alin Bostan, Pierre Lairez, Bruno Salvy:
Multiple binomial sums. CoRR abs/1510.07487 (2015) - 2014
- [j46]Alin Bostan, Kilian Raschel, Bruno Salvy
Non-D-finite excursions in the quarter plane. J. Comb. Theory A 121: 45-63 (2014) - 2013
- [j45]Magali Bardet, Jean-Charles Faugère, Bruno Salvy
On the complexity of solving quadratic Boolean systems. J. Complex. 29(1): 53-75 (2013) - [c24]Alin Bostan, Pierre Lairez, Bruno Salvy
Creative telescoping for rational functions using the griffiths: dwork method. ISSAC 2013: 93-100 - [i19]Alin Bostan, Pierre Lairez, Bruno Salvy:
Creative telescoping for rational functions using the Griffiths-Dwork method. CoRR abs/1301.4313 (2013) - [i18]Magali Bardet, Jean-Charles Faugère, Bruno Salvy:
On the Complexity of the F5 Gröbner basis Algorithm. CoRR abs/1312.1655 (2013) - 2012
- [j44]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet, the Father of Analytic Combinatorics. Algorithmica 62(1-2): 635-636 (2012) - [j43]Carine Pivoteau, Bruno Salvy
Algorithms for combinatorial structures: Well-founded systems and Newton iterations. J. Comb. Theory A 119(8): 1711-1773 (2012) - [c23]Alin Bostan, Frédéric Chyzak, Bruno Salvy
Fast computation of common left multiples of linear ordinary differential operators. ISSAC 2012: 99-106 - [c22]Alin Bostan, Bruno Salvy
Power series solutions of singular (q)-differential equations. ISSAC 2012: 107-114 - [i17]Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy:
Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators. CoRR abs/1205.0879 (2012) - [i16]Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton, Bruno Salvy, Éric Schost:
Power Series Solutions of Singular (q)-Differential Equations. CoRR abs/1205.3414 (2012) - 2011
- [j42]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet: the father of analytic combinatorics. ACM Commun. Comput. Algebra 45(1/2): 90-91 (2011) - [j41]Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy
Fast computation of common left multiples of linear ordinary differential operators. ACM Commun. Comput. Algebra 45(1/2): 111-112 (2011) - [j40]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet 1 December 1948 - 22 March 2011. Comb. Probab. Comput. 20(5): 647-649 (2011) - [j39]Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet (1948-2011). Bull. EATCS 104: 16-18 (2011) - [j38]Bruno Salvy
In memoriam: Philippe Flajolet, the father of analytic combinatorics. RAIRO Theor. Informatics Appl. 45(4): 371-373 (2011) - [j37]Jean-Guillaume Dumas
Simultaneous modular reduction and Kronecker substitution for small finite fields. J. Symb. Comput. 46(7): 823-840 (2011) - [j36]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Obituary. Philippe Flajolet. J. Symb. Comput. 46(9): 1085-1086 (2011) - [j35]Bruno Salvy:
In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics. Random Struct. Algorithms 39(1): iii-iv (2011) - [j34]Bruno Salvy
Philippe flajolet, the father of analytic combinatorics. ACM Trans. Algorithms 7(4): 40:1-40:2 (2011) - [j33]Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet, the Father of Analytic Combinatorics. Theor. Comput. Sci. 412(35): 4469-4470 (2011) - [c21]Frédéric Chyzak, James H. Davenport
On Kahan's Rules for Determining Branch Cuts. SYNASC 2011: 47-51 - [i15]Frédéric Chyzak, James H. Davenport, Christoph Koutschan
On Kahan's Rules for Determining Branch Cuts. CoRR abs/1109.2809 (2011) - [i14]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the Complexity of Solving Quadratic Boolean Systems. CoRR abs/1112.6263 (2011) - 2010
- [j32]Philippe Flajolet, Stefan Gerhold, Bruno Salvy:
Lindelöf Representations and (Non-)Holonomic Sequences. Electron. J. Comb. 17(1) (2010) - [j31]Marc Mezzarobba, Bruno Salvy
Effective bounds for P-recursive sequences. J. Symb. Comput. 45(10): 1075-1096 (2010) - [c20]Bruno Salvy:
The Dynamic Dictionary of Mathematical Functions. AISC/MKM/Calculemus 2010: 13 - [c19]Bruno Salvy:
Newton Iteration: From Numerics to Combinatorics, and Back. ANALCO 2010: 47 - [c18]Alexandre Benoît, Frédéric Chyzak, Alexis Darrasse, Stefan Gerhold, Marc Mezzarobba, Bruno Salvy
The Dynamic Dictionary of Mathematical Functions (DDMF). ICMS 2010: 35-41
2000 – 2009
- 2009
- [j30]Peter Clote, Evangelos Kranakis
Asymptotics of Canonical and Saturated RNA Secondary Structures. J. Bioinform. Comput. Biol. 7(5): 869-893 (2009) - [c17]Alexandre Benoît, Bruno Salvy
Chebyshev expansions for solutions of linear differential equations. ISSAC 2009: 23-30 - [c16]Frédéric Chyzak, Manuel Kauers, Bruno Salvy
A non-holonomic systems approach to special function identities. ISSAC 2009: 111-118 - [i13]Marc Mezzarobba, Bruno Salvy:
Effective Bounds for P-Recursive Sequences. CoRR abs/0904.2452 (2009) - [i12]Frédéric Chyzak, Manuel Kauers, Bruno Salvy:
A Non-Holonomic Systems Approach to Special Function Identities. CoRR abs/0904.2761 (2009) - [i11]Alexandre Benoît, Bruno Salvy:
Chebyshev Expansions for Solutions of Linear Differential Equations. CoRR abs/0906.2888 (2009) - [i10]Alin Bostan, Bruno Salvy, Khang Tran:
Generating functions of Chebyshev-like polynomials. CoRR abs/0907.0291 (2009) - 2008
- [j29]Jonathan M. Borwein, Bruno Salvy
A Proof of a Recurrence for Bessel Moments. Exp. Math. 17(2): 223-230 (2008) - [j28]Alin Bostan, François Morain, Bruno Salvy
Fast algorithms for computing isogenies between elliptic curves. Math. Comput. 77(263): 1755-1778 (2008) - [c15]Alin Bostan, Bruno Salvy
Power series composition and change of basis. ISSAC 2008: 269-276 - [i9]Jean-Guillaume Dumas
Compressed Modular Matrix Multiplication. CoRR abs/0803.1975 (2008) - [i8]Alin Bostan, Bruno Salvy, Éric Schost:
Power Series Composition and Change of Basis. CoRR abs/0804.2337 (2008) - [i7]Alin Bostan, Bruno Salvy, Éric Schost:
Fast Conversion Algorithms for Orthogonal Polynomials. CoRR abs/0804.2373 (2008) - [i6]Jean-Guillaume Dumas
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields. CoRR abs/0809.0063 (2008) - 2007
- [j27]Marc Giusti, Grégoire Lecerf, Bruno Salvy
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One. Found. Comput. Math. 7(1): 1-58 (2007) - [c14]Alin Bostan, Frédéric Chyzak, Bruno Salvy
Differential equations for algebraic functions. ISSAC 2007: 25-32 - [c13]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. SODA 2007: 1012-1021 - [i5]Jonathan M. Borwein, Bruno Salvy:
A Proof of a Recursion for Bessel Moments. CoRR abs/0706.1409 (2007) - [i4]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential Equations for Algebraic Functions. CoRR abs/cs/0703121 (2007) - 2006
- [j26]Alin Bostan, Philippe Flajolet, Bruno Salvy
Fast computation of special resultants. J. Symb. Comput. 41(1): 1-29 (2006) - [c12]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau:
Low complexity algorithms for linear recurrences. ISSAC 2006: 31-38 - [i3]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. CoRR abs/cs/0604101 (2006) - [i2]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau:
Low Complexity Algorithms for Linear Recurrences. CoRR abs/cs/0605068 (2006) - [i1]Alin Bostan, Bruno Salvy, François Morain, Éric Schost:
Fast algorithms for computing isogenies between elliptic curves. CoRR abs/cs/0609020 (2006) - 2005
- [j25]Philippe Flajolet, Stefan Gerhold, Bruno Salvy:
On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function. Electron. J. Comb. 11(2) (2005) - [j24]Marc Giusti, Grégoire Lecerf, Bruno Salvy
On Location and Approximation of Clusters of Zeros of Analytic Functions. Found. Comput. Math. 5(3): 257-311 (2005) - [j23]Frédéric Chyzak, Marni Mishna
Effective scalar products of D-finite symmetric functions. J. Comb. Theory A 112(1): 1-43 (2005) - [c11]Bruno Salvy:
D-finiteness: algorithms and applications. ISSAC 2005: 2-3 - [c10]Alin Bostan, Thomas Cluzeau, Bruno Salvy:
Fast algorithms for polynomial solutions of linear differential equations. ISSAC 2005: 45-52 - 2004
- [j22]Philippe Flajolet, Bruno Salvy, Gilles Schaeffer:
Airy Phenomena and Analytic Combinatorics of Connected Graphs. Electron. J. Comb. 11(1) (2004) - [c9]Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt:
Complexity issues in bivariate polynomial factorization. ISSAC 2004: 42-49 - 2003
- [j21]Alin Bostan, Bruno Salvy
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. Appl. Algebra Eng. Commun. Comput. 14(4): 239-272 (2003) - [c8]Ludovic Meunier, Bruno Salvy:
ESF: an automatically generated encyclopedia of special functions. ISSAC 2003: 199-206 - 2002
- [j20]Robert Cori, Dominique Rossin, Bruno Salvy
Polynomial ideals for sandpiles and their Gröbner bases. Theor. Comput. Sci. 276(1-2): 1-15 (2002) - [j19]Pierre Nicodème, Bruno Salvy
Motif statistics. Theor. Comput. Sci. 287(2): 593-617 (2002) - 2001
- [j18]Marc Giusti, Grégoire Lecerf, Bruno Salvy
A Gröbner Free Alternative for Polynomial System Solving. J. Complex. 17(1): 154-211 (2001) - 2000
- [j17]Marc Giusti, Klemens Hägele, Grégoire Lecerf, Joël Marchand, Bruno Salvy:
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety. J. Symb. Comput. 30(3): 291-307 (2000)
1990 – 1999
- 1999
- [j16]Bruno Salvy
Symbolic Asymptotics: Multiseries of Inverse Functions. J. Symb. Comput. 27(6): 543-563 (1999) - [c7]Pierre Nicodème, Bruno Salvy
Motif Statistics. ESA 1999: 194-211 - [e1]Keith O. Geddes, Bruno Salvy, Samuel S. Dooley:
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999. ACM 1999, ISBN 1-58113-073-2 [contents] - 1998
- [j15]Philippe Flajolet, Bruno Salvy:
Euler Sums and Contour Integral Representations. Exp. Math. 7(1): 15-35 (1998) - [j14]Bruno Salvy, John Shackell:
Symbolic Asymptotics: Functions of Two Variables, Implicit Functions. J. Symb. Comput. 25(3): 329-349 (1998) - [j13]Frédéric Chyzak, Bruno Salvy:
Non-Commutative Elimination in Ore Algebras Proves Multivariate Identities. J. Symb. Comput. 26(2): 187-227 (1998) - 1997
- [j12]Philippe Flajolet, Bruno Salvy:
The SIGSAM challenges: symbolic asymptotics in practice. SIGSAM Bull. 31(4): 36-47 (1997) - [j11]Laurent Habsieger, Bruno Salvy:
On integer Chebyshev polynomials. Math. Comput. 66(218): 763-770 (1997) - 1996
- [j10]Xavier Gourdon, Bruno Salvy:
Effective asymptotics of linear recurrences with rational coefficients. Discret. Math. 153(1-3): 145-163 (1996) - [c6]Daniel Richardson, Bruno Salvy, John Shackell, Joris van der Hoeven:
Asymptotic Expansions of exp-log Functions. ISSAC 1996: 309-313 - 1995
- [j9]John Shackell, Bruno Salvy
Asymptotic Forms and Algebraic Differential Equations. J. Symb. Comput. 20(2): 169-177 (1995) - [j8]Philippe Flajolet, Bruno Salvy
Computer Algebra Libraries for Combinatorial Structures. J. Symb. Comput. 20(5/6): 653-671 (1995) - [j7]Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy
Hypergeometrics and the Cost Structure of Quadtrees. Random Struct. Algorithms 7(2): 117-144 (1995) - 1994
- [j6]Bruno Salvy
Fast Computation of Some Asymptotic Functional Inverses. J. Symb. Comput. 17(3): 227-236 (1994) - [j5]Bruno Salvy
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20(2): 163-177 (1994) - 1993
- [j4]Bruno Salvy:
Efficient programming in Maple: a case study. SIGSAM Bull. 27(2): 1-12 (1993) - [j3]Philippe Flajolet, Bruno Salvy, Helmut Prodinger:
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean). SIAM Rev. 35(4): 645-647 (1993) - [c5]Marko Petkovsek, Bruno Salvy
Finding all Hypergeometric Solutions of Linear Differential Equations. ISSAC 1993: 27-33 - [c4]Manuel Bronstein, Bruno Salvy
Full Partial Fraction Decomposition of Rational Functions. ISSAC 1993: 157-160 - 1992
- [c3]François Bergeron
Varieties of Increasing Trees. CAAP 1992: 24-48 - [c2]Bruno Salvy
Asymptotic Expansions of Functional Inverses. ISSAC 1992: 130-137 - 1991
- [j2]Bruno Salvy:
Examples of automatic asymptotic expansions. SIGSAM Bull. 25(2): 4-17 (1991) - [j1]Philippe Flajolet, Bruno Salvy, Paul Zimmermann:
Automatic Average-Case Analysis of Algorithm. Theor. Comput. Sci. 79(1): 37-109 (1991)
1980 – 1989
- 1988
- [c1]Philippe Flajolet, Bruno Salvy
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. AAECC 1988: 201-212
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-20 20:33 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: