RISC Publications and Technical Reports

2013

• J. Ablinger, J. Bluemlein. Harmonic Sums, Polylogarithms, Special Numbers, and their Generalizations. In: Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, J. Bluemlein, C. Schneider (ed.), Texts and Monographs in Symbolic Computation , pp. -. 2013. Springer, tba. To appear. [url] [bib]
• Maximilian Jaroschek, Manuel Kauers, Shaoshi Chen, Michael F. Singer. Desingularization Explains Order-Degree Curves for Ore Operators. ArXiv. Technical report no. 1301.0917, 2013. [pdf] [ps] [bib]
• Shaoshi Chen, Maximilian Jaroschek, Manuel Kauers, Michael F. Singer. Desingularization Explains Order-Degree Curves for Ore Operators. In: Proceedings of ISSAC'13, Manuel Kauers (ed.), pp. ??-??. 2013. isbn 978-1-4503-2059-7/13/06. [pdf] [ps] [bib]
• Fredrik Johansson, Manuel Kauers, Marc Mezzarobba. Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation. ArXiv. Technical report no. 1301.2486, 2013. [pdf] [bib]
• Fredrik Johansson, Manuel Kauers, Marc Mezzarobba. Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation. In: Proceedings of ISSAC'13, Manuel Kauers (ed.), pp. ??-??. 2013. isbn 978-1-4503-2059-7/13/06. [pdf] [ps] [bib]
• Manuel Kauers (ed.). Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation. Proceedings of ISSAC'13, 2013. ACM, isbn 978-1-4503-2059-7/13/06. [bib]
• Manuel Kauers. The Holonomic Toolbox. In: Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, Johannes Bluemlein and Carsten Schneider (ed.), pp. ??-??. 2013. Springer, tba. to appear. [pdf] [bib]
• Muhammad Taimoor Khan. Translation of MiniMaple to Why3ML. Technical report no. 13-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. February 2013. [pdf] [bib]
• Christoph Koutschan, Thotsaporn Thanatipanonda. Advanced Computer Algebra for Determinants. Annals of Combinatorics, pp. ?-?. 2013. ISSN 0218-0006. To appear (preprint on arXiv:1112.0647). [url] [pdf] [bib]
• Irina Georgieva, Clemens Hofreither, Christoph Koutschan, Veronika Pillwein, Thotsaporn Thanatipanonda. Harmonic interpolation based on Radon projections along the sides of regular polygons. Central European Journal of Mathematics 11(4), pp. 609-620. 2013. ISSN 1895-1074. [pdf] [bib]
• Temur Kutsia, Jordi Levy, Mateu Villaret. Anti-Unification for Unranked Terms and Hedges. Journal of Automated Reasoning, pp. -. 2013. ISSN 0168-7433. [url] [bib]
• Y. Huang, L.X.C. Ngo, F. Winkler. Rational general solutions of higher order algebraic ODEs. J. Systems Science and Complexity (JSSC), pp. --. 2013. 1009-6124. to appear. [bib]
• Y. Huang, L.X.C. Ngo, F. Winkler. Rational general solutions of trivariate rational systems of autonomous ODEs. Mathematics in Computer Science, pp. --. 2013. 1661-8270. to appear. [bib]
• S. Beuchler and V. Pillwein and S. Zaglmayr. Sparsity optimized high order finite element functions for H(curl) on tetrahedra. Advances in Applied Mathematics 50, pp. 749-769. 2013. [url] [pdf] [bib]
• V. Pillwein. Termination Conditions for Positivity Proving Procedures. In: Proceedings of ISSAC'13, M. Kauers (ed.), pp. ?-?. 2013. isbn 978-1-4503-2059-7/13/06. [pdf] [bib]
• J. Bluemlein, A. Hasselhuhn, S. Klein, C. Schneider. The $O(α_s^3 n_f T_F^2 C_{A, F})$} Contributions to the Gluonic Massive Operator Matrix Elements. Nuclear Physics B(866), pp. 196-211. 2013. ISSN: 0550-3213. [url] [pdf] [bib]
• J. Ablinger, J. Bluemlein, C. Schneider. Analytic and Algorithmic Aspects of Generalized Harmonic Sums and Polylogarithms. To appear in J. Math. Phys., pp. ?-?. 2013. ISSN 0022-2488. arXiv:1302.0378 [math-ph]. [url] [pdf] [bib]
• C. Schneider. Simplifying Multiple Sums in Difference Fields. In: Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, J. Bluemlein, C. Schneider (ed.), Texts and Monographs in Symbolic Computation , pp. -. 2013. Springer, tba. To appear. [url] [bib]
• J. Bluemlein, T. Riemann, C. Schneider. Precision Calculations, Algebraic Summation and Integration - Towards the Mathematical Structure of the Microcosm. In: Annual report 2012 of the particle and astroparticle physics division at DESY, - (ed.), pp. 90-91. 2013. Deutsches Elektronen Synchrotron (DESY), -. [url] [bib]
• J. Bluemlein, C. Schneider (ed.). Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions. Texts and Monographs in Symbolic Computation, 2013. Springer Wien, [bib]
• Wolfgang Schreiner. Initial Results on Modeling in PRISM Mobile Cellular Networks with Spectrum Renting. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Technical report, April 9 2013. [pdf] [bib]
• Wolfgang Schreiner. Experiments with Measuring Time in PRISM 4.0. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Technical report, March 2013. Technical Report. [pdf] [bib]
• Wolfgang Schreiner. Experiments with Measuring Time in PRISM 4.0 (Addendum). Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Technical report, April 2013. [pdf] [bib]
• Manfred Kerber, Christoph Lange, Colin Rowat and Wolfgang Windsteiger. Developing an Auction Theory Toolbox. In: AISB 2013, Manfred Kerber, Christoph Lange, Colin Rowat (ed.), pp. 1-4. 2013. no ISSN. proceedings available online. [url] [pdf] [bib]
• Christoph Lange, Marco B. Caminati, Manfred Kerber, Till Mossakowski, Colin Rowat, Makarius Wenzel, Wolfgang Windsteiger. A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory. In: Conference on Intelligent Computer Mathematics (CICM 2013), Jacques Carette (ed.), LNAI 7961, pp. 200-215. 2013. Springer, ISSN ???. [pdf] [bib]
• S. Gerhold, M. Kauers, C. Koutschan, P. Paule, C. Schneider, B. Zimmermann. Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order. In: Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, J. Bluemlein, C. Schneider (ed.), Texts and Monographs in Symbolic Computation , pp. ?-?. 2013. Springer, arXiv:1305.4818 [cs.SC]. [url] [pdf] [bib]

2012

• J. Ablinger. Computer Algebra Algorithms for Special Functions in Particle Physics. J. Kepler University Linz. PhD Thesis. April 2012. [pdf] [bib]
• Ainhoa Aparicio-Monforte, Jacques-Arthur Weil. A reduced form for linear differential systems and its application to integrability of Hamiltonian systems. Journal of Symbolic Computation 47(2), pp. 192-213. 02 2012. ISSN 0747-7171. [url] [bib]
• Ainhoa Aparicio Monforte, Manuel Kauers. Formal Laurent Series in Several Variables. Expositiones Mathematicae, pp. ?-?. 2012. ISSN 0723-0869. to appear. [pdf] [bib]
• Tudor Jebelean, Anna Medve. Formalization of Workflows Using Fork-Join Automata. Technical report no. 12-21 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. December 2012. [pdf] [bib]
• Peter Paule, Sergei K. Suslov. Relativistic Coulomb Integrals and Zeilbergers Holonomic Systems Approach. I. Technical report no. 12-12 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret. A Variant of Higher-Order Anti-Unification. Technical report no. 12-19 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• C. Doench, J. Middeke, F. Winkler. DEAM 2 Proceedings. Technical report no. 00-00 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• C. Dönch. Standard Bases in Finitely Generated Difference-Skew-Differential Modules and Their Application to Dimension Polynomials. Technical report no. 12-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Isabela Dramnesc, Tudor Jebelean. Semi-automatic Synthesis of Some Sorting Programs in Theorema. Research Institute for Symbolic Computation (RISC), University of Linz. Technical report no. 12-01, Schloss Hagenberg, 4232 Hagenberg, Austria, January 2012. RISC Report Series. [pdf] [bib]
• Isabela Dramnesc, Tudor Jebelean. Systematic Exploration of the Theory of Lists in Theorema. Technical report no. 12-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. January 2012. RISC Report Series. [pdf] [bib]
• Isabela Dramnesc, Tudor Jebelean. Theory Exploration in Theorema: Case Study on Lists. In: Proceedings of the 7th IEEE International Symposium on Applied Computational Intelligence and Informatics, . (ed.), Proceedings of SACI 2012, pp. 421-426. May 24-26 2012. IEEE Xplore, Obuda University, Budapest, Hungary and "Politehnica" University of Timisoara, Romania, Print ISBN 978-1-4673-1013-0. [bib]
• Isabela Dramnesc and Tudor Jebelean. Systematic Exploration of List Theory in Theorema. Scientific Bulletin of the "Politehnica" University of Timisoara, Transactions on Automatic Control and Computer Science(4/2012), pp. 203-210. 2012. ISSN 1224-600X. [bib]
• Isabela Dramnesc and Tudor Jebelean. Discovery of Inductive Algorithms through Automated Reasoning: A Case Study on Sorting. In: Proceedings of SISY 2012: the IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics, . (ed.), pp. 293-298. September 2012. IEEE Xplore, ISBN 978-1-4673-4751-8. [url] [bib]
• Isabela Dramnesc and Tudor Jebelean. Automated Synthesis of Some Algorithms on Finite Sets. In: Proceedings of SYNASC 2012: the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, . (ed.), pp. 143-151. September 2012. IEEE Computer Society, ISBN-13: 978-0-7695-4934-7. [bib]
• Sandra Alves, Besik Dundua, Mario Florido, Temur Kutsia. A Dynamic Pattern Calculus with Hedge Variables. Technical report no. 12-20 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• M. Erascu, T. Jebelean. Soundness of a Logic-Based Verification Method for Imperative Loops. In: Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, A. Voronkov, V. Negru, T. Ida, T. Jebelean, D. Petcu, S. Watt, D. Zaharie (ed.), pp. 127-134. 2012. IEEE Computer Society, 978-0-7695-4934-7. [pdf] [bib]
• Madalina Erascu. Computational Logic and Quantifier Elimination Techniques for (Semi-)automatic Static Analysis and Synthesis of Algorithms. Research Institute for Symbolic Computation. PhD Thesis. 2012. RISC Technical Report 12-16. [pdf] [bib]
• Madalina Erascu. Computational Logic and Quantifier Elimination Techniques for (Semi-)automatic Static Analysis and Synthesis of Algorithms. Technical report no. 12-16 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Gabor Guta. Model-to-Text Transformation Modification by Examples. Research Institute for Symbolic Computation. PhD Thesis. 2012. [pdf] [bib]
• J. Ablinger, J. Bluemlein, A. De Freitas, A. Hasselhuhn, S. Klein, C. Raab, M. Round, C. Schneider, F. Wissbrock. Three-Loop Contributions to the Gluonic Massive Operator Matrix Elements at General Values of N. In: Proc. Loops and Legs in Quantum Field Theory 2012, J. Blümlein, S. Moch, T. Riemann (ed.), PoS(LL2012)033 , pp. 1-12. 2012. ISSN 1824-8039. [url] [bib]
• J. Ablinger, J. Bluemlein, A. De Freitas, A. Hasselhuhn, S. Klein, C. Schneider, F. Wissbrock. New Results on the 3-Loop Heavy Flavor Wilson Coefficients in Deep-Inelastic Scattering. In: To appear in Proceedings of the 36th International Conference on High Energy Physics, PoS(ICHEP2012)270, pp. 1-9. 2012. ISSN 1824-8039. [url] [bib]
• M. Erascu, H. Hong. Secant-Newton map is the optimal among contracting quadratic maps for square root computation. Journal of Reliable Computing, pp. - . 2012. 1573-1340. to appear. [pdf] [bib]
• F. Johansson. Efficient implementation of the Hardy-Ramanujan-Rademacher formula. LMS Journal of Computation and Mathematics(15), pp. 341-359. 2012. ISSN 1461-1570. [url] [pdf] [bib]
• F. Winkler, M. Hudayberdiev, G. Judakova. Computer algebra methods for pattern recognition: systems with complex order. In: Proceedings INTELS 2012 (Moscow), - (ed.), Proceedings of INTELS 2012, pp. 148-150. 2012. 978-5-93347-432-6. [bib]
• Shaoshi Chen, Manuel Kauers, Michael F. Singer. Telescopers for Rational and Algebraic Functions via Residues. ArXiv. Technical report no. 1201.1954, 2012. [pdf] [ps] [bib]
• Shaoshi Chen, Manuel Kauers. Order-Degree Curves for Hypergeometric Creative Telescoping. ArXiv. Technical report no. 1201.1982, 2012. [pdf] [ps] [bib]
• Shaoshi Chen, Manuel Kauers. Trading Order for Degree in Creative Telescoping. Journal of Symbolic Compuation 47(8), pp. 968-995. 2012. ISSN 0747-7171. [pdf] [ps] [bib]
• Shaoshi Chen, Manuel Kauers. Order-Degree Curves for Hypergeometric Creative Telescoping. In: Proceedings of ISSAC 2012, Joris van der Hoeven and Mark van Hoeij (ed.), pp. 122-129. 2012. isbn 978-1-4503-1269. [pdf] [bib]
• Shaoshi Chen, Manuel Kauers, Michael F. Singer. Telescopers for Rational and Algebraic Functions via Residues. In: Proceedings of ISSAC 2012, Joris van der Hoeven and Mark van Hoeij (ed.), pp. 130-137. 2012. isbn 978-1-4503-1269. [pdf] [bib]
• Manuel Kauers, Christian Krattenthaler, Thomas W. Mueller. A method for determining the mod-$2^k$ behaviour of recursive sequences, with applications to subgroup counting. Electronic Journal of Combinatorics 18(2), pp. 1-76. 2012. 1077-8926. P37. [pdf] [ps] [bib]
• Manuel Kauers, Ryan O\'Donnell, Li-Yang Tan, Yuan Zhou. Hypercontractive inequalities via SOS, with an application to Vertex-Cover. ArXiv. Technical report no. 1212.5324, 2012. [ps] [pdf] [bib]
• Muhammad Taimoor Khan. Formal Semantics of MiniMaple. Technical report no. 12-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. January 2012. [pdf] [bib]
• Muhammad Taimoor Khan. Formal Semantics of a Specification Language for MiniMaple. Technical report no. 12-05 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. April 2012. [pdf] [bib]
• Muhammad Taimoor Khan, Wolfgang Schreiner. Towards the Formal Specification and Verification of Maple Programs. In: Intelligent Computer Mathematics, Johan Jeuring, John A. Campbell, Jacques Carette, Gabriel Dos Reis, Petr Sojka, Makarius Wenzel, Volker Sorge (ed.), Lecture Notes in Artificial Intelligence (LNAI) 7362, pp. 231-247. July 2012. Springer-Verlag, Berlin/Heidelberg, ISBN 978-3-642-31373-8. Awarded with a Best Student Paper Award. [url] [pdf] [bib]
• Muhammad Taimoor Khan, Wolfgang Schreiner. On Formal Specification of Maple Programs. In: Intelligent Computer Mathematics, Johan Jeuring, John A. Campbell, Jacques Carette, Gabriel Dos Reis, Petr Sojka, Makarius Wenzel, Volker Sorge (ed.), Lecture Notes in Artificial Intelligence (LNAI) 7362, pp. 442-446. July 2012. Springer-Verlag, Berlin/Heidelberg, ISBN 978-3-642-31373-8. [url] [pdf] [bib]
• Muhammad Taimoor Khan. On the Formal Semantics of MiniMaple and its Specification Language. In: Proceedings of the 10th International Conference on Frontiers of Information Technology (FIT 2012), xxx (ed.), pp. 00-00. December 2012. IEEE Digital Library, xxx. [bib]
• Christoph Koutschan, Christoph Lehrenfeld, Joachim Schoeberl. Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, Ulrich Langer, Peter Paule (ed.), Texts and Monographs in Symbolic Computation 1, pp. 105-121. 2012. Springer, Wien, ISBN 978-3-7091-0793-5. [pdf] [bib]
• Tewodros Amdeberhan, Christoph Koutschan, Victor H. Moll, Eric S. Rowland. The iterated integrals of ln(1+x^n). International Journal of Number Theory 8(1), pp. 71-94. 2012. ISSN 1793-0421. [pdf] [bib]
• Stavros Garoufalidis, Christoph Koutschan. The non-commutative A-polynomial of (-2, 3, n) pretzel knots. Experimental Mathematics 21(3), pp. 241-251. 2012. ISSN 1058-6458. [url] [pdf] [bib]
• Masao Ishikawa, Christoph Koutschan. Zeilberger's Holonomic Ansatz for Pfaffians. In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC), Joris van der Hoeven, Mark van Hoeij (ed.), pp. 227-233. 2012. ACM, ISBN 978-1-4503-1269. [url] [pdf] [bib]
• Stavros Garoufalidis, Christoph Koutschan. Twisting q-holonomic sequences by complex roots of unity. In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC), Joris van der Hoeven, Mark van Hoeij (ed.), pp. 179-186. 2012. ACM, ISBN 978-1-4503-1269. [url] [pdf] [bib]
• Herwig Hauser, Christoph Koutschan. Linear Recurrences and Power Series Division. Discrete Mathematics 312(24), pp. 3553-3560. 2012. ISSN 0012-365X. [pdf] [bib]
• Thierry Combot, Christoph Koutschan. Third order integrability conditions for homogeneous potentials of degree -1. Journal of Mathematical Physics 53(8), pp. 082704-. 2012. ISSN 0022-2488. [pdf] [bib]
• Laura Kovacs, Temur Kutsia (ed.). Special Issue of the Journal of Applied Logic on Automated Specification and Verification of Web Systems . 1570-8683. [url] [bib]
• Temur Kutsia, Mircea Marin. Solving, Reasoning, and Programming in Common Logic. Technical report no. 12-15 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Temur Kutsia, Mircea Marin. Solving, Reasoning, and Programming in Common Logic. In: Proc. 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Andrei Voronkov (ed.), pp. 119-126. 2012. IEEE Computer Society, ISBN 978-0-7695-4934-7. [pdf] [bib]
• Temur Kutsia, Mircea Marin. Regular Expression Order-Sorted Unification and Matching. Technical report no. 12-14 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• L. X. C. Ngo, J. R. Sendra, F. Winkler. Birational Transformations on Algebraic Ordinary Differential Equations. Technical report no. 12-18 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. December 2012. [pdf] [bib]
• L.X.C. Ngo, J.R. Sendra, F. Winkler. Classification of algebraic ODEs with respect to rational solvability. Computational Algebraic and Analytic Geometry, Contemporary Mathematics(572), pp. 193-210. 2012. AMS, 0271-4132. [bib]
• Peter Paule, Cristian-Silviu Radu. The Andrews-Sellers Family of Partition Congruences. Advances in Mathematics, pp. 819-838. 2012. 0001-8708. [pdf] [bib]
• S. Beuchler, V. Pillwein and S. Zaglmayr. Fast summation techniques for sparse shape functions in tetrahedral hp-FEM. In: Domain Decomposition Methods in Science and Engineering XX, , pp. ?-?. 2012. to appear. [pdf] [bib]
• S. Beuchler, V. Pillwein and S. Zaglmayr. Sparsity optimized high order finite element functions for H(div) on simplices. Numerische Mathematik 122(2), pp. 197-225. 2012. [pdf] [bib]
• Katsuhisa Horimoto, Masahiko Nakatsui, and Nikolaj Popov (ed.). Algebraic and Numeric Biology. Proceedings of 4th International Conference ANB 2010, Hagenberg, Austria, LNCS, 6479, 2012. Springer, ISBN 978-3-642-28066-5. Revised Selected Papers. [bib]
• Clemens G. Raab. Using Groebner bases for finding the logarithmic part of the integral of transcendental functions. Journal of Symbolic Computation 47(10), pp. 1290-1296. 2012. ISSN 0747-7171. [bib]
• Moulay A. Barkatou, Clemens G. Raab. Solving Linear Ordinary Differential Systems in Hyperexponential Extensions. In: Proceedings of ISSAC 2012, Joris van der Hoeven and Mark van Hoeij (ed.), Proceedings of 37th International Symposium on Symbolic and Algebraic Computation, ISSAC 2012, pp. 51-58. 2012. ISBN 978-1-4503-1269. [pdf] [bib]
• Clemens G. Raab. Definite Integration in Differential Fields. Johannes Kepler Universität Linz, Austria. PhD Thesis. August 2012. [pdf] [bib]
• Cristian-Silviu Radu. A proof of Subbarao's conjecture. Journal fuer Reine und angewandte Mathematik, pp. -. 2012. 1435-5345. [pdf] [bib]
• Cristian-Silviu Radu. Proof of a conjecture by Ahlgren and Ono on the non-existence of certain partition congruences. Transactions of the American Mathematical Society, pp. -. 2012. 1088-6850(e), 0002-9947(p) . [pdf] [bib]
• J. Bluemlein, S. Klein, C. Schneider, F. Stan. A Symbolic Summation Approach to Feynman Integral Calculus. J. Symbolic Comput. 47, pp. 1267-1289. 2012. ISSN 0747-7171. [pdf] [bib]
• J. Ablinger, J. Bluemlein, A. Hasselhuhn, S. Klein, C. Schneider, F. Wissbrock. New Heavy Flavor Contributions to the DIS Structure Function $F_2(x, Q^2)$ at $O(\alpha_s^3)$. In: Proceedings of RADCOR 2011, , Proceedings of 10th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology) PoS(RADCOR2011)31, pp. 1-8. 2012. ISSN 1824-8039. [url] [bib]
• J. Bluemlein, A. Hasselhuhn, C. Schneider. Evaluation of Multi-Sums for Large Scale Problems. In: Proceedings of RADCOR 2011, , Proceedings of 10th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology)PoS(RADCOR2011)32, pp. 1-9. 2012. ISSN 1824-8039. [url] [bib]
• J. Ablinger, J. Bluemlein, A. Hasselhuhn, S. Klein, C. Schneider, F. Wissbrock. Massive 3-loop Ladder Diagrams for Quarkonic Local Operator Matrix Elements. Nuclear Physics B 864, pp. 52-84. 2012. ISSN: 0550-3213. arXiv:1206.2252v1 [hep-ph]. [url] [bib]
• J. Ablinger, J. Bluemlein, M. Round, C. Schneider. Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals. In: Loops and Legs in Quantum Field Theory 2012, J. Bluemlein, S. Moch, T. Riemann (ed.), PoS(LL2012) 50, pp. 1-14. 2012. ISSN 1824-8039. arXiv:1210.1685 [cs.SC]. [url] [bib]
• Temur Kutsia, Wolfgang Schreiner. LogicGuard Abstract Language. Technical report no. 12-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Wolfgang Schreiner. Computer-Assisted Program Reasoning Based on a Relational Semantics of Programs. In: Proceedings First Workshop on CTP Components for Educational Software (THedu'11), Pedro Quaresma and Ralph-Johan Back (ed.), Electronic Proceedings in Theoretical Computer Science (EPTCS) 79, pp. 124-142. February 2012. Wroclaw, Poland, July 31, 2011, ISSN: 2075-2180. [url] [bib]
• Wolfgang Schreiner. Computability and Complexity. Technical report no. 2012-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. September 2012. Lecture Notes Winter Semester 2012/2013 (last revision: February 4, 2013). [pdf] [bib]
• Temur Kutsia, Wolfgang Schreiner. Translation Mechanism for the LogicGuard Abstract Language. Technical report no. 12-11 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• Silviu Radu, James Sellers. Congruences Modulo Squares of Primes for Fu's Dots Bracelet Partitions. Technical report no. 12-13 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2012. [pdf] [bib]
• V. Pillwein, S. Takacs. A local Fourier convergence analysis of a multigrid method using symbolic computation. DK Computational Mathematics. Technical report no. DK Report 2012-04, April 2012. [pdf] [bib]
• W. Windsteiger. Theorema 2.0: A Graphical User Interface for a Mathematical Assistant System. In: Proceedings of UITP 2012 (part of CICM 2012), Cezary Kaliszyk and Christoph Lueth (ed.), Proceedings of UITP 2012, pp. 1-8. 2012. ???. [pdf] [bib]
• Ph. Kügler, W. Windsteiger. Algorithmische Methoden - Funktionen, Matrizen, Multivariate Polynome. Reihe: Mathematik kompakt. 1st edition, May 2012. Birkhäuser Basel Boston Berlin, ISBN 978-3-7643-8515-6. [url] [bib]
• W. Windsteiger. Theorema 2.0: A Graphical User Interface for a Mathematical Assistant System. In: 24th OpenMath Workshop, 7th Workshop on Mathematical User Interfaces (MathUI), and Intelligent Computer Mathematics Work in Progress, James Davenport and Johan Jeuring and Christoph Lange and Paul Libbrecht (ed.), CEUR Workshop Proceedings 921, pp. 73-81. 2012. Aachen, 1613-0073. [url] [pdf] [bib]
• F. Winkler. The role of Symbolic Computation in Mathematics. In: Proceedings XIII Encuentro de Algebra Computacional y Aplicaciones (EACA 2012), J.R. Sendra and C. Villarino (ed.), pp. 33-34. 2012. 978-84-8138-770-4. [bib]
• Qunying Liao, Liangjie Ye. Lower Bounds and Constructions for q-ary Codes Correcting Asymmetric Errors. Advances in Mathematics(China), pp. ??-??. 2012. 1000-0917 . [bib]
• Zafeirakis Zafeirakopoulos. Linear Diophantine Systems: Partition Analysis and Polyhedral Geometry. Research Institute for Symbolic Computation / DK-compmath. PhD Thesis. December 2012. [bib]

2011

• Ainhoa Aparicio-Monforte, Moulay Barkatou, Sergi Simon, Jacques-Arthur Weil. Formal First Integrals Along Solutions of Differential Systems I. In: ISSAC 2011, Association for Computing Machinery (ed.), pp. 19-26. 2011. ACM, 978-1-4503-0675-1. [bib]
• Ainhoa Aparicio-Monforte, Jacques-Arthur Weil. A reduction method for higher order variational equations of Hamiltonian systems. In: Symmetries and Related Topics in Differential and Difference Equations, David Blázquez-Sanz, Juan J. Morales-Ruiz and Jesús Rodríguez Lombardero (ed.), Contemporary Mathematics , pp. ---. september 2011. American Mathematical Society, 2009 Jairo Charris Seminar in Symmetries of Differential and Difference Equations, 0-8218-6872-1. [bib]
• Volkmar Wieser, Clemens Grelck, Holger Schoner, Peter Haslinger, Karoly Bosa, Bernhard Moser. GPU-Based Image Processing Use Cases: A High-Level Approach. In: Proceedings of ParCo2011, - (ed.), Proceedings of International Conference on Parallel Computing 2011, Advances in Parallel Computing , pp. -. September 2011. IOS Press, 0. [url] [pdf] [bib]
• Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger. Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Groebner Bases. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, Ulrich Langer and Peter Paule (ed.), pp. ?-?. 2011. Springer, Wien, Also available as RICAM Report 2010-05, September 2010. [pdf] [bib]
• Bruno Buchberger, Manuel Kauers. Buchberger's Algorithm. Scholarpedia 6(10), pp. 7764-7764. October 2011. 1941-6016. [url] [bib]
• Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li. On the Structure of Compatible Rational Functions. In: Proceedings of ISSAC 2011, Anton Leykin (ed.), Proceedings of The 36th International Symposium on Symbolic and Algebraic Computation (ISSAC2011), pp. 91-98. June 2011. ACM, 978-1-4503-0675-1. [url] [pdf] [ps] [bib]
• Isabela Dramnesc and Tudor Jebelean. Automated Reasoning on Tuples - Case Studies in Proof Based Synthesis. Technical report no. 11-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. July 2011. [pdf] [bib]
• Isabela Dramnesc, Tudor Jebelean . Proof Techniques for Synthesis of Sorting Algorithms. In: Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, D. Wang, V. Negru, T. Ida, T. Jebelean, D. Petcu, S. Watt and D. Zaharie (ed.), pp. 101-109. September 2011. IEEE Computer Society, ISBN 978-0-7695-4630-8. [url] [pdf] [bib]
• Madalina Erascu. Symbolic Computation and Program Verification. Proving Partial Correctness and Synthesizing Optimal Algorithms. Technical report no. 11-15 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2011. [pdf] [bib]
• Burcin Erocal. Algebraic extensions for summation in finite terms. RISC, Johannes Kepler University, Linz. PhD Thesis. February 2011. [pdf] [bib]
• Christoph Fuerst. Combinatorial Sums: Egorychev's Method of Coefficients and Riordan Arrays. RISC, Johannes Kepler University Linz. Diploma Thesis. March 2011. [pdf] [bib]
• Gabor Guta. A Graph Annotation Based Algorithm for Transducer Modification Inference. Technical report no. 00-00 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 05 2011. [pdf] [bib]
• M. Hodorog. Symbolic-Numeric Algorithms for Plane Algebraic Curves. Research Institute for Symbolic Computation (RISC), Doctoral Program "Computational Mathematics". PhD Thesis. November 2011. RISC Technical Report 11-14. [pdf] [bib]
• Fredrik Johansson. A fast algorithm for reversion of power series. 2011. arxiv preprint, [pdf] [bib]
• Manuel Kauers, Peter Paule. The Concrete Tetrahedron. Text and Monographs in Symbolic Computation 1st edition, 2011. Springer Wien, 978-3-7091-0444-6. [bib]
• Manuel Kauers, Sheng-Lan Ko. Problem 11545. 1 2011. American Mathematical Monthly 118(1):84, ISSN 0192-5857. [ps] [pdf] [bib]
• Manuel Kauers. How To Use Cylindrical Algebraic Decomposition. Seminaire Lotharingien de Combinatoire 65(B65a), pp. 1-16. 2011. ISSN 1286-4889. [pdf] [ps] [bib]
• Manuel Kauers, Doron Zeilberger. The Computational Challenge of Enumerating High Dimensional Rook Paths. Advances in Applied Mathematics 47(4), pp. 813-819. 2011. ISSN 0196-8858. [pdf] [ps] [bib]
• Manuel Kauers. A Mathematica Package for Computing Asymptotic Expansions of Solutions of P-Finite Recurrence Equations. Technical report no. 00-00 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2011. [ps] [pdf] [bib]
• Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz. Dominance in the Family of Sugeno-Weber t-norms. Fuzzy Sets and Systems 181(1), pp. 74-87. October 2011. ISSN 0165-0114. [ps] [pdf] [bib]
• Manuel Kauers, Christian Krattenthaler, Thomas W. Mueller. A method for determining the mod-$2^k$ behaviour of recursive sequences, with applications to subgroup counting. ArXiv. Technical report no. 1107.2015, 2011. [pdf] [ps] [bib]
• Manuel Kauers (ed.). ISSAC 2011 Poster Abstracts. Communications in Computer Algebra, 45/2, June 2011. ACM Sigsam, [bib]
• Muhammad Taimoor Khan. A Type Checker for MiniMaple. Technical report no. 11-05 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. April 2011. [pdf] [bib]
• Muhammad Taimoor Khan, Wolfgang Schreiner. Towards a Behavioral Analysis of Computer Algebra Programs (Extended Abstract). In: Proceedings of the 23rd Nordic Workshop on Programming Theory (NWPT'11), Paul Pettersson and Cristina Seceleanu (ed.), pp. 42-44. October 2011. Vasteras, Sweden, Doktoratskolleg, Research Institute for Symbolic Computation, ISSN 1404-3041. [pdf] [bib]
• Muhammad Taimoor Khan. Towards a Behavioral Analysis of Computer Algebra Programs. Technical report no. 11-13 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. November 2011. [pdf] [bib]
• Tewodros Amdeberhan, Mark W. Coffey, Olivier Espinosa, Christoph Koutschan, Dante V. Manna, Victor H. Moll. Integrals of powers of loggamma. Proceedings of the AMS 139(2), pp. 535-545. 2011. ISSN 0002-9939. [pdf] [bib]
• Christoph Koutschan, Victor H. Moll. The integrals in Gradshteyn and Ryzhik. Part 18: Some automatic proofs. SCIENTIA Series A: Mathematical Sciences 20, pp. 93-111. 2011. Universidad Tecnica Federico Santa Maria, Valparaiso, Chile, ISSN 0716-8446. [pdf] [bib]
• Christoph Koutschan, Manuel Kauers, Doron Zeilberger. Proof of George Andrews's and David Robbins's q-TSPP conjecture. Proceedings of the National Academy of Sciences 108(6), pp. 2196-2199. 2011. ISSN 0027-8424. [url] [pdf] [bib]
• Stavros Garoufalidis, Christoph Koutschan. The sl3 Jones polynomial of the trefoil: a case study of q-holonomic recursions. Advances in Applied Mathematics 47(4), pp. 829-839. 2011. ISSN 0196-8858. [pdf] [bib]
• Christoph Koutschan, Doron Zeilberger. The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that computed Ground States of Two-Electron Atoms (and its 2010 Redux). The Mathematical Intelligencer 33(2), pp. 52-57. 2011. ISSN 0343-6993. [url] [pdf] [bib]
• Viktor Levandovskyy, Christoph Koutschan, Oleksandr Motsak. On Two-generated Non-commutative Algebras Subject to the Affine Relation. In: Proceedings of CASC 2011, Vladimir Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii Vorozhtsov (ed.), Lecture Notes in Computer Science 6885, pp. 309-320. 2011. Springer, ISBN 978-3-642-23567-2. [pdf] [bib]
• Frederic Chyzak, James H. Davenport, Christoph Koutschan, Bruno Salvy. On Kahan's Rules for Determining Branch Cuts. In: Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Dongming Wang et al. (ed.), pp. 47-51. 2011. IEEE Computer Society: Conference Publishing Services (CPS), ISBN 978-0-7695-4630-8. [pdf] [bib]
• Christoph Koutschan. Lattice Green's Functions of the Higher-Dimensional Face-Centered Cubic Lattices. ArXiv (www.arxiv.org). Technical report no. 1108.2164, 2011. Submitted for publication. [url] [pdf] [bib]
• Thierry Combot, Christoph Koutschan. Third order integrability conditions for homogeneous potentials of degree -1. ArXiv (www.arxiv.org). Technical report no. 1111.5971, 2011. Submitted for publication. [url] [pdf] [bib]
• Christoph Koutschan, Thotsaporn Thanatipanonda. Advanced Computer Algebra for Determinants. ArXiv (www.arxiv.org). Technical report no. 1112.0647, 2011. Submitted for publication. [url] [pdf] [bib]
• Tudor Jebelean, Gabor Kusper. SAT Solving Experiments in Multi-Domain Logic. In: ICAI 2001, Emod Kovacs (ed.)I, pp. 95-105. 2011. Eger, Hungary, 0. [bib]
• Demis Ballis and Temur Kutsia (ed.). Special Issue of the Journal of Symbolic Computation on Automated Specification and Verification of Web Systems . ISSN 0747-7171. [url] [bib]
• Temur Kutsia, Jordi Levy, Mateu Villaret. Anti-Unification for Unranked Terms and Hedges. Technical report no. 11-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2011. [pdf] [bib]
• Temur Kutsia, Jordi Levy, Mateu Villaret. Anti-Unification for Unranked Terms and Hedges. In: Proceedings of the 22st International Conference on Rewriting Techniques and Applications, RTA 2011, Manfred Schmidt-Schauss (ed.), Leibniz International Proceedings in Informatics (LIPIcs) 10, pp. 219-234. 2011. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl Publishing, ISBN 978-3-939897-30-9, ISSN 1868-8969. [url] [bib]
• Johannes Middeke. A computational view on normal forms of matrices of Ore polynomials. Research Institute for Symbolic Computation (RISC). PhD Thesis. July 2011. RISC Technical Report 11-10. [pdf] [bib]
• Felix Antritter and Johannes Middeke. A toolbox for the analysis of linear systems with delays. In: Proceedings of the 50th IEEE Conference on Decision and Control (CDC 2011), , Proceedings of 50th IEEE Conference on Decision and Control (CDC 2011), pp. -. December 2011. Orlando, Florida, USA, IEEE, [bib]
• I. Moale and F. Peherstorfer. Explicit min-max polynomials on the disc. J. Approx. Theory 163, pp. 707-723. 2011. ISSN 0021-9045. [bib]
• I. Moale and F. Peherstorfer. An explicit class of min-max polynomials on the ball and on the sphere. J. Approx. Theory 163, pp. 724-737. 2011. ISSN 0021-9045. [bib]
• I. Moale and P. Yuditskii. On complex (non-analytic) Chebyshev polynomials in C^2. Comput. Methods Funct. Theory 11, pp. 13-24. 2011. ISSN 1617-9447. [bib]
• I Moale. Explicit weighted min-max polynomials on the disc. In: submitted, , pp. -. 2011. [bib]
• L.X.C Ngo, F. Winkler. Rational general solutions of planar rational systems of autonomous ODEs. Journal of Symbolic Computation 46(10), pp. 1173-1186. 2011. Research Institute for Symbolic Computation, ISSN: 0747-7171. [url] [bib]
• L.X.C. Ngo. Rational General Solutions of First-Order Algebraic ODEs. Research Institute for Symbolic Computation (RISC). PhD Thesis. October 2011. RISC Technical Report 11-12. [pdf] [bib]
• L.X.C. Ngo, F. Winkler. Rational general solutions of parametrizable AODEs. Publicationes Mathematicae Debrecen, pp. 573-587. 2011. ISSN 0033-3883. [bib]
• Y. Huang, L.X.C. Ngo, F. Winkler. Rational general solutions of trivariate rational systems of autonomous ODEs. In: Proceedings Forth Internat. Conf. on Mathematical Aspects of Computer and Information Sciences (MACIS 2011), 111 (ed.), pp. 93-100. 2011. 111. [bib]
• P. Paule, V. Pillwein. Automatic Improvements of Wallis' Inequality. In: SYNASC 2010, 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, T. Ida and others (ed.), pp. 12-16. 2011. IEEE Computer Society, 0. [pdf] [bib]
• S. Beuchler, V. Pillwein, J. Schoeberl and S. Zaglmayr . Sparsity optimized high order finite element functions on simplices. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, Ulrich Langer and Peter Paule (ed.), pp. 21-44. 2011. Springer, Wien, [pdf] [bib]
• C. Koukouvinos, V. Pillwein, D.E. Simos, Z. Zafeirakopoulos. On the Average Complexity for the Verification of Compatible Sequences . Information Processing Letters 111(17), pp. 825-830. 2011. [pdf] [bib]
• N. Popov, T. Jebelean. Sound and Complete Verification Condition Generator for Functional Recursive Programs.. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, U. Langer and P. Paule (ed.), pp. 219-256. 2011. Springer, Wien, ISBN 978-3-7091-0793-5. [bib]
• Silviu Radu, James Sellers. Parity results for broken k-diamond partitions and (2k+1)-cores. Acta Arithmetica, pp. 43-52. 2011. ISSN 0065-1036. [bib]
• M. Hodorog, J. Schicho. A Symbolic-Numeric Algorithm for Genus Computation. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, U. Langer and P. Paule (ed.), pp. 65-95. 2011. Springer Wien, 0943-853X. [pdf] [bib]
• M. Hodorog, B. Mourrain, J. Schicho. An Adapted Version of the Bentley-Ottmann Algorithm for Invariants of Plane Curve Singularities. In: Proceedings of the 11th International Conference on Computational Science and Its Applications, Part III, Session: Computational Geometry and Applications, B. Murgante et al. (ed.), Lecture Notes in Computer Science , pp. 121-131. 2011. Springer, Heidelberg, 978-3-642-21930-6. [pdf] [bib]
• M. Hodorog, J. Schicho. A Regularization Method for Computing Approximate Invariants of Plane Curves Singularities. In: Proceedings of the 4th International Workshop on Symbolic-Numeric Computation, L. Zhi et al. (ed.), pp. ?-?. 2011. ACM (Association for Computing Machinery), To appear. [pdf] [bib]
• J. Ablinger, J. Bluemlein, S. Klein, C. Schneider, F. Wissbrock. The O(\alpha_s^3) Massive Operator Matrix Elements of O(n_f) for the Structure Function F_2(x, Q^2) and Transversity. Nucl. Phys. B 844, pp. 26-54. 2011. .ISSN: 0550-3213. [url] [bib]
• Manuel Kauers, Carsten Schneider. A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations. In: Proceedings of ISSAC 2011, Anton Leykin (ed.), pp. 201-208. 2011. 978-1-4503-0675-1. [pdf] [ps] [bib]
• H. Prodinger, C. Schneider, S. Wagner. Unfair permutations. Europ. J. Comb. 32, pp. 1282-1298. 2011. ISSN: 0195-6698. [pdf] [bib]
• J. Ablinger, J. Bluemlein, C. Schneider. Harmonic Sums and Polylogarithms Generated by Cyclotomic Polynomials. Deutsches Elektronen-Synchrotron (DESY). Technical report no. DESY 11-033, 2011. [url] [bib]
• J. Ablinger, J. Bluemlein, C. Schneider. Harmonic Sums and Polylogarithms Generated by Cyclotomic Polynomials. J. Math. Phys. 52(10), pp. 1-52. 2011. ISSN 0022-2488 . [arXiv:1007.0375 [hep-ph]]. [url] [pdf] [bib]
• J. Ablinger, J. Bluemlein, S. Klein, C. Schneider, F. Wissbrock. 3-Loop Heavy Flavor Corrections to DIS with two Massive Fermion Lines. In: 19th International Workshop On Deep-Inelastic Scattering And Related Subjects (DIS 2011), , pp. -. 2011. American Institute of Physics (AIP), [url] [bib]
• Wolfgang Schreiner. Computer-Assisted Program Reasoning Based on a Relational Semantics of Programs (Extended Abstract). In: THedu'11, CTP Components for Educational Software, Workshop associated to CADE-23, Pedro Quaresma and Ralph-Johan Back (ed.), CISUC Technical Report 2011/001, pp. 55-59. 2011. Wroclaw, Poland, July 31, Center for Informatics and Systems, University of Coimbra, Portugal, ISSN 0874-338X. [pdf] [bib]
• Wolfgang Schreiner. Software. In: Nonlinear Resonance Analysis - Theory, Computation, Applications, Elena Kartashova (ed.), pp. 185-208. 2011. Cambridge University Press, Cambridge, UK, ISBN 978-0-521-76360-8. Appendix. [bib]
• Wolfgang Schreiner. The RISC ProgramExplorer - Tutorial and Manual. Technical report no. 11-11 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. October 2011. [pdf] [bib]
• Andrei-Ovidiu Coman. Video Tracking of Humans in Robotic Environments. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis. September 2011. [pdf] [bib]
• Wolfgang Schreiner. Program Reasoning Based on a Relational Semantics of Programs (Extended Abstract). In: Specification and Verification of Hybrid Systems, Proceedings of the First International Seminar, Louis Feraud and Ievgen Ivanov and Mykola Nikitchenko and Martin Strecker (ed.), pp. 64-69. 2011. Taras Shevchenko National University of Kyiv and Paul Sabatier University of Tolouse, October 10-12, 2011, Kyiv, Ukraine, ISBN 0000. [bib]
• Silviu Radu, James Sellers. Congruence Properties Modulo 5 and 7 for the pod Function. International Journal of Number Theory 8, pp. 2249-2259. 2011. 1793-7310. [bib]
• V. Pillwein, S. Takacs. Smoothing analysis of an all-at-once multigrid approach for optimal control problems using symbolic computation. In: Numerical and Symbolic Scientific Computing: Progress and Prospects, U. Langer, P. Paule (ed.), pp. 175-192. 2011. Springer Wien, [pdf] [bib]
• Loredana Tec. Computing and Proving with Integro-Differential Polynomials in Theorema. Technical report no. 11-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2011. [bib]
• Loredana Tec. A Symbolic Framework for General Polynomial Domains in Theorema: Applications to Boundary Problems. Research Institute for Symbolic Computation. Technical report no. 11-09, July 2011. PhD Thesis. [bib]
• T. Thanatipanonda. Further Hopping with Toads and Frogs. The Electronic Journal of Combinatorics 18(1)(P67), pp. 1-12. 2011. 1077-8926. [pdf] [bib]
• Manuela Wiesinger-Widi. Groebner Bases and Generalized Sylvester Matrices. ACM Communications in Computer Algebra 45(2), pp. -. June 2011. Accepted extended abstract from ISSAC 2011 poster presentation. [pdf] [bib]
• Manuela Wiesinger-Widi. Sylvester Matrix and GCD for Several Univariate Polynomials. Technical report no. 11-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. May 2011. [pdf] [bib]
• Manuela Wiesinger-Widi. Towards Computing a Groebner Basis of a Polynomial Ideal over a Field by Using Matrix Triangularization. Technical report no. 11-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. May 2011. [pdf] [bib]
• Manfred Kerber, Colin Rowat, and Wolfgang Windsteiger. Using Theorema in the Formalization of Theoretical Economics. In: Intelligent Computer Mathematics, James H. Davenport, William M. Farmer, Florian Rabe, Josef Urban (ed.), Proceedings of CICM 2011, Lecture Notes in Artificial Intelligence 6824, pp. 58-73. 2011. Springer, ISSN 0302-9743. [url] [pdf] [bib]
• F. Winkler. Algebraic Informatics. In: Proceedings of the Forth International Conference on Algebraic Informatics (CAI 2011), Springer Verlag (ed.), Proceedings of 4th International Conference on Algebraic Informatics (CAI 2011), pp. -. 2011. ISSN 0302-9743, ISBN 978-3-642-21492-9. [bib]
• shemyakova, winkler. Linear partial differential equations and linear partial differential operators in computer algebra. In: Numerical and Symbolic Scientific Computing - Progress and Prospects, Springer Verlag (ed.), pp. 333-358. 2011. Springer Verlag, ISSN 0943-853X. [bib]
• F. Winkler. What can Symbolic Computation contribute to Mathematics?. In: Proceedings SYNASC 2011,, aaa (ed.), pp. 1-14. 2011. 1111. [bib]
• Winkler Franz (ed.). Algebraic Informatics - Proceedings of the Forth International Conference on Algebraic Informatics (CAI 2011). Proceedings of Forth International Conference on Algebraic Informatics (CAI 2011), 2011. Springer, Berlin, 0302-9743. [url] [bib]

All Years >>