The SFB program expired on September 30, 2008. For the link to the successor project click DK Computational Mathematics
Home
Appointments
Papers
Misc
Contact

Technical Reports

Publication Lists

Annual Reports


Publications of the Project F1305
September 27, 2008

Bibliography

1
S. A. Abramov, P. Paule, and M. Petkovšek.
$q$-Hypergeometric solutions of $q$-difference equations.
Discrete Math., 180:3-22, 1998.
2
H. Alzer, S. Gerhold, M. Kauers, and A. Lupas.
On turan's inequality for legendre polynomials.
Technical Report 2006-16, SFB F13, 2006.
3
H. Alzer, S. Gerhold, M. Kauers, and A. Lupas.
On Turan's inequality for Legendre polynomials.
Expositiones Mathematicae, 25(2):181-186, May 2007.
4
G. E. Andrews, A. Knopfmacher, and P. Paule.
An infinite family of Engel expansions of Rogers-Ramanujan type.
Adv. in Appl. Math., 25:2-11, 2000.
5
G. E. Andrews, A. Knopfmacher, P. Paule, and H. Prodinger.
$q$-Engel series expansions and Slater's identities.
Quaestiones Math., 24:1-14, 2001.
6
G. E. Andrews, A. Knopfmacher, P. Paule, and B. Zimmermann.
Engel expansions of $q$-series by computer algebra.
In F. G. Garvan and M. E. H. Ismail, editors, Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, volume 4 of Developments in Mathematics, pages 33-57. Kluwer, 2001.
7
G. E. Andrews and P. Paule.
MacMahon's partition analysis IV: Hypergeometric multisums.
Sém. Lothar. Combin., B42i:1-24, 1999.
8
G. E. Andrews and P. Paule.
MacMahon's Dream.
Technical report, SFB 013, September 2006.
SFB-report 2006-26.
9
G. E. Andrews and P. Paule.
MacMahon's Partition Analysis XI: The Search for Modular Forms.
Technical report, SFB 013, 2006.
SFB-report 2006-27.
10
G. E. Andrews and P. Paule.
MacMahon's Partition Analysis XII: Plane Partitions.
Technical report, SFB 013, September 2006.
SFB-report 2006-28.
11
G. E. Andrews and P. Paule.
Macmahon's partition analysis XI: Broken diamonds and modular forms.
Acta Arith., 126:281-294, 2007.
12
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's partition analysis III: The Omega package.
European J. Combin., 22:887-904, 2001.
13
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's partition analysis IX: $k$-Gon partitions.
Bull. Austral. Math. Soc., 64:321-329, 2001.
14
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's partition analysis VI: A new reduction algorithm.
Ann. Comb., 5:251-270, 2001.
15
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's partition analysis VII: Constrained compositions.
In B. C. Berndt and K. Ono, editors, $q$-Series with Applications to Combinatorics, Number Theory, and Physics, volume 291 of Contemp. Math., pages 11-27. Amer. Math. Soc., 2001.
16
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's partition analysis VIII: Plane partition diamonds.
Adv. in Appl. Math., 27:231-242, 2001.
17
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's Partition Analysis X: Plane Partitions with Diagonals.
SFB-Report 2004-2, J. Kepler University Linz, January 2004.
18
G. E. Andrews, P. Paule, and A. Riese.
MacMahon's Partition Analysis XI: Hexagonal Plane Partitions.
SFB-Report 2004-4, J. Kepler University Linz, March 2004.
19
G. E. Andrews, P. Paule, A. Riese, and V. Strehl.
MacMahon's partition analysis V: Bijections, recursions, and magic squares.
In A. Betten et al., editors, Algebraic Combinatorics and Applications, pages 1-39. Springer, 2001.
20
G. E. Andrews, P. Paule, and C. Schneider.
Plane partitions VI: Stembridge's TSPP theorem.
SFB-Report 2004-09, J. Kepler University, Linz, 2004.
21
G. E. Andrews, P. Paule, and C. Schneider.
Plane partitions VI: Stembridge's TSPP theorem.
Advances in Applied Math. Special Issue Dedicated to Dr. David P. Robbins. Edited by D. Bressoud, 34(4):709-739, 2005.
22
A. Becirovic, P. Paule, V. Pillwein, A. Riese, C. Schneider, and J. Schöberl.
Hypergeometric summation algorithms for high order finite elements.
Computing, 78(3):235-249, 2006.
23
A. Becirovic, P. Paule, V. Pillwein, A. Riese, C. Schneider, and J. Schöberl.
Hypergeometric Summation Methods for High Order Finite Elements.
Technical Report 2006-8, SFB F013, Johannes Kepler Universität, 2006.
24
J. P. Bell and S. Gerhold.
The positivity set of a recurrence sequence.
Technical Report 2005-11, SFB F013, Johannes Kepler Universität, 2005.
25
J. P. Bell and S. Gerhold.
On the positivity set of a linear recurrence sequence.
Israel J. Math., 157:333-345, 2007.
26
J. P. Bell, S. Gerhold, M. Klazar, and F. Luca.
Non-holonomicity of sequences defined via elementary functions.
Annals of Combinatorics, 2007.
To appear.
27
A. Berkovich and P. Paule.
Lattice paths, $q$-multinomials and two variants of the Andrews-Gordon identities.
Ramanujan J., 5:409-424, 2001.
28
A. Berkovich and P. Paule.
Variants of the Andrews-Gordon identities.
Ramanujan J., 5:391-404, 2001.
29
A. Berkovich and A. Riese.
A computer proof of a polynomial identity implying a partition theorem of Göllnitz.
Adv. in Appl. Math., 28:1-16, 2002.
30
I. Bierenbaum, J. Blümlein, S. Klein, and C. Schneider.
Difference equations in massive higher order calculations.
Technical Report 2007-19, SFB F013, J. Kepler University Linz, 2007.
31
F. Caruso.
A Macsyma implementation of Zeilberger's fast algorithm.
Sém. Lothar. Combin., S43c:1-8, 1999.
32
F. Caruso.
A library for polynomial arithmetic.
Contributed talk at Workshop on Applications of Commutative Algebra, Catania, Italy, April 2002.
33
F. Caruso.
Polynomial Arithmetic and Linear Systems in Symbolic Summation.
PhD thesis, RISC, Johannes Kepler University Linz, 2002.
34
F. Chyzak, I. Gutman, and P. Paule.
Predicting the number of hexagonal systems with 24 and 25 hexagons.
MATCH, 40:139-151, 1999.
35
F. Chyzak and P. Paule.
NIST's Digital Library of Mathematical Functions, chapter Computer Algebra.
DLMF, 2004.
Accepted for publication.
36
F. Chyzak and P. Paule.
Computer Algebra.
In D. Lozier, editor, The Digital Library of Mathematical Functions (DLMF). National Institute of Standards and Technology (NIST), Gaithersburg, USA, 2007.
In preparation.
37
F. Chyzak, P. Paule, O. Scherzer, A. Schoisswohl, and B. Zimmermann.
The construction of orthonormal wavelets using symbolic methods and a matrix analytical approach for wavelets on the interval.
Experiment. Math., 10:67-86, 2001.
38
K. Driver, H. Prodinger, C. Schneider, and A. Weideman.
Padé Approximations to the Logarithms II: Identities, Recurrences, and Symbolic Computation.
Technical Report 03-07, RISC-Linz, J. Kepler University, Linz, 2003.
39
K. Driver, H. Prodinger, C. Schneider, and A. Weideman.
Padé Approximations to the Logarithms III: Alternative Methods and Additional Results.
Technical Report 03-08, RISC-Linz, J. Kepler University, Linz, 2003.
40
K. Driver, H. Prodinger, C. Schneider, and A. Weideman.
Padé Approximations to the Logarithm II: Identities, Recurrences, and Symbolic Computation.
Ramanujan Journal, 11(2):139-158, April 2006.
41
K. Driver, H. Prodinger, C. Schneider, and A. Weideman.
Padé Approximations to the Logarithm III: Alternative Methods and Additional Results.
Ramanujan Journal, 12(3):299-314, 2006.
42
P. Flajolet, S. Gerhold, and B. Salvy.
On the non-holonomic character of logarithms, powers and the nth prime function.
Electronic Journal of Combinatorics, 11(2):1-16, 2005.
43
P. Flajolet, S. Gerhold, and B. Salvy.
On the non-holonomic character of logarithms, powers, and the $n$th prime function.
Technical report, J. Kepler University Linz, 2005.
SFB report.
44
S. Gerhold.
Uncoupling systems of linear Ore operator equations.
Master's thesis, RISC, Johannes Kepler University Linz, 2002.
45
S. Gerhold.
On some non-holonomic sequences.
Electronic Journal of Combinatorics, 11(1):1-8, 12 2004.
46
S. Gerhold.
On the signs of recurrence sequences.
Technical report, SFB F013 Numerical und Symbolic Scientific Computing, 2004.
47
S. Gerhold.
Positivity of p-recursive sequences.
Seminaire Lotharingien de Combinatoire, 2004.
48
S. Gerhold.
Positivity of p-recursive sequences.
Contributed talk at Seminaire Lotharingien de Combinatoire, 10 2004.
49
S. Gerhold.
Combinatorial Sequences: Non-Holonomicity and Inequalities.
PhD thesis, RISC, J. Kepler University Linz, 2005.
50
S. Gerhold.
On some non-holonomic sequences.
Technical report, J. Kepler University Linz, 2005.
SFB report.
51
S. Gerhold.
Point Lattices and Oscillating Recurrence Sequences.
Journal of Difference Equations and Applications, 11(6):515-533, 2005.
52
S. Gerhold.
Recurrence Relations and Inequalities.
Invited colloquium talk at INRIA Rocquencourt, November 2005.
53
S. Gerhold.
Special Functions: Applications of Computer Algebra in Stochastics.
Invited colloquium talk at Vienna University of Technology, 10. January 2006.
54
S. Gerhold, L. Glebsky, C. Schneider, H. Weiss, and B. Zimmermann.
Limit states for one-dimensional schelling segregation models.
SFB-Report 2006-39, J. Kepler University, Linz, 2006.
55
S. Gerhold, L. Glebsky, C. Schneider, H. Weiss, and B. Zimmermann.
Limit states for one-dimensional schelling segregation models.
Communications in Nonlinear Science and Numerical Simulations, 2007.
To appear.
56
S. Gerhold and M. Kauers.
A computer proof of Turán's inequality.
Technical Report 2005-15, SFB F013, Johannes Kepler Universität, 2005.
57
S. Gerhold and M. Kauers.
A computer proof of turan's inequality.
Technical Report 2005-15, SFB F013, Altenbergerstrasse 69, September 2005.
58
S. Gerhold and M. Kauers.
A procedure for proving special function inequalities involving a discrete parameter.
Technical Report 2005-02, SFB F013, Johannes Kepler Universität, 2005.
59
S. Gerhold and M. Kauers.
A procedure for proving special function inequalities involving a discrete parameter.
SFB Report 2005-02, Johannes-Kepler-University, Altenberger Strasse 69, A-4040 Linz, January 2005.
60
S. Gerhold and M. Kauers.
A procedure for proving special function inequalities involving a discrete parameter.
In M. Kauers, editor, Proceedings of ISSAC '05, pages 156-162. ACM Press, 2005.
61
S. Gerhold and M. Kauers.
A computer proof of Turan's inequality.
Journal of Inequalities in Pure and Applied Mathematics, 7(2):1-4, May 2006.
Article 42.
62
S. Gerhold, M. Kauers, and J. Schöberl.
On a conjectured inequality for a sum of Legendre polynomials.
Technical Report 2006-11, SFB F013, Johannes Kepler Universität, 2006.
63
I. Gutman and P. Paule.
The variance of the vertex degrees of randomly generated graphs.
Publ. Fac. Electr. Engrg. Ser. Mat., 13:30-35, 2002.
64
M. Kauers.
Computing limits of sequences.
Poster presentation at ISSAC 2003, Philadelphia, August 2003.
65
M. Kauers.
Algorithmische beweise für neue klassen von kombinatorischen identitäten.
Invited colloquium talk at Universität Kassel, November 2004.
66
M. Kauers.
Computer proofs for polynomial identities in arbitrary many variables.
ISSAC 2004, Santander, Spain, July 2004.
67
M. Kauers.
Computer proofs for polynomial identities in arbitrary many variables.
In J. Gutierrez, editor, Proceedings of ISSAC 2004, pages 199-204. ACM Press, 2004.
68
M. Kauers.
Computer proofs for polynomial identities in arbitrary many variables.
Technical report, SFB Numeric and Symbolical Computation, March 2004.
69
M. Kauers.
Zet user manual.
Technical Report 2004-05, SFB F13, 2004.
70
M. Kauers.
Algorithms for Nonlinear Higher Order Difference Equations.
PhD thesis, RISC-Linz, Johannes Kepler Universität Linz, 2005.
71
M. Kauers.
Algorithms for nonlinear higher order difference equations.
Technical Report 05-10, RISC Report Series, University of Linz, Austria, October 2005.
Ph.D. thesis.
72
M. Kauers, editor.
Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation (ISSAC'05). ACM Press, 2005.
73
M. Kauers.
Solving difference equations whose coefficients are not transcendental.
Technical Report 2005-20, SFB F013, Johannes Kepler Universität, 2005.
74
M. Kauers.
Solving difference equations whose coefficients are not transcendental.
Technical Report 2005-20, SFB F013, December 2005.
75
M. Kauers.
SumCracker -- a package for manipulating symbolic sums and related objects.
Technical Report 2005-21, SFB F013, Johannes Kepler Universität, 2005.
76
M. Kauers.
Sumcracker: A package for manipulating symbolic sums and related objects.
Technical Report 2005-21, SFB F013, December 2005.
77
M. Kauers.
Application of unspecified sequences in symbolic summation.
Contributed talk at ISSAC'06, 2006-07-12 2006.
78
M. Kauers.
Computer algebra and power series with positive coefficients.
Technical Report 2006-33, SFB F013, Altenbergerstrasse 69, November 2006.
79
M. Kauers.
Computer algebra proofs for combinatorial inequalities and identities.
Invited talk at MAP'06, 2006.
80
M. Kauers.
Computer algebra proofs for combinatorial inequalities and identities.
Contributed talk at MAP 2006, 2006-01-12 2006.
81
M. Kauers.
Computer proof of a longstanding conjectured inequality of moll.
Contributed talk at SFB Cooperation Meeting, December 18 2006.
82
M. Kauers.
Problem 11258.
American Mathematical Monthly, December 2006.
83
M. Kauers.
Proving and finding algebraic dependencies of combinatorial sequences.
Invited talk at Special Semester on Groebner Bases and Related Methods, 08.05.2006 2006.
84
M. Kauers.
Shift equivalence of p-finite sequences.
Technical Report 2006-21, SFB F13, 2006.
85
M. Kauers.
Shift equivalence of p-finite sequences.
The Electronic Journal of Combinatorics, 13(1):1-16, 2006.
R100.
86
M. Kauers.
SumCracker--A package for manipulating symbolic sums and related objects.
Journal of Symbolic Computation, 41(9):1039-1057, 2006.
87
M. Kauers.
Symbolic computation for inequalities.
Contributed talk at SFB Annual Status Meeting (Strobl), 2006-04-21 2006.
88
M. Kauers.
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.
Transactions on Algorithms, 3(2):1-13, 2007.
article 18.
89
M. Kauers.
Computer algebra and power series with positive coefficients.
In Proceedings of FPSAC'07, pages 1-7, 2007.
to appear.
90
M. Kauers.
Computer algebra and power series with positive coefficients.
Contributed talk at FPSAC'07, 2007-07-02 2007.
91
M. Kauers.
Computer algebra for special function inequalities.
Invited talk at National Meeting of the AMS / Special Session on Experimental Mathematics, January 5 2007.
92
M. Kauers.
Computer algebra for special function inequalities.
Technical Report 2007-07, SFB F13, Altenbergerstrasse 69, March 2007.
93
M. Kauers.
Cylindrical algebraic decomposition and applications to special functions.
Invited colloquium talk at Max-Planck-Institute for Mathematics, Bonn, 2007-05-08 2007.
94
M. Kauers.
Gröbner Bases and applications to special functions.
Invited colloquium talk at Max-Planck-Institute for Mathematics, Bonn, 2007-05-09 2007.
95
M. Kauers.
A solution to exercise 95.
Invited colloquium talk at Rutgers University, 2007-07-26 2007.
96
M. Kauers.
Stirling number identities.
Contributed talk at SFB Annual Status Meeting (Strobl), 2007-04-12 2007.
97
M. Kauers.
Stirling number identities.
Invited talk at Methods of Proof theory in Mathematics, 2007-06-05 2007.
98
M. Kauers.
Summation algorithms for stirling number identities.
Technical Report 2007-11, SFB F013, Altenbergerstrasse 69, 2007.
99
M. Kauers.
Symbolic summation with radical expressions.
Contributed talk at ISSAC'07, 2007-07-31 2007.
100
M. Kauers, M. Kerber, R. Miner, and W. Windsteiger, editors.
Towards Mechanized Mathematical Assistants, Proceedings of Calculemus'07 and MKM'07 conferences, Hagenberg, Austria, volume 4573 of Lecture Notes in Computer Science, Heidelberg, 2007. Springer.
101
M. Kauers and C. Koutschan.
A mathematica package for q-holonomic sequences and power series.
Technical Report 2007-16, SFB F013, 2007.
102
M. Kauers and V. Levandovskyy.
An interface between mathematica and singular.
Technical Report 2006-29, SFB F013, 2006.
103
M. Kauers and P. Paule.
A Computer Proof of Moll's Log-Concavity Conjecture.
Technical Report 2006-15, SFB F013, Johannes Kepler Universität, 2006.
104
M. Kauers and P. Paule.
A computer proof of Moll's log-concavity conjecture.
Proceedings of the AMS, 135(12):3847-3856, 2007.
105
M. Kauers and C. Schneider.
Indefinite summation with unspecified sequences.
SFB-Report 2004-13, J. Kepler University, Linz, 2004.
106
M. Kauers and C. Schneider.
Application of unspecified sequences in symbolic summation.
Technical Report 2005-19, SFB F013, Johannes Kepler Universität, 2005.
107
M. Kauers and C. Schneider.
Application of unspecified sequences in symbolic summation.
In J.-G. Dumas, editor, Proceedings of ISSAC'06, pages 177-183. ACM Press, 2006.
108
M. Kauers and C. Schneider.
Indefinite summation with unspecified summands.
Discrete Math., 306(17):2073-2083, 2006.
109
M. Kauers and C. Schneider, February 2007.
110
M. Kauers and C. Schneider.
Automated proofs for some stirling number identities.
Technical Report 2007-23, SFB F013, J. Kepler University Linz, 2007.
111
M. Kauers and C. Schneider.
Symbolic summation with radical expressions.
Technical Report 2007-02, SFB F13, Altenbergerstrasse 69, January 2007.
112
M. Kauers and C. Schneider.
Symbolic summation with radical expressions.
In C. W. Brown, editor, Proceedings of ISSAC'07, pages 219-226, 2007.
113
C. Koutschan.
Regular languages and their generating functions: The inverse problem.
Master's thesis, Friedrich-Alexander-Universität Erlangen-Nürnberg, August 2005.
114
C. Koutschan.
Regular languages and their generating functions: The inverse problem.
Technical Report 2006-25, SFB F013, Johannes Kepler University Linz, 2006.
115
C. Koutschan.
Computer Algebra Algorithms for $\partial$-Finite and Holonomic Functions.
PhD thesis, RISC-SFB F013, J. Kepler University, 2007.
In preparation.
116
C. Koutschan.
Computer algebra systems - a practical guide (michael wester, editor), 2007.
117
C. Koutschan.
A division view on p-finite recurrences.
Contributed talk at SFB Status Seminar, April 12 2007.
118
C. Koutschan.
Linear recurrences and power series division.
Technical Report 2007-20, SFB F013, Johannes Kepler University, A-4040 Linz, 2007.
119
C. Koutschan.
Regular languages and their generating functions: The inverse problem.
Theoretical Computer Science, pages 1-10, 2007.
To appear.
120
M. Kuba, H. Prodinger, and C. Schneider.
Generalized reciprocity laws for sums of harmonic numbers.
Technical Report 2005-17, J. Kepler University Linz, 2005.
SFB-Report.
121
P. J. Larcombe, A. Riese, and B. Zimmermann.
Computer proofs of matrix product identities.
J. Algebra Appl., 3:105-109, 2004.
122
R. Lyons, P. Paule, and A. Riese.
A computer proof of a series evaluation in terms of harmonic numbers.
Appl. Algebra Engrg. Comm. Comput., 13:327-333, 2002.
123
S. Moch and C. Schneider.
Feynman integrals and difference equations.
Technical Report 2007-22, SFB F013, J. Kepler University Linz, 2007.
124
R. Osburn and C. Schneider.
Gaussian hypergeometric series and extensions of supercongruences.
SFB-Report 2006-38, J. Kepler University, Linz, 2006.
125
I.-C. Pau.
Bijections between partitions of numbers.
PhD thesis, RISC, Johannes Kepler University Linz, 2000.
In preparation.
126
P. Paule.
Automatic hypergeometric summation: The WZ-engine in theory and practice.
Invited key lecture at the ``Summerschool on Group Theory and Lie Algebras'', Leiden, 1998.
127
P. Paule.
Automatic hypergeometric summation: The WZ-engine in theory and practice.
Invited key-lecture and computer algebra presentation at ``Summerschool on Group Theory and Lie Algebras'', Leiden, Netherlands, 1998.
128
P. Paule.
Hypergeometric summation: Fine-tuning of the WZ-engine.
Invited key lecture, Seminaire Lotharingien de Combinatoire, Strasbourg, 1998.
129
P. Paule.
Hypergeometric summation: Tables AND algorithms.
Invited lecture, DLMF Seminar Series, NIST, Gaithersburg, 1998.
130
P. Paule.
Hypergeometric sums and multisums: tuning the WZ engine.
Invited key-lecture at ``41st Sém. Lothar. Combin.'', Strasbourg, France, 1998.
131
P. Paule.
$q$WZ-theory and Bailey chains.
Invited talk, INRIA-Paris, 1998.
132
P. Paule.
WZ theory: Back to Chapter I.
Invited lecture, Symbolic Computation Workshop, MSRI, Berkeley, 1998.
133
P. Paule.
Algorithmic aspects of $q$-hypergeometric summation.
Invited talk at Conference on Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, Gainesville, Florida, November 1999.
134
P. Paule.
The renaissance of MacMahon's partition analysis.
Invited talk at Euroconference on Algebraic Combinatorics and Applications, September 1999.
135
P. Paule.
The renaissance of MacMahon's partition analysis.
Invited talk at Nankai University, China, October 1999.
136
P. Paule.
Symbolic summation: Recent progress.
Talk at SNSC'99, Hagenberg, Austria, August 1999.
137
P. Paule.
Computer algebra and multiple sums.
Invited lecture at ``Special Functions 2000'', Tempe, Arizona, 2000.
138
P. Paule.
Computeralgebra und Kombinatorik: der Omega Kalkül von MacMahon.
Invited talk at University Munich, 2000.
139
P. Paule.
MacMahon's partition analysis revisited.
Invited talk at INRIA, Paris, 2000.
140
P. Paule.
New computer algebra packages for $q$-series: Engel and qMultiSum.
Invited talk at INRIA, Paris, 2000.
141
P. Paule.
Omega -- a computer algebra package for MacMahon's partition analysis.
Invited lecture at ``Conference on $q$-Series with Applications to Combinatorics, Number Theory and Physics'', Urbana-Champaign, Illinois, 2000.
142
P. Paule.
Ramanujans Traum: Computer beweisen kombinatorische Identitäten.
Invited talk at University Salzburg, 2000.
143
P. Paule.
Symbolic summation -- recent progress.
Invited lecture at ``10th SIAM Conference on Discrete Mathematics'', Minneapolis, Minnesota, 2000.
144
P. Paule.
Symbolic summation and physics: summation and MacMahon's partition analysis.
Invited key-lecture at ``6th International School on Theoretical Physics'', Rzeszow, Poland, 2000.
145
P. Paule.
Symbolic summation and physics: summation and recurrences.
Invited key-lecture at ``6th International School on Theoretical Physics'', Rzeszow, Poland, 2000.
146
P. Paule.
Computer algebra and combinatorics: MacMahon's partition analysis revisited.
Invited talk at University Amsterdam, The Netherlands, October 2001.
147
P. Paule.
Computeralgebra und Kombinatorik: der Omega-Kalkül von MacMahon.
Invited talk at University Innsbruck, Austria, April 2001.
148
P. Paule.
Contiguous relations and creative telescoping.
Invited talk at University Amsterdam, The Netherlands, November 2001.
149
P. Paule.
Plane partition diamonds.
Contributed talk at ``46th Sém. Lothar. Combin.'', Lyon, France, March 2001.
150
P. Paule.
Symbolic computation and wavelets.
Invited talk at the IMACS conference on applications of Computer Algebra, Albuquerque, New Mexico, June 2001.
151
P. Paule.
The WZ method -- A contiguous approach.
Invited talk at Pennsylvania State University, July 2001.
152
P. Paule.
MacMahon's partition analysis and the Omega package.
Invited talk at University of Waterloo, Ontario, Canada, October 2002.
153
P. Paule.
Symbolic summation: Algorithms and missed opportunities.
Invited talk at ``Special Functions in the Digital Age'', Minneapolis, Minnesota, July 2002.
154
P. Paule.
Symbolic summation: Creative telescoping revisited.
Invited talk at University of Waterloo, Ontario, Canada, September 2002.
155
P. Paule.
Computer algebra and combinatorics: The renaissance of MacMahon's partition analysis.
Colloquium talk at University of Strasbourg, France, May 2003.
156
P. Paule.
Computeralgebra und die Rogers-Ramanujan Identitäten.
Colloquium talk at University Innsbruck, Austria, June 2003.
157
P. Paule.
Contiguous relations and creative telescoping.
Colloquium talk at Rutgers University, February 2003.
158
P. Paule.
Contiguous relations and creative telescoping.
Invited talk at 50th Lotharingien Seminar of Combinatorics, Domaine Saint-Jacques, France, March 2003.
159
P. Paule.
A new algorithmic approach to contiguous relations.
Colloquium talk at Pennsylvania State University, February 2003.
160
P. Paule.
A new family of harmonic number identities and the Newton-Andrews-Zeilberger algorithm.
Colloquium talk at Pennsylvania State University, February 2003.
161
P. Paule.
Special functions and computer algebra.
Invited talk at Conference on Special Functions, Representation Theory and Applications, University of Amsterdam, The Netherlands, August 2003.
162
P. Paule.
Special functions, computer algebra and numerics.
Invited talk at International Workshop on Numerical and Symbolic Scientific Computing, Strobl, Austria, June 2003.
163
P. Paule.
Symbolic summation: Constructive aspects and verification.
Invited talk at Schloß Dagstuhl, Germany, January 2003.
164
P. Paule.
Algorithmic combinatorics: a new discipline.
University of Vienna, June 2004.
165
P. Paule.
Algorithmic Combinatorics: A New Discipline.
Invited colloquium talk at University of Vienna, June 2004.
166
P. Paule.
Computer algebra and Stembridge's TSPP theorem.
Nanakai University, China, August 2004.
167
P. Paule.
Computer algebra and Stembridge's TSPP theorem.
Invited talk at Combinatorics, Physics and Special Functions, Conference honoring Jim Louck, August 2004.
168
P. Paule.
Computer-assisted proving and finding in combinatorics and special functions.
CIRM at Luminy (near Marseille), January 2004.
169
P. Paule.
Computer-assisted proving and finding in combinatorics and special functions.
Invited talk at Conference on Computer Algebra, Certified algorithms, Constructive proofs, January 2004.
170
P. Paule.
A computerized proof of Stembridge's TSPP theorem.
University of Bayreuth, July 2004.
171
P. Paule.
A computerized proof of Stembridge's TSPP theorem.
Pennsylvania State University, March 2004.
172
P. Paule.
A computerized proof of Stembridge's TSPP theorem.
Invited colloquium talk at Pennsylvania State University, USA, March 2004.
173
P. Paule.
A computerized proof of Stembridge's TSPP theorem.
Invited colloquium talk at University of Bayreuth, Germany, July 2004.
174
P. Paule.
Constructive mathematics in the digital age.
MMRC, Chinese Academy of Sciences, Beijing, China, August 2004.
175
P. Paule.
Constructive mathematics in the digital age.
Invited colloquium talk at MMRC, Chinese Academy of Sciences, Beijing, China, August 2004.
176
P. Paule.
Computer Algebra Proofs of Frank Olver's Problems.
Invited talk at the Editorial Meeting of the Digital Library of Mathematical Functions (DLMF), National Institute of Standards and Technology (NIST), Gaithersburg, USA, 6. May 2005.
177
P. Paule.
Computer algebra proofs of Frank Olver's problems.
Invited talk at Editorial Meeting of the Digital Library of Mathematical Functions (DLMF), May 2005.
178
P. Paule.
Computer Algebra Tools for Special Functions in Physics.
Invited talk at the Theoretical Physics Lab, NIST, Gaithersburg, USA, 9. May 2005.
179
P. Paule.
Computer algebra tools for special functions in physics.
Invited colloquium talk at National Institute of Standards and Technology (NIST), Gaithersburg, USA, May 2005.
180
P. Paule.
Contiguous Relations and Creative Telescoping.
Invited talk at the International Conference on Difference Equations, Special Functions and Applications, Munich, Germany, 29. June 2005.
181
P. Paule.
Contiguous relations and creative telescoping.
Invited key-note lecture. Invited talk at International Conference on Difference Equations, Special Functions and Applications, July 2005.
182
P. Paule.
Partition Analysis: MacMahon's Dream came true.
Invited talk at Festkolloquium for Prof. J. Cigler, University of Vienna, Austria, 30. September 2005.
183
P. Paule.
Partitionsanalysis: MacMahon's Traum wurde Wirklichkeit.
Invited talk at TU Graz, 2. December 2005.
184
P. Paule.
Plane Partitions Revisited.
Invited talk at Special Session Algebraic Combinatorics, Joint Meeting of AMS, DMV, and ÖMG, Mainz, Germany, 15. June 2005.
185
P. Paule.
Plane partitions revisited.
Invited talk at Joint meeting of the AMS, GMV and OeMG societies, June 2005.
186
P. Paule.
Special Functions and Computer Algebra.
Invited talk at Dagstuhl Seminar: Mathematics, Algorithms, Proofs, 10. January 2005.
187
P. Paule.
Special functions and computer algebra.
Invited talk at Dagstuhl Seminar: Mathematics, Algorithms, and Proofs - MAP'05, January 2005.
188
P. Paule.
Computer Algebra, Proving, and the Digital Library of Mathematical Functions.
Invited talk at the MAP'06 Conference, Castro Urdiales, Spain, 10. January 2006.
189
P. Paule.
Quartics, log-concavity and computer algebra.
Dagstuhl Seminar No. 06271. Invited talk at Challenges in Symbolic Computation Software, 2-7 July 2006.
190
P. Paule.
Computer algebra and the rogers-ramanujan identities.
Invited tutorial lecture. Invited talk at Special Semester on Methods of Proof Theory in Mathematics, May 3rd 2007.
191
P. Paule.
Computer algebra und macmahon's partition analysis.
Invited tutorial lecture. Invited talk at Special Semester on Methods of Proof Theory in Mathematics, May 3rd 2007.
192
P. Paule.
A computer proof of a conjecture of Moll.
Contributed talk at Mathematics: Algorithms and Proofs - MAP'07, Lorentz Center, Leiden, The Netherlands, January 8-12 2007.
193
P. Paule.
A computer proof of a conjecture of Moll.
Invited talk at Mathematics: Algorithms and Proofs - MAP'07, 8-12 January 2007.
194
P. Paule.
Let's compute a proof: Aspects of computer algebra in proving.
Invited key-note lecture. Invited talk at 14th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning - CALCULEMUS 2007, June 2007.
195
P. Paule.
Perspektiven: Beweisen mit dem computer.
Invited colloquium talk at University Bayreuth, Germany, July 20th 2007.
196
P. Paule.
Symbolic computation in combinatorics: Recent progress at risc.
Invited key-note lecture. Invited talk at Conference on Formal Power Series and Algebraic Combinatorics -FPSAC'07, July 2007.
197
P. Paule, V. Pillwein, C. Schneider, and S. Schöberl.
Hypergeometric Summation Techniques for High Order Finite Elements.
PAMM, 6, 2006.
198
P. Paule and H. Prodinger.
Fountains, histograms, and $q$-identities.
Discrete Math. Theor. Comput. Sci., 6:101-106, 2003.
199
P. Paule, O. Scherzer, and A. Schoisswohl.
Wavelets with scale dependent properties.
In F. Winkler and U. Langer, editors, Symbolic and Numerical Scientific Computation, volume 2630 of Lecture Notes in Comput. Sci., pages 255-265. Springer, 2003.
200
P. Paule and C. Schneider.
Computer proofs of a new family of harmonic number identities.
Adv. in Appl. Math., 31(2):359-378, 2003.
201
P. Paule and C. Schneider.
Truncating binomial series with symbolic summation.
SFB-Report 2006-42, J. Kepler University, Linz, 2006.
202
P. Paule and C. Schneider.
Truncating binomial series with symbolic summation.
INTEGERS. Electronic Journal of Combinatorial Number Theory, 7:1-9, 2007.
203
P. Paule and V. Strehl.
Definite summation and hypergeometric identities.
In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors, Computer Algebra Handbook: Foundations, Applications, Systems. Springer, 2003.
204
R. Pemantle and C. Schneider.
When is 0.999... equal to 1?
SFB-Report 2004-30, J. Kepler University, Linz, 2004.
205
S. Radu.
New upper bounds on rubik's cube.
Technical Report 07-08, Combinatorics, 2007.
206
A. Riese.
Omega -- A Mathematica implementation of partition analysis, 1998.
Available via: http://www.risc.uni-linz.ac.at/research/combinat/risc/software/Omega.
207
A. Riese.
RatDiff -- A Mathematica implementation of Mark van Hoeij's algorithm for finding rational solutions of linear difference equations, 1998.
Available via: http://www.risc.uni-linz.ac.at/research/combinat/risc/software/RatDiff.
208
A. Riese.
Treating $q$-identities with the computer.
Contributed talk at Conference on Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, Gainesville, Florida, November 1999.
209
A. Riese.
Curing syndromes with computer algebra.
Contributed talk at Conference on $q$-Series with Applications to Combinatorics, Number Theory and Physics, Urbana-Champaign, Illinois, October 2000.
210
A. Riese.
Symbolic $q$-hypergeometric summation and partition analysis.
Contributed talk at ``Special Functions 2000'', Tempe, Arizona, June 2000.
211
A. Riese.
Fine-tuning Zeilberger's algorithm -- The methods of automatic filtering and creative substituting.
In F. G. Garvan and M. E. H. Ismail, editors, Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, volume 4 of Developments in Mathematics, pages 243-254. Kluwer, 2001.
212
A. Riese.
qMultiSum -- A package for proving $q$-hypergeometric multi-sums.
Contributed talk at ``46th Sém. Lothar. Combin.'', Lyon, France, March 2001.
213
A. Riese.
Computer proofs of hypergeometric summation identities and partition analysis.
Invited talk at ``Special Functions in the Digital Age'', Minneapolis, Minnesota, July 2002.
214
A. Riese.
Randomization speeds up hypergeometric summation.
Contributed talk at ``SFB Workshop'', Strobl, Austria, April 2002.
215
A. Riese.
Computer algebra algorithms for symbolic summation.
Poster presentation at International Workshop on Numerical and Symbolic Scientific Computing, Strobl, Austria, June 2003.
216
A. Riese.
Hypergeometric series for high order finite elements.
Contributed talk at SFB Workshop, Strobl, Austria, April 2003.
217
A. Riese.
An introduction to symbolic ($q$-) hypergeometric summation.
Colloquium talk at Geometry-Topology Seminar, School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, September 2003.
218
A. Riese.
qMultiSum -- A package for proving $q$-hypergeometric multiple summation identities.
J. Symbolic Comput., 35:349-376, 2003.
219
A. Riese.
Special functions and high order finite elements.
Contributed talk at SFB Workshop, Strobl, Austria, April 2004.
220
C. Schneider.
A Mathematica implementation of Karr's summation algorithm.
Contributed talk at Seminaire Lotharingien de Combinatoire, Schoenthal, Germany, March 1999.
221
C. Schneider.
An implementation of Karr's summation algorithm in Mathematica.
Sém. Lothar. Combin., S43b:1-10, 2000.
222
C. Schneider.
Symbolic summation in difference fields.
Contributed talk at ``10th SIAM Conference on Discrete Mathematics'', Minneapolis, Minnesota, June 2000.
223
C. Schneider.
Symbolic Summation in Difference Fields.
PhD thesis, RISC, Johannes Kepler University Linz, 2001.
224
C. Schneider.
Symbolic summation in difference fields.
Talk at the ``Conference Symbolic and Numerical Scientific Computation (SNSC'01)'', Hagenberg, Austria, September 2001.
225
C. Schneider.
A collection of denominator bounds to solve parameterized linear difference equations in ${\Pi}{\Sigma}$-fields.
SFB-Report 02-20, J. Kepler University, Linz, 2002.
226
C. Schneider.
Degree bounds to find polynomial solutions of parameterized linear difference equations in ${\Pi}{\Sigma}$-fields.
SFB-Report 02-21, J. Kepler University, Linz, 2002.
227
C. Schneider.
How one can play with sums.
Contributed talk at the 8th Rhine Workshop on Computer Algebra, Mannheim, Germany, March 2002.
228
C. Schneider.
How one can play with sums, presented at the 8th Rhine workshop on computer algebra.
RISC-Report 02-24, J. Kepler University, Linz, 2002.
229
C. Schneider.
Sigma: A summation package for discovering and proving.
Invited talk at the IMA Summer Program on ``Special Functions in the Digital Age'', Minnesota, Minneapolis, July 2002.
230
C. Schneider.
Sigma: A summation package for discovering sum identities.
Invited talk at the University of Stellenbosch, South Africa, September 2002.
231
C. Schneider.
Sigma: A summation package for discovering sum identities.
Invited talk at the University of Witwatersrand, Johannesburg, South Africa, September 2002.
232
C. Schneider.
Sigma: A summation package for discovering sum identities.
Invited talk at the Mathematics Department, University of Graz, Austria, September 2002.
233
C. Schneider.
Solving parameterized linear difference equations in ${\Pi}{\Sigma}$-fields.
SFB-Report 02-19, J. Kepler University, Linz, 2002.
234
C. Schneider.
Symbolische Summation in Differenzen-Körpern.
Invited talk at Montana University, Leoben, Austria, January 2002.
235
C. Schneider.
A unique representation of solutions of parameterized linear difference equations in ${\Pi}{\Sigma}$-fields.
SFB-Report 02-22, J. Kepler University, Linz, 2002.
236
C. Schneider.
A note on the number of rhombus tilings of a symmetric hexagon and symbolic summation.
Technical Report 03-09, RISC-Linz, J. Kepler University, Linz, 2003.
237
C. Schneider.
Pade approximation, multisums, and Theorema.
Invited talk at International Workshop on ``Numerical and Symbolic Scientific Computing'', Strobl, Austria, 2003.
238
C. Schneider.
Product representations in ${\Pi}{\Sigma}$-fields.
SFB-Report 2003-10, J. Kepler University, Linz, 2003.
239
C. Schneider.
Symbolic summation in ${\Pi}{\Sigma}$-fields.
Invited talk at the Special Session on Symbolic Summation at Applications of Computer Algebra Conference (ACA2003), Raleigh, North Carolina, 2003.
240
C. Schneider.
A collection of denominator bound to solve parameterized linear difference equations in ${\Pi}{\Sigma}$-extensions.
Contributed talk at SYNASC 2004, Timisoara, Romania, 27. September 2004.
241
C. Schneider.
A collection of denominator bounds to solve parameterized linear difference equations in ${\Pi}{\Sigma}$-extensions.
SYNASC 2004, Timisoara, Romania, September 2004.
242
C. Schneider.
A collection of denominator bounds to solve parameterized linear difference equations in ${\Pi}{\Sigma}$-extensions.
In D. Petcu, V. Negru, D. Zaharie, and T. Jebelean, editors, Proc. SYNASC04, 6th Internat. Symposium on Symbolic and Numeric Algorithms for Scientific Computation, pages 269-282, Timisoara (Romania), September 2004. Mirton Publishing.
243
C. Schneider.
A collection of denominator bounds to solve parameterized linear difference equations in ${\Pi}{\Sigma}$-extensions.
An. Univ. Timisoara Ser. Mat.-Inform., 42(2):163-179, 2004.
Extended version of Proc. SYNASC'04; preliminary version online.
244
C. Schneider.
A new sigma approach to multi-summation.
SFB-Report 2004-10, J. Kepler University, Linz, June 2004.
245
C. Schneider.
Proving and finding multisum identities in difference fields.
Computer Algebra, Certified algorithms, Constructive proofs, Luminy, France, January 2004.
246
C. Schneider.
Proving and finding multisum identities in difference fields.
Luminy, France. Invited talk at Computer Algebra, Certified algorithms, Constructive proofs, 16. January 2004.
247
C. Schneider.
Solving parameterized linear difference equations in terms of indefinite nested sums and products.
SFB-Report 2004-29, J. Kepler University, Linz, 2004.
248
C. Schneider.
The summation package Sigma: Underlying principles and a rhombus tiling application.
Discrete Math. Theor. Comput. Sci., 6(2):365-386, 2004.
249
C. Schneider.
The summation package sigma: Underlying principles and a rhombus tiling application.
SFB-Report 2004-28, J. Kepler University, Linz, 2004.
250
C. Schneider.
Symbolic summation over recurrences and indefinite nested sums and products.
GAMM Jahrestagung 2004, Dresden, Germany, March 2004.
251
C. Schneider.
Symbolic summation over recurrences and indefinite nested sums and products.
Contributed talk at GAMM Jahrestagung 2004, Dresden, Germany, 23. March 2004.
252
C. Schneider.
Symbolic summation with single-nested sum extensions.
ISSAC'04, Santander, Spain, July 2004.
253
C. Schneider.
Symbolic summation with single-nested sum extensions.
Contributed talk at ISSAC'04, Santander, Spain, 6. July 2004.
254
C. Schneider.
Symbolic summation with single-nested sum extensions.
In J. Gutierrez, editor, Proc. ISSAC'04, pages 282-289. ACM Press, 2004.
255
C. Schneider.
Symbolic summation with single-nested sum extensions (extended version).
SFB-Report 2004-7, J. Kepler University, Linz, 2004.
Published in Proc. ISSAC'04.
256
C. Schneider.
Degree bounds to find polynomial solutions of parameterized linear difference equations in ${\Pi}{\Sigma}$-fields.
Appl. Algebra Engrg. Comm. Comput., 16(1):1-32, 2005.
257
C. Schneider.
Finding telescopers with minimal depth for indefinite nested sum and product expressions.
In M. Kauers, editor, Proc. ISSAC'05, pages 285-292. ACM, 2005.
258
C. Schneider.
Finding telescopers with minimal depth for indefinite nested sum and product expressions.
Contributed talk at ISSAC'05, Beijing, China, 27. July 2005.
259
C. Schneider.
Finding telescopers with minimal depth for indefinite nested sum and product expressions (extended version).
Technical Report 2005-08, J. Kepler University Linz, 2005.
SFB-Report.
260
C. Schneider.
Lecture ``Analysis of algorithms and symbolic summation'' in the frame of the european erasum/socrates programme.
Invited colloquium talk at West University of Timisoara, Faculty of Mathematics and Computer Science, 13. May 2005.
261
C. Schneider.
A new Sigma approach to multi-summation.
Advances in Applied Math. Special Issue Dedicated to Dr. David P. Robbins. Edited by D. Bressoud, 34(4):740-767, 2005.
262
C. Schneider.
Product representations in ${\Pi}{\Sigma}$-fields.
Annals of Combinatorics, 9(1):75-99, 2005.
263
C. Schneider.
Solving parameterized linear difference equations in terms of indefinite nested sums and products.
J. Differ. Equations Appl., 11(9):799-821, 2005.
264
C. Schneider.
Some notes on ``When is 0.999 equal to 1?''.
Invited talk at the Seminar ``Mathematics, Algorithms, Proofs'', IBFI Schloss Dagstuhl, Wadern, Germany, 10. January 2005.
265
C. Schneider.
When is $0.999...$equal to $1$?
Invited talk at Special Session Algebraic Combinatorics, Joint Meeting of AMS, DMV, and ÖMG, Mainz, Germany, 16. June 2005.
266
C. Schneider.
Apery's double sum is plain sailing indeed.
SFB-Report 2006-41, J. Kepler University, Linz, 2006.
267
C. Schneider.
Parameterized telescoping proves algebraic independence of sums.
SFB-Report 2006-40, J. Kepler University, Linz, 2006.
268
C. Schneider.
Sigma - a package for multi-summation.
Invited talk at Axiom Workshop 2006, RISC, Hagenberg, Austria, April 27 2006.
269
C. Schneider.
Simplifying sums in ${\Pi}{\Sigma}^*$-extensions.
Technical Report 2006-13, J. Kepler University, 2006.
SFB-Report.
270
C. Schneider.
Some notes on ``when is 0.999... equal to 1?''.
In T. C. et al., editor, Mathematics, Algorithms, Proofs, number 05021 in Dagstuhl Seminar Proceedings, pages 1-3. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2006.
271
C. Schneider.
The summation package sigma simplifies harmonic sum expressions.
Invited colloquium talk at DESY, Zeuthen, Germany, 21. September 2006.
272
C. Schneider.
Symbolic summation assists combinatorics.
Series of invited keynote talks at 56th Sém. Lothar. Combin., Ellwangen, Germany, April 9 - 12 2006.
273
C. Schneider.
Symbolic summation assists combinatorics.
SFB-Report 2006-37, J. Kepler University, Linz, 2006.
274
C. Schneider.
Apéry's double sum is plain sailing indeed.
Electron. J. Combin., 14:1-3, 2007.
N5.
275
C. Schneider.
Multi-summation and d-finite sequences.
Invited colloquium talk at Trisemestre on Methods of Proof Theory in Mathematics, Max Planck Institute for Mathematics, Bonn, Germany, 2. May 2007.
276
C. Schneider.
Multi-summation tools and special functions.
Invited talk at Conference on Methods of Proof Theory in Mathematics, Max Planck Institute for Mathematics, Bonn, Germany, 6. June 2007.
277
C. Schneider.
Parameterized telescoping proves algebraic independence of sums.
In Proc. FPSAC'07, pages 1-12, 2007.
278
C. Schneider.
Parameterized telescoping proves algebraic independence of sums.
Poster presentation at FPSAC 2007, 2007.
279
C. Schneider.
A refined difference field theory for symbolic summation.
Technical Report 2007-24, SFB F013, J. Kepler University Linz, 2007.
280
C. Schneider.
Simplifying sums in ${\Pi}{\Sigma}$-extensions.
J. Algebra Appl., 6(3):415-441, 2007.
281
C. Schneider.
The summation package Sigma evaluates Feynman integrals.
Contributed talk at ACAT, XI International Workshop on Advanced Computing and Analysis Techniques in Physics Research, 25. April 2007.
282
C. Schneider.
The summation package sigma evaluates Feynman integrals.
Invited talk at Computer Algebra and Particle Physics, CAPP 2007, 29. March 2007.
283
C. Schneider.
Symbolic summation and applications.
Invited colloquium talk at Trisemestre on Methods of Proof Theory in Mathematics, Max Planck Institute for Mathematics, Bonn, Germany, 30. April 2007.
284
C. Schneider.
Symbolic summation assists combinatorics.
Sem. Lothar. Combin., 56:1-36, 2007.
Article B56b.
285
C. Schneider and M. Kauers.
Application of unspecified sequences in symbolic summation.
Technical Report 2005-19, SFB F013, December 2005.
286
C. Schneider and R. Pemantle.
When is 0.999... equal to 1?
Amer. Math. Monthly, 114(4):344-350, 2007.
287
M. Semrad.
Special functions, computer proofs and the dlmf.
Master's thesis, RISC, J. Kepler University Linz, 2005.
288
C. Weixlbaumer.
Solutions of difference equations with polynomial coefficients.
Master's thesis, RISC, Johannes Kepler University Linz, 2001.
289
B. Zimmermann.
Difference forms and hypergeometric summation.
Master's thesis, University of Vienna, 2000.
290
B. Zimmermann.
WZ forms in hypergeometric summation.
Contributed talk at ``44th Sém. Lothar. Combin.'', Domaine Saint-Jacques, France, March 2000.
291
B. Zimmermann.
Structure set computation in hypergeometric summation.
Contributed talk at Eighth International Conference on Applications of Computer Algebra, Volos, Greece, June 2002.
292
B. Zimmermann.
Wavelets and Gröbner bases: How to reduce the number of variables by a factor of two.
Contributed talk at GAMM 2002, Augsburg, Germany, March 2002.
293
B. Zimmermann.
A Sister-Celine-type algorithm for definite summation and integration.
Poster presentation at ISSAC 2003, Philadelphia, August 2003.
294
B. Zimmermann.
Summation in difference-differential rings.
Invited talk at International Conference on Applications of Computer Algebra, Raleigh, North Carolina, July 2003.
295
B. Zimmermann.
Symbolic integration and summation of special functions.
Poster presentation at International Workshop on Numerical and Symbolic Scientific Computing, Strobl, Austria, June 2003.
296
B. Zimmermann.
Definite symbolic integration and summation of special functions.
Contributed talk at Summer School On Orthogonal Polynomials And Special Functions, July 2004.
297
B. Zimmermann.
Computing recurrences for parameter-dependent integrals.
Poster at the Fourth International School on Computer Algebra CoCoA 4, May 2005.
298
B. Zimmermann.
Parametrizing bronstein's ``poor man's'' integrator.
Contributed talk at SFB Status-Seminar, April 21 2006.
299
B. Zimmermann.
On symbolic definite summation.
Contributed talk at SFB Status-Seminar 2007, April 21 2007.
300
B. Zimmermann.
Symbolic Definite Intergration and Summation of Special Functions.
PhD thesis, RISC, Johannes Kepler University Linz, 2007.
In preparation.




Please direct your comments or eventual problem reports to webmaster.

SpezialForschungsBereich SFB F013 | Special Research Program of the FWF - Austrian Science Fund