default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge Labahn
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j53]Stavros Birmpilis, George Labahn, Arne Storjohann
:
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. J. Symb. Comput. 116: 146-182 (2023)- [j52]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116: 365-399 (2023) - [j51]Frédéric Chyzak, George Labahn:
Special issue on Symbolic and Algebraic Computation: ISSAC 2021. J. Symb. Comput. 116: 425-426 (2023) - [j50]Stavros Birmpilis, George Labahn, Arne Storjohann:
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix. ACM Trans. Algorithms 19(4): 37:1-37:36 (2023) - [c39]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. ISSAC 2023: 452-460 - [i20]George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Faster real root decision algorithm for symmetric polynomials. CoRR abs/2306.03855 (2023) - 2022
- [j49]Shaoshi Chen, Qing-Hu Hou, Hui Huang, George Labahn, Rong-Hua Wang:
Constructing minimal telescopers for rational functions in three discrete variables. Adv. Appl. Math. 141: 102389 (2022) - [j48]Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima:
Efficient rational creative telescoping. J. Symb. Comput. 109: 57-87 (2022) - [c38]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. ISSAC 2022: 351-360 - [c37]Robert M. Corless, George Labahn, Dan Piponi, Leili Rafiee Sevyeri:
Bohemian Matrix Geometry. ISSAC 2022: 361-370 - [i19]Robert M. Corless, George Labahn, Dan Piponi, Leili Rafiee Sevyeri:
Bohemian Matrix Geometry. CoRR abs/2202.07769 (2022) - [i18]George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. CoRR abs/2202.09329 (2022) - [i17]Stavros Birmpilis, George Labahn, Arne Storjohann:
A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix. CoRR abs/2209.10685 (2022) - 2021
- [j47]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66: 101557 (2021) - [j46]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing nearby non-trivial Smith forms. J. Symb. Comput. 102: 304-327 (2021) - [j45]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-integer linear decomposition of multivariate polynomials. J. Symb. Comput. 107: 122-144 (2021) - [e2]Frédéric Chyzak, George Labahn:
ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021. ACM 2021, ISBN 978-1-4503-8382-0 [contents] - [i16]Stavros Birmpilis, George Labahn, Arne Storjohann:
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. CoRR abs/2111.09949 (2021) - 2020
- [j44]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing lower rank approximations of matrix polynomials. J. Symb. Comput. 98: 225-245 (2020) - [j43]George Labahn, James H. Davenport, Josef Urban:
Foreword. Math. Comput. Sci. 14(3): 531-532 (2020) - [c36]Yin Ki Ng, Dallas J. Fraser, Besat Kassaie, George Labahn, Mirette S. Marzouk, Frank Wm. Tompa, Kevin Wang:
Dowsing for Math Answers with Tangent-L. CLEF (Working Notes) 2020 - [c35]Stavros Birmpilis, George Labahn, Arne Storjohann:
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. ISSAC 2020: 38-45 - [i15]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-Integer Linear Decomposition of Multivariate Polynomials. CoRR abs/2002.00124 (2020) - [i14]George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR abs/2009.00844 (2020) - [i13]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. CoRR abs/2009.00847 (2020)
2010 – 2019
- 2019
- [c34]Stavros Birmpilis, George Labahn, Arne Storjohann:
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication. ISSAC 2019: 58-65 - [c33]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Integer-Linear Decomposition of Multivariate Polynomials. ISSAC 2019: 171-178 - [i12]Shaoshi Chen, Qing-Hu Hou, Hui Huang, George Labahn, Rong-Hua Wang:
Constructing minimal telescopers for rational functions in three discrete variables. CoRR abs/1904.11614 (2019) - [i11]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Rational Creative Telescoping. CoRR abs/1909.06898 (2019) - 2018
- [j42]Bernhard Beckermann, George Labahn, Ana C. Matos:
On rational functions without Froissart doublets. Numerische Mathematik 138(3): 615-633 (2018) - [j41]Parsiad Azimzadeh, Erhan Bayraktar, George Labahn:
Convergence of Implicit Schemes for Hamilton-Jacobi-Bellman Quasi-Variational Inequalities. SIAM J. Control. Optim. 56(6): 3994-4016 (2018) - [c32]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Nearby Non-trivial Smith Forms. ISSAC 2018: 159-166 - [e1]James H. Davenport, Manuel Kauers, George Labahn, Josef Urban:
Mathematical Software - ICMS 2018 - 6th International Conference, South Bend, IN, USA, July 24-27, 2018, Proceedings. Lecture Notes in Computer Science 10931, Springer 2018, ISBN 978-3-319-96417-1 [contents] - [i10]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Nearby Non-trivial Smith Forms. CoRR abs/1812.04590 (2018) - 2017
- [j40]George Labahn, Vincent Neiger, Wei Zhou:
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complex. 42: 44-71 (2017) - [c31]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing the Nearest Rank-Deficient Matrix Polynomial. ISSAC 2017: 181-188 - [i9]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Lower Rank Approximations of Matrix Polynomials. CoRR abs/1712.04007 (2017) - 2016
- [j39]George Labahn, Stephen M. Watt:
Thematic program in computer algebra: July 1 - Dec 31, 2015. ACM Commun. Comput. Algebra 50(1): 25-26 (2016) - [j38]Evelyne Hubert, George Labahn:
Computation of invariants of finite abelian groups. Math. Comput. 85(302): 3029-3050 (2016) - [c30]Shaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang:
Existence Problem of Telescopers: Beyond the Bivariate Case. ISSAC 2016: 167-174 - [i8]Shaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang:
Existence Problem of Telescopers: Beyond the Bivariate Case. CoRR abs/1601.03080 (2016) - [i7]George Labahn, Wei Zhou:
A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix. CoRR abs/1602.02049 (2016) - [i6]George Labahn, Vincent Neiger, Wei Zhou:
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. CoRR abs/1607.04176 (2016) - 2015
- [j37]George Labahn:
Dynamical systems and scaling invariants. ACM Commun. Comput. Algebra 49(1): 25 (2015) - [j36]George Labahn:
Rational invariants of finite abelian groups. ACM Commun. Comput. Algebra 49(1): 31-32 (2015) - [j35]Wei Zhou, George Labahn, Arne Storjohann:
A deterministic algorithm for inverting a polynomial matrix. J. Complex. 31(2): 162-173 (2015) - [j34]Scott MacLean, George Labahn:
A Bayesian model for recognizing handwritten mathematical expressions. Pattern Recognit. 48(8): 2433-2445 (2015) - [i5]Annie A. M. Cuyt, George Labahn, Avraham Sidi, Wen-shin Lee:
Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251). Dagstuhl Reports 5(6): 48-69 (2015) - 2014
- [j33]Josh Babbin, Peter A. Forsyth, George Labahn:
A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching. J. Sci. Comput. 58(2): 409-430 (2014) - [c29]Wei Zhou, George Labahn:
Unimodular completion of polynomial matrices. ISSAC 2014: 413-420 - [i4]Scott MacLean, George Labahn:
A Bayesian model for recognizing handwritten mathematical expressions. CoRR abs/1409.5317 (2014) - [i3]Wei Zhou, George Labahn:
Fast and deterministic computation of the determinant of a polynomial matrix. CoRR abs/1409.5462 (2014) - 2013
- [j32]Evelyne Hubert, George Labahn:
Scaling Invariants and Symmetry Reduction of Dynamical Systems. Found. Comput. Math. 13(4): 479-516 (2013) - [j31]Scott MacLean, George Labahn:
A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets. Int. J. Document Anal. Recognit. 16(2): 139-163 (2013) - [j30]Moulay A. Barkatou, Carole El Bacha, George Labahn, Eckhard Pflügel:
On simultaneous row and column reduction of higher-order linear differential systems. J. Symb. Comput. 49: 45-64 (2013) - [j29]Wai Man Ng, Dong Eui Chang, George Labahn:
Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom. SIAM J. Control. Optim. 51(2): 881-905 (2013) - [c28]Wei Zhou, George Labahn:
Computing column bases of polynomial matrices. ISSAC 2013: 379-386 - 2012
- [j28]George Labahn, Johannes Middeke:
Gröbner walk for computing matrix normal forms over Ore polynomials. ACM Commun. Comput. Algebra 46(3/4): 106-107 (2012) - [j27]Wei Zhou, George Labahn:
Efficient algorithms for order basis computation. J. Symb. Comput. 47(7): 793-819 (2012) - [j26]Y. Huang, Peter A. Forsyth, George Labahn:
Iterative methods for the solution of a singular control formulation of a GMWB pricing problem. Numerische Mathematik 122(1): 133-167 (2012) - [j25]Y. Huang, Peter A. Forsyth, George Labahn:
Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance. SIAM J. Numer. Anal. 50(4): 1861-1882 (2012) - [c27]Evelyne Hubert, George Labahn:
Rational invariants of scalings from Hermite normal forms. ISSAC 2012: 219-226 - [c26]Wei Zhou, George Labahn, Arne Storjohann:
Computing minimal nullspace bases. ISSAC 2012: 366-373 - 2011
- [j24]Scott MacLean, George Labahn, Edward Lank, Mirette S. Marzouk, David Tausky:
Grammar-based techniques for creating ground-truthed sketch corpora. Int. J. Document Anal. Recognit. 14(1): 65-74 (2011) - [j23]Y. Huang, Peter A. Forsyth, George Labahn:
Methods for Pricing American Options under Regime Switching. SIAM J. Sci. Comput. 33(5): 2144-2168 (2011) - [c25]David Tausky, Edward Lank, Richard Mann, George Labahn:
Analyzing sketch content using in-air packet information. IUI 2011: 403-406 - [c24]Scott MacLean, David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk:
Is the iPad useful for sketch input? A comparison with the Tablet PC. SBIM 2011: 7-14
2000 – 2009
- 2009
- [j22]Howard Cheng, George Labahn:
Applying linear algebra routines to modular ore polynomial matrix algorithms. ACM Commun. Comput. Algebra 43(3/4): 78-79 (2009) - [j21]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput. 44(8): 943-959 (2009) - [c23]Howard Cheng, George Labahn:
A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. ASCM 2009: 49-59 - [c22]Mark Giesbrecht, George Labahn, Yang Zhang:
Computing Popov Forms of Matrices Over PBW Extensions. ASCM 2009: 61-65 - [c21]Bernhard Beckermann, George Labahn:
Fraction-free computation of simultaneous padé approximants. ISSAC 2009: 15-22 - [c20]Wei Zhou, George Labahn:
Efficient computation of order bases. ISSAC 2009: 375-382 - [c19]Scott MacLean, David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk:
Tools for the Efficient Generation of Hand-Drawn Corpora Based on Context-Free Grammars. SBIM 2009: 125-132 - 2008
- [j20]Howard Cheng, George Labahn, Wei Zhou:
Computing polynomial LCM and GCD in lagrange basis. ACM Commun. Comput. Algebra 42(3): 129-130 (2008) - [c18]George Labahn, Edward Lank, Scott MacLean, Mirette S. Marzouk, David Tausky:
MathBrush: A System for Doing Math on Pen-Based Devices. Document Analysis Systems 2008: 599-606 - [c17]George Labahn, Edward Lank, Mirette S. Marzouk, Andrea Bunt, Scott MacLean, David Tausky:
MathBrush: A Case Study for Pen-based Interactive Mathematics. SBIM 2008: 143-150 - 2007
- [j19]Howard Cheng, George Labahn:
Output-sensitive modular algorithms for polynomial matrix normal forms. J. Symb. Comput. 42(7): 733-750 (2007) - [j18]Bernhard Beckermann, Gene H. Golub, George Labahn:
On the numerical condition of a generalized Hankel eigenvalue problem. Numerische Mathematik 106(1): 41-68 (2007) - [c16]David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk:
Managing Ambiguity in Mathematical Matrices. SBIM 2007: 115-122 - 2006
- [j17]Bernhard Beckermann, Howard Cheng, George Labahn:
Fraction-free row reduction of matrices of Ore polynomials. J. Symb. Comput. 41(5): 513-543 (2006) - [j16]Bernhard Beckermann, George Labahn, Gilles Villard:
Normal forms for general polynomial matrices. J. Symb. Comput. 41(6): 708-737 (2006) - [c15]Howard Cheng, George Labahn:
On computing polynomial GCDs in alternate bases. ISSAC 2006: 47-54 - [c14]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC 2006: 116-123 - [i2]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software 2006 - [i1]George Labahn, Scott MacLean, Mirette S. Marzouk, Ian Rutherford, David Tausky:
MathBrush: An Experimental Pen-Based Math System. Challenges in Symbolic Computation Software 2006 - 2005
- [j15]Yann d'Halluin, Peter A. Forsyth, George Labahn:
A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion. SIAM J. Sci. Comput. 27(1): 315-345 (2005) - [c13]Mark Giesbrecht, George Labahn, Yang Zhang:
Computing Valuation Popov Forms. International Conference on Computational Science (3) 2005: 619-626 - 2004
- [j14]Yann d'Halluin, Peter A. Forsyth, George Labahn:
A penalty method for American options with jump diffusion processes. Numerische Mathematik 97(2): 321-352 (2004) - [c12]Reinhold Burger, George Labahn, Mark van Hoeij:
Closed form solutions of linear odes having elliptic function coefficients. ISSAC 2004: 58-64 - [c11]George Labahn, Ziming Li:
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings. ISSAC 2004: 213-220 - 2002
- [c10]Bernhard Beckermann, Howard Cheng, George Labahn:
Fraction-free row reduction of matrices of skew polynomials. ISSAC 2002: 8-15 - 2001
- [c9]Howard Cheng, George Labahn:
Computing all factorizations in ***. ISSAC 2001: 64-71 - 2000
- [j13]Bernhard Beckermann, George Labahn:
Effective Computation of Rational Approximants and Interpolants. Reliab. Comput. 6(4): 365-390 (2000) - [j12]Bernhard Beckermann, George Labahn:
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs. SIAM J. Matrix Anal. Appl. 22(1): 114-144 (2000) - [c8]Yann d'Halluin, Peter A. Forsyth, Kenneth R. Vetzal, George Labahn:
Numerical methods for pricing callable bonds. CIFEr 2000: 78-81
1990 – 1999
- 1999
- [c7]Bernhard Beckermann, George Labahn, Gilles Villard:
Shifted Normal Forms of Polynomial Matrices. ISSAC 1999: 189-196 - 1998
- [j11]George Labahn, Mohamed Omar Rayes:
Poster Session Abstracts of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998 Rostock, Germany August 13 - 15, 1998. SIGSAM Bull. 32(2): 49-52 (1998) - [j10]Bernhard Beckermann, George Labahn:
When are Two Numerical Polynomials Relatively Prime? J. Symb. Comput. 26(6): 677-689 (1998) - [j9]Bernhard Beckermann, George Labahn:
A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials. J. Symb. Comput. 26(6): 691-714 (1998) - 1997
- [j8]Stanley Cabay, Anthony R. Jones, George Labahn:
Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing Padé-Hermite and Simultaneous Padé Approximants. ACM Trans. Math. Softw. 23(1): 91-110 (1997) - [c6]Bernhard Beckermann, Stanley Cabay, George Labahn:
Fraction-free Computation of Catrix Padé Systems. ISSAC 1997: 125-132 - [c5]David J. Jeffrey, George Labahn, Martin von Mohrenschildt, Albert D. Rich:
Integration of the Signum, Piecewise and Related Functions. ISSAC 1997: 324-330 - 1996
- [j7]Stanley Cabay, Anthony R. Jones, George Labahn:
Computation of Numerical Padé-Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices. SIAM J. Matrix Anal. Appl. 17(2): 248-267 (1996) - [j6]Stanley Cabay, Anthony R. Jones, George Labahn:
Computation of Numerical Padé-Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm. SIAM J. Matrix Anal. Appl. 17(2): 268-297 (1996) - [c4]Arne Storjohann, George Labahn:
Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. ISSAC 1996: 259-266 - 1995
- [c3]Arne Storjohann, George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation. ISSAC 1995: 119-125 - 1994
- [j5]Bernhard Beckermann, George Labahn:
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants. SIAM J. Matrix Anal. Appl. 15(3): 804-823 (1994) - 1992
- [b1]Keith O. Geddes, Stephen R. Czapor, George Labahn:
Algorithms for computer algebra. Kluwer 1992, ISBN 978-0-7923-9259-0, pp. I-XVIII, 1-585 - [j4]Stanley Cabay, George Labahn:
A superfast algorithm for multi-dimensional Padé systems. Numer. Algorithms 2(2): 201-224 (1992) - [j3]Bernhard Beckermann, George Labahn:
A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations. Numer. Algorithms 3(1): 45-54 (1992) - 1990
- [j2]George Labahn, Dong-Koo Choi, Stanley Cabay:
The Inverses of Block Hankel and Block Toeplitz Matrices. SIAM J. Comput. 19(1): 98-123 (1990)
1980 – 1989
- 1989
- [j1]George Labahn, Stanley Cabay:
Matrix Padé Fractions and Their Computation. SIAM J. Comput. 18(4): 639-657 (1989) - [c2]Stanley Cabay, George Labahn:
A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms. ISSAC 1989: 95-100 - 1987
- [c1]George Labahn, Stanley Cabay:
Matrix-Padé fractions. EUROCAL 1987: 438-449
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-10-07 22:11 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:
