RISC JKU

Algorithmic Combinatorics Publications

Type: [any] [Papers] [Theses] [Technical Reports] [Other
Author: [any] [Ablinger] [Paule] [Kauers] [Koutschan] [Pillwein] [Radu] [Schneider
Year: [any] [2024] [2023] [2022] [2021] [2020] [2019] [earlier

Bruno Buchberger, Manuel Kauers. Groebner Bases. Scholarpedia 5(10), pp. 7763-7763. October 2010. ISSN 1941-6016. [url] [bib]
Cha Yongjae, van Hoeij Mark, Levy Giles. Solving recurrence relations using local invariants. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, Stephen Watt (ed.), ISSAC '10 , pp. 303-309. 2010. ACM, New York, NY, USA, ISBN 978-1-4503-0150-3. [url] [bib]
Yongjae Cha. Closed Form Solutions of Linear Difference Equations. Florida State University. PhD Thesis. 2010. [url] [bib]
Yongjae Cha, Mark van Hoeij, Giles Levy. Solving Linear Recurrence Equations. 2010. Software presentation at ISSAC 2010. [bib]
B. Erocal and W. Stein. The Sage project: Unifying free mathematical software to create a viable alternative to Magma, Maple, Mathematica and MATLAB. In: Mathematical Software - ICMS 2010, 2010 (ed.), Lecture Notes in Computer Science 6327, pp. 12-27. 2010. Springer, ISBN 978-3-642-15581-9. [pdf] [bib]
B. Erocal and A. Storjohann. Nullspace computation over rational function fields for symbolic summation. 2010. Also appeared in ACM Communications in Computer Algebra, Vol. 44, No. 3, September 2010. Poster presentation at ISSAC 2010. [pdf] [bib]
B. Erocal and A. Storjohann. Nullspace computation over rational function fields for symbolic summation. 2010. Also appeared in ACM Communications in Computer Algebra, Vol. 44, No. 3, September 2010. Poster presentation at ISSAC 2010. [bib]
Alin Bostan, Manuel Kauers. The Complete Generating Function for Gessel Walks is Algebraic. Proceedings of the AMS 138(9), pp. 3063-3078. September 2010. ISSN 0002-9939. [pdf] [ps] [bib]
Manuel Kauers, Veronika Pillwein. When can we detect that a P-finite sequence is positive?. In: Proceedings of ISSAC'10, Stephen Watt (ed.), pp. 195-202. 2010. 978-1-4503-0150-3. [ps] [pdf] [bib]
Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz. Dominance in the family of Sugeno-Weber t-norms. ArXiv. Technical report no. 1007.5442, July 2010. [ps] [pdf] [bib]
Manuel Kauers, Doron Zeilberger. The Computational Challenge of Enumerating High Dimensional Rook Paths. ArXiv. Technical report no. 1011.4671, 2010. [ps] [pdf] [bib]
Christoph Koutschan. HolonomicFunctions (User's Guide). Technical report no. 10-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. January 2010. [url] [pdf] [bib]
Christoph Koutschan. A Fast Approach to Creative Telescoping. Mathematics in Computer Science 4(2-3), pp. 259-266. 2010. ISSN 1661-8270. [pdf] [bib]
Christoph Koutschan. Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem. In: Gems in Experimental Mathematics, Tewodros Amdeberhan and Luis A. Medina and Victor H. Moll (ed.), Contemporary Mathematics 517, pp. 219-230. 2010. American Mathematical Society, ISSN 0271-4132. [pdf] [bib]
Peter Paule, Silviu Radu. Infinite families of strange partition congruences for broken 2-diamonds . The Ramanujan Journal 23, pp. 409-416. 2010. 1382-4090. [url] [pdf] [bib]
Peter Paule. Henrici's Friendly Monster Identity Revisited. In: "Advances in Combinatorial Mathematics", Proceedings of the Waterloo Workshop in Computer Algebra 2008, Kotsireas, Ilias S.; Zima, Eugene V. (ed.), pp. 155-163. 2010. Springer, 978-3-642-03561-6. [bib]
F. Chyzak and P. Paule. Chapter Computer Algebra. In: NIST's Digital Library of Mathematical Foundations, F. Olver et al. (ed.), pp. 0-0. 2010. 0. [bib]
C. Koukouvinos, V. Pillwein, D.E. Simos, Z. Zafeirakopoulos . A Note on the Average Complexity Analysis of the Computation of Periodic and Aperiodic Ternary Complementary Pairs . DK Computational Mathematics. Technical report no. DK Report 2010-08, 2010. [pdf] [bib]
S. Beuchler, V. Pillwein and S. Zaglmayr . Sparsity optimized high order finite element functions for H(div) on simplices . DK Computational Mathematics. Technical report no. DK Report 2010-04, 2010. [pdf] [bib]
Silviu Radu. An algorithmic approach to Ramanujan's congruences and related problems. RISC Linz. PhD Thesis. 2010. [bib]
Cristian-Silviu Radu. An Algorithmic Approach to Ramanujan’s Congruences and Related Problems. RISC-JKU. PhD Thesis. 2010. [pdf] [bib]
C. Schneider. Parameterized Telescoping Proves Algebraic Independence of Sums. Ann. Comb. 14(4), pp. 533-552. 2010. ISSN 0218-0006. arXiv:0808.2596. [url] [pdf] [bib]
C. Schneider. A Symbolic Summation Approach to Find Optimal Nested Sum Representations. In: Motives, Quantum Field Theory, and Pseudodifferential Operators, A. Carey, D. Ellwood, S. Paycha, S. Rosenberg (ed.), Clay Mathematics Proceedings 12, pp. 285-308. 2010. Amer. Math. Soc, ISBN-10: 0-8218-5199-3. arXiv:0904.2323 . [url] [pdf] [bib]
C. Schneider. Structural Theorems for Symbolic Summation. Appl. Algebra Engrg. Comm. Comput. 21(1), pp. 1-32. 2010. ISSN 0938-1279. [url] [pdf] [bib]
Manuel Kauers, Carsten Schneider. Partial Denominator Bounds for Partial Linear Difference Equations. In: Proceedings of ISSAC'10, Stephen Watt (ed.), pp. 211-218. 2010. 978-1-4503-0150-3. arXiv:1005.0602 [cs.SC]. [url] [ps] [pdf] [bib]
J. Ablinger, J. Bluemlein, S. Klein, C. Schneider. Modern Summation Methods and the Computation of 2- and 3-loop Feynman Diagrams . Nucl. Phys. B (Proc. Suppl.), Loops and Legs in Quantum Field Theory - Proceedings of the 10th DESY Workshop on Elementary Particle Theory 205-206, pp. 110-115. 2010. ISSN 0550-3213. arXiv:1006.4797 [math-ph]. [url] [pdf] [bib]
J. Ablinger, I. Bierenbaum, J. Bluemlein, A. Hasselhuhn, S. Klein, C. Schneider, F. Wissbrock. Heavy Flavor DIS Wilson coefficients in the asymptotic regime . Nucl. Phys. B (Proc. Suppl.), Loops and Legs in Quantum Field Theory - Proceedings of the 10th DESY Workshop on Elementary Particle Theory 205-206, pp. 242-249. 2010. ISSN 0550-3213. arXiv::1007.0375 [hep-ph]. [url] [pdf] [bib]
Flavia Stan. On Recurrences for Ising Integrals. Adv. in Appl. Math. 45(3), pp. 334-345. 2010. Elsevier, ISSN 0196-8858. [pdf] [bib]
Flavia Stan. Algorithms for Special Functions: Computer Algebra and Analytical Aspects. RISC, Johannes Kepler University Linz. PhD Thesis. June 2010. RISC technical report 10-19. [pdf] [bib]
Karen T. Kohl and Flavia Stan. An Algorithmic Approach to the Mellin Transform Method. In: Gems in Experimental Mathematics, T. Amdeberhan, L. A. Medina, V. H. Moll (ed.), Contemporary Mathematics 517, pp. 207-218. 2010. AMS, ISBN 978-0-8218-4869-2. [pdf] [bib]
V. Pillwein, S. Takacs . Computing smoothing rates of collective point smoothers for optimal control problems using symbolic computation . DK Computational Mathematics. Technical report no. DK Report 2010-09, 2010. [pdf] [bib]