Franz Winkler

Affiliations:
  • Johannes Kepler University, Linz, Austria


According to our database1, Franz Winkler authored at least 66 papers between 1983 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
General Solutions of First-Order Algebraic ODEs in Simple Constant Extensions.
J. Syst. Sci. Complex., August, 2023

2019
The Algebro-Geometric Method for Solving Algebraic Differential Equations - A Survey.
J. Syst. Sci. Complex., 2019

2018
Deciding the existence of rational general solutions for first-order algebraic ODEs.
J. Symb. Comput., 2018

Rational general solutions of systems of first-order algebraic partial differential equations.
J. Comput. Appl. Math., 2018

Computation of all rational solutions of first-order algebraic ODEs.
Adv. Appl. Math., 2018

2016
Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra.
J. Symb. Comput., 2016

A solution method for autonomous first-order algebraic partial differential equations.
J. Comput. Appl. Math., 2016

2015
Symbolic Solutions of First-Order Algebraic ODEs.
Proceedings of the Computer Algebra and Polynomials, 2015

Birational transformations preserving rational solutions of algebraic ordinary differential equations.
J. Comput. Appl. Math., 2015

Algebraic General Solutions of First Order Algebraic ODEs.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
On Symbolic Solutions of Algebraic Partial Differential Equations.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013
Rational general solutions of higher order algebraic odes.
J. Syst. Sci. Complex., 2013

2012
Rational General Solutions of Trivariate Rational Differential Systems.
Math. Comput. Sci., 2012

2011
Rational general solutions of planar rational systems of autonomous ODEs.
J. Symb. Comput., 2011

What can Symbolic Computation Contribute to Mathematics?
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

2010
Rational general solutions of first order non-autonomous parametrizable ODEs.
J. Symb. Comput., 2010

2009
Canonical Reduction Systems in Symbolic Mathematics.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

Algorithms in Symbolic Computation.
Proceedings of the Hagenberg Research, 2009

2008
Computing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules.
J. Symb. Comput., 2008

2007
On Computing Gröbner Bases in Rings of Differential Operators with Coefficients in a Ring.
Math. Comput. Sci., 2007

Symbolic and Algebraic Methods for Linear Partial Differential Operators.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

A Full System of Invariants for Third-Order Linear Partial Differential Operators in General Form.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators.
Proceedings of the Computer Mathematics, 8th Asian Symposium, 2007

2006
Bruno Buchberger - A life devoted to symbolic computation.
J. Symb. Comput., 2006

Approximate factorization of linear partial differential operators: full system of invariants for order three.
ACM Commun. Comput. Algebra, 2006

Gröbner bases in difference-differential modules.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2001
The Parametrization of Canal Surfaces and the Decomposition of Polynomials into a Sum of Two Squares.
J. Symb. Comput., 2001

Tracing index of rational curve parametrizations.
Comput. Aided Geom. Des., 2001

Computation of the degree of rational maps between curves.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Special Issue on Applications of Gröbner Bases - Foreword of the Guest Editors.
J. Symb. Comput., 2000

Symbolic parametrization of pipe and canal surfaces.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

On Solving a Problem in Algebraic Geometry by Cluster Computing (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Algorithms for Rational Real Algebraic Curves.
Fundam. Informaticae, 1999

1998
Real Parametrization of Algebraic Curves.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997
Parametrization of Algebraic Curves over Optimal Field Extensions.
J. Symb. Comput., 1997

1996
Polynomial Algorithms in Computer Algebra.
Texts & Monographs in Symbolic Computation, Springer, ISBN: 978-3-7091-6571-3, 1996

CASA - A System for Computer Aided Constructive Algebraic Geometry.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1996

Points on Algebraic Curves and the Parametrization Problem.
Proceedings of the Automated Deduction in Geometry, 1996

1995
Algorithmic Algebra (B. Mishra).
SIAM Rev., 1995

1992
Erratum: A. A. Reeves, "The worst order is not always the lexicographic order, " ACM SIGSAM Bulletin, Volume 25, Number 4, pp. 18-19.
SIGSAM Bull., 1992

1991
Symbolic Parametrization of Curves.
J. Symb. Comput., 1991

CASA: A Computer Algebra Package for Constructive Algebraic Geometry.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Report on DISCO '90.
SIGSAM Bull., 1990

1989
Equational Theorem Proving and Rewrite Rule Systems.
Proceedings of the 5. Österreichische Artificial Intelligence-Tagung, 1989

Knuth-Bendix Procedure and Buchberger Algorithm: A Synthesis.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
A p-Adic Approach to the Computation of Gröbner Bases.
J. Symb. Comput., 1988

Seventh RIMS Conference on "Formula Manipulation and its Application to Mathematical Study".
SIGSAM Bull., 1988

Abstracts from the Sixth Army Conference on Applied Mathematics and Computing University of Colorado, Boulder, Colorado 31 May - 3 June 1988.
SIGSAM Bull., 1988

Abstracts from a Minisymposium on Integrated Environments for Scientific Computing held October 14, 1987 during the SIAM 35th Anniversary Meeting Denver, CO.
SIGSAM Bull., 1988

A Geometrical Decision Algorithm Based on the Gröbner Bases Algorithm.
Proceedings of the Symbolic and Algebraic Computation, 1988

1987
International Workshop on Computing Tools for Research and Development in Sciences and Engineering.
SIGSAM Bull., 1987

Abstracts of papers in the Journal of Symbolic Computation.
SIGSAM Bull., 1987

Abstracts: Sixth RIMS Conference on Formula Manipulation and its Application to Mathematical Study.
SIGSAM Bull., 1987

Abstracts: J-SIGSAM Japanese Special Interest Group on Symbolic and Algebraic Computation and Report of the Last Seasonal Meeting.
SIGSAM Bull., 1987

Abstracts of Technical Reports Computer Science Branch, Corporate Research and Development, General Electric Company, Schenectady, NY 12345 (GE).
SIGSAM Bull., 1987

Abstracts of papers that appeared in the Journal of Symbolic Computation.
SIGSAM Bull., 1987

1986
SYMSAC'86 Abstracts.
SIGSAM Bull., 1986

AAECC-3 Abstracts.
SIGSAM Bull., 1986

1985
Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals.
ACM Trans. Math. Softw., 1985

Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A "Unification" of Different Approaches.
Proceedings of the EUROCAL '85, 1985

1984
The church rosser property in computer algebra and special theorem proving: an investigation of critical pair, completion algorithms.
PhD thesis, 1984

The Church-Rosser property in computer algebra and special theorem proving: an investigation of critical-pair/completion algorithms (Ph.D. thesis).
SIGSAM Bull., 1984

On the Complexity of the Groebner-Bases Algorithm over K[x, y, z].
Proceedings of the EUROSAM 84, 1984

1983
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm.
SIGSAM Bull., 1983

An algorithm for constructing detaching bases in the ring of polynominals over a field.
Proceedings of the Computer Algebra, 1983


  Loading...