J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald.The first-order factorizable contributions to the three-loop massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$.Nuclear Physics B999(116427), pp. 1-42.2024.ISSN 0550-3213.arXiv:2311.00644 [hep-ph].[doi][bib]
Jiayue Qi.A tree-based algorithm for the integration of monomials in the Chow ring of the moduli space of stable marked curves of genus zero.Journal of Symbolic Computation122(102253), pp. -.2024.ISSN: 0747-7171.[doi][bib]
E.D. Ocansey, C. Schneider.Representation of hypergeometric products of higher nesting depths in difference rings.J. Symb. Comput.120, pp. 1-50.2024.ISSN: 0747-7171.arXiv:2011.08775 [cs.SC].[doi][bib]
2023
Koustav Banerjee.Positivity of the second shifted difference of partitions and overpartitions: a combinatorial approach.Enumerative Combinatorics and Applications3, pp. 1-4.2023.ISSN 2710-2335.[doi][bib]
K. Banerjee.Inequalities for the modified Bessel function of first kind of non-negative order.Journal of Mathematical Analysis and Applications524, pp. 1-28.2023.Elsevier,ISSN 1096-0813.[doi][bib]
Bruno Buchberger.Automated Programming, Symbolic computation, Machine Learning: My Personal View.Ann. Math. Artif. Intell.91(5), pp. 569-589.2023.1012-2443.[bib]
Bruno Buchberger.International Young Talents Hotspot Austria. In: Ideen, die gehen!, W. Schüssel, G. Kneifel (ed.), pp. 37-39.2023.Edition Kleine Zeitung,20234.[bib]
Bruno Buchberger.Wissenschaft und Meditation: Auf dem Weg zur bewussten Naturgesellschaft.1st edition,December2023.Amazon,979-8868299117.[bib]
David Cerna, Temur Kutsia.Anti-unification and Generalization: a Survey. In: Proceedings of IJCAI 2023 - 32nd International Joint Conference on Artifical Intelligence, Edith Elkind (ed.), pp. 6563-6573.2023.ijcai.org,ISBN 978-1-956792-03-4 .[doi][bib]
J. Bluemlein, A. De Freitas, P. Marquard, N. Rana, C. Schneider.Analytic results on the massive three-loop form factors: quarkonic contributions.Physical Review D108(094003), pp. 1-73.2023.ISSN 2470-0029.arXiv:2307.02983 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. Goedicke, A. von Manteuffel, C. Schneider, K. Schoenwald.Recent 3-Loop Heavy Flavor Corrections to Deep-Inelastic Scattering. In: Proc. of the 16th International Symposium on Radiative Corrections: Applications of Quantum Field Theory to Phenomenology , Giulio Falcioni (ed.), PoSRADCOR2023/046, pp. 1-7.June2023.ISSN 1824-8039.arXiv:2306.16550 [hep-ph].[doi][bib]
Georg Ehling, Temur Kutsia.Matching in Quantitative Equational Theories. In: UNIF 2023 - 37th International Workshop on Unification, Veena Ravishankar and Christophe Ringeissen (ed.), pp. -.2023.[url][bib]
E. Hoxhaj, J.-M. Menjanahary, J. Schicho.Using Algebraic Geometry to Reconstruct a Darboux Cyclide from a Calibrated Camera Picture.J. AAECC, pp. -.2023.1432-0622.to appear.[doi][bib]
A. Jimenez-Pastor, P. Nuspl, V. Pillwein.An extension of holonomic sequences: $C^2$-finite sequences.Journal of Symbolic Computation116, pp. 400-424.2023.ISSN: 0747-7171.[bib]
M. Kauers, P. Nuspl, V. Pillwein.Order bounds for $C^2$-finite sequences. In: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, A.Dickenstein, E. Tsigaridas and G. Jeronimo (ed.), ISSAC '23, Tromso{}, Norway, pp. 389-397.July2023.Association for Computing Machinery,New York, NY, USA,9798400700392}.[doi][bib]
Theresa Köfler.Symbolic local Fourier Analysis to determine the inf-sup stability of the Stokes equations. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz. Master Thesis.2023.[url][bib]
C. Koutschan, B. Moser, A. Ponomarchuk, J. Schicho.Representing piecewise linear functions by functions with small arity.J. AAECC, pp. -.2023.1432-0622.[bib]
Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Temur Kutsia, and Daniele Nantes-Sobrinho.Nominal AC-Matching. In: Proceedings of the 16th International Conference on Intelligent Computer Mathematics, CICM 2023, Catherine Dubois and Manfred Kerber (ed.), Lecture Notes in Aritificial Intelligence14101, pp. 53-68.2023.Springer,ISBN 978-3-031-42752-7.[doi][bib]
S. Falkensteiner, J.J. Mitteramskogler, R. Sendra, F. Winkler.The algebro-geometric method: Solving algebraic differential equations by parametrizations.Bulletin of the American Mathematical Society, pp. 1-41.2023.ISSN 0273-0979.[bib]
J. J. Mitteramskogler, F. Winkler.General solutions of first-order algebraic ODEs in simple constant extensions.Journal of Systems Science and Complexity (JSSC), pp. 0-0.2023.1009-6124.[bib]
P. Nuspl.Algorithms for linear recurrence sequences. Johannes Kepler University Linz. PhD Thesis.2023.[pdf][bib]
Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia.Enumerating All Maximal Clique-Partitions of an Undirected Graph. In: Proceedings 7th Symposium on Working Formal Methods, FROM 2023, Horatiu Cheval, Laurentiu Leustean, and Andrei Sipos (ed.), pp. 65-79.2023.[doi][bib]
Peter Paule.Ramanujan and Computer Algebra. In: Srinivasa Ramanujan: His Life, Legacy, and Mathematical Influence, K. Alladi, G.E. Andrews, B. Berndt, F. Garvan, K. Ono, P. Paule, S. Ole Warnaar, Ae Ja Yee (ed.), pp. -.2023.Springer,ISBN x.[pdf][bib]
Toufik Mansour and Peter Paule.Interview with Peter Paule.Enumerative Combinatorics and Applications ECA 3:1(#S3I1), pp. -.2023.ISSN 2710-2335.[doi][bib]
G.E. Andrews, P. Paule.MacMahon's Partition Analysis XIV: Partitions with n copies of n.To appear in: Journal of Combinatorial Theory, Series A(22-14), pp. -.2023.???.[doi][bib]
S. Beuchler, T. Haubold, V. Pillwein.Recursion Formulas for Integrated Products of Jacobi Polynomials.Constructive Approximation, pp. 0-0.2023.1432-0940.https://arxiv.org/abs/2105.08989.[doi][bib]
Jiayue Qi, Josef Schicho.Five Equivalent Representations of a Phylogenetic Tree.Maple Transactions3(3), pp. -.2023.(ISSN) 2564-3029.[doi][bib]
Jiayue Qi.On the Chow ring of (the) moduli space of stable marked curves of genus zero. Research Institute for Symbolic Computation, Johannes Kepler University Linz. PhD Thesis.2023.[bib]
L. Buse, P. Gonz'alez-Maz'on, J. Schicho.Trilinear birational maps in dimension three.M. Comp.92, pp. 1837-1866.2023.0025-5718.[bib]
B. J�ttler, J. Schicho, Z. Sir.Apollonian-de Casteljau type algorithms for complex rational Bezier curves.CAGD107, pp. -.2023.0167-8396.[bib]
J. Blümlein, C. Schneider, M. Saragnese.Hypergeometric Structures in Feynman Integrals.Annals of Mathematics and Artificial Intelligence 91(5), pp. 591-649.2023.ISSN 1573-7470.arXiv:2111.15501 [math-ph].[doi][bib]
C. Schneider.Refined telescoping algorithms in $RPiSigma$-extensions to reduce the degrees of the denominators. In: ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, Gabriela Jeronimo (ed.), pp. 498-507.July2023.ACM,ISBN 9798400700392.arXiv:2302.03563 [cs.SC].[doi][bib]
Koustav Banerjee, Peter Paule, Cristian-Silviu Radu, Carsten Schneider.Error bounds for the asymptotic expansion of the partition function.Rocky Mt J Math to appear, pp. ?-?.2023.ISSN: 357596.arXiv:2209.07887 [math.NT].[doi][bib]
Johannes Bluemlein, Nikolai Fadeev, Carsten Schneider.Computing Mellin representations and asymptotics of nested binomial sums in a symbolic way: the RICA package.ACM Communications in Computer Algebra57(2), pp. 31-34.June2023.ISSN:1932-2240.arXiv:2308.06042 [hep-ph].[doi][bib]
Wolfgang Schreiner.Concrete Abstractions.Texts & Monographs in Symbolic Computation1st edition,2023.Springer,Cham, Switzerland,Hardcover ISBN 978-3-031-24933-4, Softcover ISBN 978-3-031-24936-5, eBook ISBN 978-3-031-24934-1.[doi][bib]
N. Smoot.A Congruence Family For 2-Elongated Plane Partitions: An Application of the Localization Method.Journal of Number Theory242, pp. 112-153.January2023.ISSN 1096-1658.[doi][bib]
Joachim Borya.Formalisation of Relational Algebra and a SQL-like Language with the RISCAL Model Checker. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Bachelor Thesis.May2023.Also available as RISC Report 23-06.[doi][pdf][bib]
Ágoston Sütő.Model Checking Concurrent Systems Under Fairness Constraints in RISCAL. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Master Thesis.May2023.Also available as RISC Report 23-07.Master's thesis.[doi][pdf][bib]
2022
Banerjee Koustav, Bhattacharjee Sreerupa, Dastidar Manosij Ghosh, Mahanta Pankaj Jyoti, Saikia Manjil P.Parity biases in partitions and restricted partitions.European Journal of Combinatorics103, pp. 103522-103522.2022.Elsevier,ISSN 0195-6698.[pdf][bib]
K. Banerjee, M. G. Dastidar.Hook type tableaux and partition identities. Notes on Number Theory and Discrete Mathematics 28(4), pp. 635-647.2022.ISSN 2367–8275.[doi][bib]
K. Banerjee.New asymptotics and inequalities related to the partition function. Research Institute for Symbolic Computation, Johannes Kepler University. PhD Thesis.2022.[pdf][bib]
Stanislav Purgal and David Cerna and Cezary Kalisyk.Learning Higher-Order Programs without Meta-Interpretive Learning. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22, Lud De Raedt (ed.), Proceedings of International Joint Conference on Artificial Intelligence, Main Track, pp. 2726-2733.july2022.International Joint Conferences on Artificial Intelligence Organization,10.24963/ijcai.2022/378.[doi][bib]
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. Goedicke, A. von Manteuffel, C. Schneider, K. Schoenwald.The Unpolarized and Polarized Single-Mass Three-Loop Heavy Flavor Operator Matrix Elements $A_{gg, Q}$ and $Delta A_{gg, Q}$.Journal of High Energy Physics2022(12, Article 134), pp. 1-55.2022. ISSN 1029-8479.arXiv:2211.05462 [hep-ph].[doi][bib]
Besik Dundua, Temur Kutsia, Mikheil Rukhaia.Unranked Nominal Unification. In: Proceedings of TbiLLC 2019 - 13th International Tbilisi Symposium on Logic, Language, and Computation, Aybüke Özgün and Yulia Zinova (ed.), Proceedings of 13th International Tbilisi Symposium on Logic, Language, and Computation, Lecture Notes in Computer Science13206, pp. 279-296.2022.Springer,ISBN 978-3-030-98478-6.[doi][pdf][bib]
S. Falkensteiner, C. Garay-Lopez, M. Haiech, M. P. Noordman, F. Boulier, Z. Toghani.On Initials and the Fundamental Theorem of Tropical Partial Differential Geometry.Journal of Symbolic Computation115, pp. 53-73.2022.ISSN: 0747-7171.[doi][bib]
S. Falkensteiner, Yi Zhang, N. Thieu Vo.On Formal Power Series Solutions of Algebraic Ordinary Differential Equations.Mediterranean Journal of Mathematics19(74), pp. 1-16.March2022.ISSN 1660-5446.[doi][bib]
S. Falkensteiner.Puiseux Series Solutions with Real or Rational Coefficients of First Order Autonomous AODEs. In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, Amir Hashemi (ed.), Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC), ISSAC '22, pp. 63-71.2022.Association for Computing Machinery,ISBN 9781450386883.[doi][bib]
Sean Dewar, Georg Grasegger, Jan Legerský.Flexible placements of graphs with rotational symmetry. In: 2nd IMA Conference on Mathematics of Robotics, W. Holderbaum, J.M. Selig (ed.), Springer Proceedings in Advanced Robotics21, pp. 89-97.2022.978-3-030-91351-9.[doi][bib]
Matteo Gallet, Georg Grasegger, Jan Legerský, Josef Schicho.Zero-Sum Cycles in Flexible Non-triangular Polyhedra. In: 2nd IMA Conference on Mathematics of Robotics, W. Holderbaum, J.M. Selig (ed.), Springer Proceedings in Advanced Robotics21, pp. 137-143.2022.978-3-030-91351-9.[doi][bib]
M. Gallet, G. Grasegger, J. Legersky, J. Schicho.Zero-sum Cycles in Flexible Polyhedra.Bull. LMS54, pp. 112-125.2022.1469-2120.[bib]
C. Koutschan, A. Ponomarchuk, J. Schicho .Approximation of convex polygons by polygons. In: 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), C. Schneider et al. (ed.), pp. 91-98.2022.IEEE,978-1-6654-0650-5.[bib]
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus Kutz.Nominal Unification and Matching of Higher Order Expressions with Recursive Let.Fundamenta Informaticae185(3), pp. 247-283.2022.IOS Press,ISSN 1875-8681.[url][bib]
J. J. Mitteramskogler, F. Winkler.Symbolic solutions of algebraic ODEs - A comparison of methods.Publicationes Mathematicae Debrecen100(1-2), pp. 143-166.2022.0033-3883.[bib]
P. Nuspl, V. Pillwein.Simple $C^2$-finite Sequences: a Computable Generalization of $C$-finite Sequences. In: ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, Marc Moreno Maza, Lihong Zhi (ed.), pp. 45-53.2022.Association for Computing Machinery,ISBN: 978-1-4503-8688-3.[doi][bib]
P. Nuspl, V. Pillwein.A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. In: Computer Algebra in Scientific Computing, Boulier, Francois and England, Matthew and Sadykov, Timur M. and Vorozhtsov, Evgenii V. (ed.), Proceedings of CASC 2022, LNCS13366, pp. 268-287.2022.Springer International Publishing,ISBN: 978-3-031-14788-3.[bib]
Temur Kutsia, Cleo Pau.Matching and Generalization Modulo Proximity and Tolerance Relations. In: Proceedings of TbiLLC 2019 - 13th International Tbilisi Symposium on Logic, Language, and Computation, Aybüke Özgün and Yulia Zinova (ed.), Lecture Notes in Computer Science13206, pp. 323-342.2022.Springer,ISBN 978-3-030-98478-6.[doi][pdf][bib]
Cleo Pau.Symbolic Techniques for Approximate Reasoning. RISC, JKU. PhD Thesis.2022.[pdf][bib]
Temur Kutsia and Cleo Pau.A Framework for Approximate Generalization in Quantitative Theories. In: Automated Reasoning, Jasmin Blanchette, Laura Kovács, and Dirk Pattinson (ed.), Proceedings of 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, Lecture Notes in Artificial Intelligence13385, pp. 578-596.2022.Springer,ISBN 978-3-031-10768-9.[doi][bib]
S. Beuchler, T. Haubold, V. Pillwein.Recurrences for quadrilateral high-order finite elements.Math. Comput. Sci.16(4), pp. 0-0.2022. MR 4522812.[bib]
Jiayue Qi.An identity on multinomial coefficients.ACM Communications in Computer Algebra56(2), pp. 68-71.2022.issn: 1932-2240.[doi][bib]
J. Schicho.And Yet it Moves - Paradoxically Moving Linkages in Kinematics.Bulletin AMS59, pp. 59-95.2022.ISSN 0273-0979.[doi][bib]
T. Duarte Guerreiro, Z. Li, J. Schicho.Classification of higher mobility closed-loop linkages.Annali di Matematica Pura et Applicata, pp. -.2022.0373-3114.[bib]
M. Gallet, J. Schicho.A new line-symmetric mobile infinity-pod.Confl. Math.14, pp. 35-47.2022.1793-7442.[bib]
B. J�ttler, N. Lubbes, J. Schicho.Projective isomorphisms between rational surfaces.J. Algebra54, pp. 112-125.2022. 0021-8693.[bib]
J. Blümlein, P. Marquard, C. Schneider, K. Schönwald.The three-loop polarized singlet anomalous dimensions from off-shell operator matrix elements.Journal of High Energy Physics2022(193), pp. 0-32.2022.ISSN 1029-8479 .arXiv:2111.12401 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, A. De Freitas, M. Saragnese, C. Schneider, K. Schönwald.New 2– and 3–loop heavy flavor corrections to unpolarized and polarized deep-inelastic scattering.SciPost Phys. Proc.(8), pp. 137.1-137.15.2022.ISSN 2666-4003.DIS2021, arXiv:2107.09350 [hep-ph].[doi][bib]
J. Blümlein, P. Marquard, C. Schneider, K. Schönwald.The Two-Loop Massless Off-Shell QCD Operator Matrix Elements to Finite Terms.Nuclear Physics B980, pp. 1-131.2022.ISSN 0550-3213.arXiv:2202.03216 [hep-ph].[doi][bib]
J. Blümlein, C. Schneider.The SAGEX Review on Scattering Amplitudes, Chapter 4: Multi-loop Feynman Integrals.J. Phys. A: Math. Theor.55(44), pp. 1-37.2022. IOP Publishing Ltd,ISSN: 1751-8121.arXiv:2203.13015 [hep-th].[doi][bib]
J. Blümlein, P. Marquard, C. Schneider, K. Schönwald.The 3-loop anomalous dimensions from off-shell operator matrix elements. In: Proceedings of Loops and Legs in Quantum Field Theory, PoS(LL2022) 48, P. Marquard, M. Steinhauser (ed.)416, pp. 1-12.July2022.ISSN 1824-8039. arXiv:2207.07943 [hep-ph].[doi][bib]
J. Bluemlein, M. Saragnese, C. Schneider.Computer Algebra and Hypergeometric Structures for Feynman Integrals. In: Proceedings of Loops and Legs in Quantum Field Theory, PoS(LL2022) 041, P. Marquard, M. Steinhauser (ed.)416, pp. 1-11.2022.ISSN 1824-8039. arXiv:2207.08524 [math-ph].[doi][bib]
G. Travaglini, A. Brandhuber, P. Dorey, T. McLoughlin, S. Abreu, Z. Bern, N. E. J. Bjerrum-Bohr, J. Bluemlein, R. Britto, J. J. M. Carrasco, D. Chicherin, M. Chiodaroli, P. H. Damgaard, V. Del Duca, L. J. Dixon, D. Dorigoni, C. Duhr, Y. Geyer, M. B. Green, E. Herrmann, P. Heslop, H. Johansson, G. P. Korchemsky, D. A. Kosower, L. Mason, R. Monteiro, D. O'Connell, G. Papathanasiou, L. Plante, J. Plefka, A. Puhm, A.-M. Raclariu, R. Roiban, C. Schneider, J. Trnka, P. Vanhove, C. Wen, C. D. White.The SAGEX Review on Scattering Amplitudes.J. Phys. A: Math. Theor.55(44), pp. 1-12.2022.arxiv.2203.13011 [hep-th],ISSN: 1751-8121.[doi][bib]
J. Blümlein, P. Marquard, C. Schneider, K. Schönwald.The massless three-loop Wilson coefficients for the deep-inelastic structure functions $F_2, F_L, xF_3$ and $g_1$.Journal of High Energy Physics(Paper No. 156), pp. 1-83.2022.ISSN 1029-8479.arXiv:2208.14325 [hep-ph].[doi][bib]
Wolfgang Schreiner, Ágoston Sütő.A Temporal Logic Extension of the RISCAL Model Checker. In: 2022 IEEE 16th International Scientific Conference on Informatics, Poprad, Slovakia, November 23-25, William Steingartner, Štefan Korečko, Anikó Szakál (ed.), pp. 267-272.2022.IEEE,ISBN 979-8-3503-1034-4.[doi][bib]
Wolfgang Schreiner.Implementation Techniques for Mathematical Model Checking. In: SYNASC 2022, 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Hagenberg, Austria, September 12-15, Bruno Buchberger, Mircea Marin, Viorel Negru, Daniela Zaharie (ed.), pp. 12-15.2022.IEEE,ISBN 978-1-6654-6545-8.[doi][bib]
J. Cano, S. Falkensteiner, D. Robertz, R. Sendra.Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables.Journal of Symbolic Computation114, pp. 1-17.2022.ISSN 1095-855X.[doi][bib]
W. Windsteiger.Learning to Reason Assisted by Automated Reasoning. In: Intelligent Computer Mathematics: 15th International Conference, K. Buzzard and T. Kutsia (ed.), Proceedings of CICM 2022, Lecture Notes in Artificial Intelligence LNAI13467, pp. 305-320.2022.Springer,ISBN 978-3-031-16681-5.[doi][pdf][bib]
2021
J. Ablinger.Extensions of the AZ-algorithm and the Package MultiIntegrate. In: Anti-Differentiation and the Calculation of Feynman Amplitudes, J. Blümlein, C. Schneider (ed.), Texts & Monographs in Symbolic Computation (A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria), pp. 35-61.2021.Springer,ISBN 978-3-030-80218-9.arXiv:2101.11385 [cs.SC].[doi][bib]
J. Ablinger.Extensions of the AZ-algorithm and the Package MultiIntegrate. In: Anti-Differentiation and the Calculation of Feynman Amplitudes, J. Blümlein, C. Schneider (ed.), Texts & Monographs in Symbolic Computation (A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria), pp. 35-61.2021.Springer,ISBN 978-3-030-80218-9.arXiv:2101.11385 [cs.SC].[doi][bib]
Bettina Salomon.Die Newton-Andrews-Zeilberger Methode zur Berechnung von harmonischen Summen Identitäten. -. Bachelor Thesis.2021.[bib]
Dominici Diego.Orthogonality of the Dickson polynomials of the $(k+1)$-th kind.Rev. Un. Mat. Argentina62(1), pp. 1-30.2021. ISSN 0041-6932.[doi][bib]
Dominici Diego, Marcell'an Francisco.Discrete semiclassical orthogonal polynomials of class 2. In: Orthogonal polynomials: current trends and applications, Marcell'{a}n, Francisco and Huertas, Edmundo J. (ed.), SEMA SIMAI Springer Ser.22, pp. 103-169.2021.Springer, Cham,978-3-030-56190-1; 978-3-030-56189-5.[doi][bib]
I. Dramnesc, T. Jebelean.AlCons: Deductive Synthesis of Sorting Algorithms in Theorema. In: Theoretical Aspects of Computing - ICTAC 2021, A. Cerone, P. Csaba Ölveczky (ed.), Proceedings of 18th International Colloquium on Theoretical Aspects of Computing - ICTAC, Nur-Sultan, Kazakhstan, LNCS12819, pp. 314-333.September 2021.Springer,978-3-030-85315-0.[pdf][bib]
Besik Dundua, Temur Kutsia, Mircea Marin.Variadic equational matching in associative and commutative theories.Journal of Symbolic Computation106, pp. 78-109.2021.Elsevier,ISSN 0747-7171.[doi][pdf][bib]
F. Boulier, S. Falkensteiner, M.P. Noordman, O.L. Sanchez.On The Relationship Between Differential Algebra and Tropical Differential Algebraic Geometry. In: International Workshop on Computer Algebra in Scientific Computing, F. Boulier, M. England, T. Sadykov, E. Vorozhtsov (ed.), Proceedings of Computer Algebra in Scientific Computing, pp. 62-77.2021.Springer,ISSN 0302-9743.[doi][bib]
M. Gallet, G. Grasegger, J. Legerský, J. Schicho.Combinatorics of Bricard's octahedra.Comptes Rendus. Mathématique359(1), pp. 7-38.2021.Académie des sciences, Paris,ISSN 1631-073X.[doi][bib]
M. Gallet, G. Grasegger, J. Legerský, J. Schicho.On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere.SIAM Journal on Discrete Mathematics35(1), pp. 325-361.2021.ISSN 0895-4801.[doi][bib]
Georg Grasegger, Jan Legerský.Bracing frameworks consisting of parallelograms.The Art of Discrete and Applied MathematicsAccepted Manuscripts, pp. --.2021.2590-9770.[doi][bib]
Ralf Hemmecke, Peter Paule, Silviu Radu.Construction of modular function bases for $Gamma_0(121)$ related to $p(11n+6)$.Integral Transforms and Special Functions32(5-8), pp. 512-527.2021.Taylor & Francis,1065-2469.[doi][bib]
T. Jebelean.A Heuristic Prover for Elementary Analysis in Theorema. In: Intelligent Computer Mathematics, 14th International Conference, CICM 2021, Timisoara, Romania, F. Kamaredine, C. Sacerdoti Coen (ed.), Proceedings of Intelligent Computer Mathematics, 14th International Conference, CICM 2021, LNAI12833, pp. 130-134.July2021.Springer,978-3-030-81096-2.[pdf][bib]
Antonio Jiménez-Pastor, Philipp Nuspl, Veronika Pillwein.On C2-Finite Sequences. In: Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation, Frédéric Chyzak, George Labahn (ed.), ISSAC '21, pp. 217-224.2021.Association for Computing Machinery,New York, NY, USA,ISBN 9781450383820.[doi][bib]
Jiménez-Pastor Antonio, Pillwein Veronika.Differentially definable functions: a survey. In: Proceedings in Applied Mathematics and Mechanics (PAMM), Gesellschaft für Angewandte Mathematik und Mechanik (GAMM) (ed.), Proceedings of Special Issue: 91st Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM)21/1, pp. e202100178-e2021001.2021.[doi][bib]
E. Bartzos, I.Z. Emiris, J. Legerský, E. Tsigaridas.On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2.Journal of Symbolic Computation102, pp. 189-208.2021.ISSN 0747-7171.[doi][bib]
Alexander Maletzky.A generic and executable formalization of signature-based Gröbner basis algorithms.J. Symb. Comput.106, pp. 23-47.2021.Elsevier,ISSN 0747-7171.arXiv:2012.02239 [cs.SC], https://doi.org/10.1016/j.jsc.2020.12.001.[url][bib]
Cleo Pau, Temur Kutsia.Proximity-Based Unification and Matching for Fully Fuzzy Signatures. In: Proceedings of the 30th IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2021, , pp. 1-6.2021.IEEE,isbn 978-1-6654-4407-1.[doi][pdf][bib]
Peter Paule (ed.), Stephen Melczer.An Invitation to Analytic Combinatorics.Texts and Monographs in Symbolic Computation1st edition,2021.Springer,978-3-030-67080-1.[bib]
Peter Paule, Cristian-Silviu Radu.Holonomic relations for modular functions and forms: First guess, then prove.International Journal of Number Theory17(3), pp. 713-759.2021.World Scientific,1793-0421.[doi][bib]
Peter Paule.Contiguous Relations and Creative Telescoping. In: Anti-Differentiation and the Calculation of Feynman Amplitudes, J. Bluemlein and C. Schneider (ed.), Texts and Monographs in Symbolic Computation, pp. 335-394.2021.Springer,ISBN 978-3-030-80218-9.[doi][pdf][bib]
George E. Andrews and Peter Paule .MacMahon's partition analysis XIII: Schmidt type partitions and modular forms.Journal of Number Theory, pp. 95-119.2021.Elsevier,ISSN 0022-314X.[doi][pdf][bib]
Peter Paule, Cristian-Silviu Radu.An algorithm to prove holonomic differential equations for modular forms. In: Transcendence in Algebra, Combinatorics, Geometry and Number Theory. TRANS 2019., Bostan A., Raschel K. (ed.), Springer Proceedings in Mathematics & Statistics373, pp. 367-420.2021.Springer, Cham,978-3-030-84303-8.[doi][bib]
Haubold Tim, Pillwein Veronika, Beuchler Sven.Recursion relations for hp-FEM Element Matrices on quadrilaterals. In: Proceedings in Applied Mathematics and Mechanics (PAMM), Gesellschaft für Angewandte Mathematik und Mechanik (GAMM) (ed.), Proceedings of Special Issue: 91st Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM)21/1, pp. e202100200-e2021002.2021.[doi][bib]
Jiayue Qi.How to avoid collisions in 3D-realizations for moving graphs.Mechanism and Machine Theory 162(104337), pp. -.2021.ISSN 0094-114X.[doi][bib]
Jiayue Qi.A calculus for monomials in Chow group of zero cycles in the moduli space of stable curves.ACM Communications in Computer Algebra54(3), pp. 91-94.2021.issn: 1932-2240.[doi][bib]
Mark van Hoeij and Cristian-Silviu Radu .Computing an order complete basis for M∞(N) and applications. In: Transcendence in Algebra, Combinatorics, Geometry and Number Theory. TRANS 2019, Bostan A., Raschel K. (ed.), Springer Proceedings in Mathematics & Statistics373, pp. 355-366.2021.Springer, Cham,978-3-030-84303-8.[doi][bib]
Christian Krattenthaler, Mircea Merca, Cristian-Silviu Radu.Infinite product formulae for generating functions for sequences of squares. In: Transcendence in Algebra, Combinatorics, Geometry and Number Theory. TRANS 2019, Bostan A., Raschel K. (ed.), Springer Proceedings in Mathematics & Statistics373, pp. 193-236.2021.Springer, Cham,978-3-030-84303-8.[doi][bib]
Wolfgang Schreiner, Franz-Xaver Reichl.First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving. In: Proceedings of the 9th International Symposium on Symbolic Computation in Software Science (SCSS 2021), Hagenberg, Austria, September 8-10, 2021, Temur Kutsia (ed.), Electronic Proceedings in Theoretical Computer Science342, pp. 99-113.September2021.ISSN 2075-2180.[doi][bib]
C. Schneider.The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra.Mathematics in Computer Science15(4), pp. 577-588.2021.ISSN 1661-8289.arXiv:2003.01921 [math.CO].[doi][bib]
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider.Three loop heavy quark form factors and their asymptotic behavior. In: Proc.of 23rd DAE-BRNS High Energy Physics Symposium 2018, Behera, P.K., Bhatnagar, V., Shukla, P., Sinha, R. (ed.), Springer Proceedings in Physics261, pp. 91-100.2021.Springer,ISBN 978-981-33-4407-5.arXiv:1906.05829 [hep-ph].[doi][pdf][bib]
Carsten Schneider, Wadim Zudilin.A case study for ζ(4). In: Transcendence in Algebra, Combinatorics, Geometry and Number Theory. TRANS 2019, Alin Bostan and Kilian Raschel (ed.), Proceedings in Mathematics & Statistics373, pp. 421-435.2021.Springer,ISBN 978-3-030-84304-5.arXiv:2004.08158 [math.NT].[doi][pdf][bib]
Sergei A. Abramov, Manuel Bronstein, Marko Petkovšek, Carsten Schneider.On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in ΠΣ∗-field extensions.J. Symb. Comput.107, pp. 23-66.2021.ISSN 0747-7171.arXiv:2005.04944 [cs.SC].[doi][pdf][bib]
A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, K. Schönwald, and C. Schneider.The Polarized Transition Matrix Element $A_{g, q}(N)$ of the Variable Flavor Number Scheme at $O(alpha_s^3)$.Nuclear Physics B964, pp. 115331-115356.2021.ISSN 0550-3213.arXiv:2101.05733 [hep-ph].[doi][bib]
C. Schneider.Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation. In: Anti-Differentiation and the Calculation of Feynman Amplitudes, J. Blümlein and C. Schneider (ed.), Texts and Monographs in Symbolic Computuation, pp. 423-485.2021.Springer,ISBN 978-3-030-80218-9.arXiv:2102.01471 [cs.SC], RISC-Linz Report Series No. 21-03.[doi][pdf][bib]
J. Ablinger, J. Blümlein, C. Schneider.Iterated integrals over letters induced by quadratic forms.Physical Review D 103(9), pp. 096025-096035.2021.ISSN 2470-0029.arXiv:2103.08330 [hep-th].[doi][bib]
J. Ablinger, C. Schneider.Solving linear difference equations with coefficients in rings with idempotent representations. In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (Proc. ISSAC 21), Marc Mezzarobba (ed.), pp. 27-34.2021.ISBN 978-1-4503-8382-0/21/06.arXiv:2102.03307 [cs.SC].[doi][pdf][bib]
J. Blümlein, A. De Freitas, M. Saragnese, K. Schönwald, C. Schneider.The Logarithmic Contributions to the Polarized $O(alpha_s^3)$ Asymptotic Massive Wilson Coefficients and Operator Matrix Elements in Deeply Inelastic Scattering.Physical Review D104(3), pp. 1-73.2021.ISSN 2470-0029.arXiv:2105.09572 [hep-ph].[doi][bib]
J. Blümlein, P. Marquard, C. Schneider, K. Schönwald.The three-loop unpolarized and polarized non-singlet anomalous dimensions from off shell operator matrix elements.Nucl. Phys. B971, pp. 1-44.2021.ISSN 0550-3213.arXiv:2107.06267 [hep-ph].[doi][bib]
Wolfgang Schreiner.Thinking Programs.Texts & Monographs in Symbolic Computation1st edition,2021.Springer,Cham, Switzerland,Hardcover ISBN 978-3-030-80506-7, Softcover ISBN 978-3-030-80509-8, eBook ISBN 978-3-030-80507-4.[doi][bib]
K. Alladi, B.C. Berndt, P. Paule, J.A. Sellers, A.J. Yee.George E. Andrews 80 Years of Combinatory Analysis.Trends in Mathematics1st edition,2021.Birkhaeuser,Cham,ISBN 978-3-030-57050-7.[doi][bib]
J. Cano, S. Falkensteiner, R. Sendra.Existence and convergence of Puiseux series solutions for first order autonomous differential equations.Journal of Symbolic Computation108, pp. 137-151.2021.ISSN 0747-7171.[doi][bib]
F. Boulier, J. Cano, S. Falkensteiner, R. Sendra.Puiseux Series and Algebraic Solutions of First Order Autonomous AODEs - A MAPLE Package. In: Communications in Computer and Information Science, Rob Corless, Jürgen Gerhard and Ilias Kotsireas (ed.), Proceedings of Maple Conference 20201414, pp. 89-103.2021.Springer, Cham,ISSN 1865-0929.[url][bib]
Nicolas Allen Smoot, Cristian-Silviu Radu.A method of verifying partition congruences by symbolic computation.Journal of Symbolic Computation104, pp. 105-133.2021.0747-7171.[doi][pdf][bib]
Lucas Payr.Refinement Types for Elm. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Master Thesis.April2021.Also available as RISC report no. 21-10.Master Thesis.[pdf][bib]
Sebastian Schmalzer.Verfahren zum Lösen des Inventory Routing Problems. RISC Institute, Johannes Kepler University Linz. Bachelor Thesis.November2021.[pdf][bib]
J. Ablinger, A. Uncu.qFunctions - A Mathematica package for q-series and partition theory applications.Journal of Symbolic Computation107, pp. 145-166.2021.ISSN 0747-7171.arXiv:1910.12410.[doi][bib]
W. Windsteiger.Automated Theorem Proving in the Classroom. In: Proceedings Automated Deduction in Geometry (ADG 2021), Predrag Janicic (ed.), Proceedings of Automated Deduction in Geometry (ADG 2021), Electronic Proceedings in Theoretical Computer Science (EPTCS)352, pp. 54-63.2021.ISSN 2075-2180.Extended abstract.[doi][pdf][bib]
2020
J. Ablinger.Proving Two Conjectural Series for $\zeta(7)$ and Discovering More Series for $\zeta(7)$. In: Mathematical Aspects of Computer and Information Science, D. Slamanig, E. Tsigaridas, Z. Zafeirakopoulos (ed.), pp. 42-47.2020.Springer International Publishing,978-3-030-43120-4.[url][bib]
J. Ablinger, J. Blümlein, A. De Freitas, K. Schönwald.Subleading logarithmic QED initial state corrections to $e^+e^−\to γ^⁎/Z^{0⁎}$ to $O(\alpha^6L^5)$.Nuclear Physics B955, pp. 115045-115045.2020. ISSN 0550-3213.[url][bib]
Antonio Jiménez-Pastor, Alin Bostan, Frédéric Chyzak, Pierre Lairez.The Sage Package Comb_walks for Walks in the Quarter Plane.ACM Commun. Comput. Algebra54(2), pp. 30-38.sep2020.Association for Computing Machinery,New York, NY, USA,1932-2240.[doi][bib]
Jose Capco, Claus Scheiderer. Two remarks on sums of squares with rational coefficients.Banach Center Publications121, pp. 25-36.2020.0137-6934.[doi][bib]
J. Capco, M. Safey el Din, J. Schicho.Robots, computer algebra and 8 connected components. In: Proceedings of ISSAC 2020, I. Emiris, L. Zhi (ed.), pp. 62-69.2020.978-1-4503-7100-1.[url][bib]
David M. Cerna, Temur Kutsia.Unital Anti-Unification: Type and Algorithms. In: Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Zena M. Ariola (ed.), Leibniz International Proceedings in Informatics (LIPIcs)167, pp. 26:1-26:20.2020.Schloss Dagstuhl-Leibniz-Zentrum für Informatik,ISBN 978-3-95977-155-9, ISSN 1868-8969.[url][bib]
David Cerna, Temur Kutsia.Idempotent Anti-unification.ACM Transactions on Computational Logic (TOCL)21(2), pp. 10:1-10:32.2020.ACM Press,ISSN 1529-3785.[doi][pdf][bib]
David M. Cerna, Martina Seidl, Wolfgang Schreiner, Wolfgang Windsteiger, Armin Biere.Aiding an Introduction to Formal Reasoning Within a First-Year Logic Course for CS Majors Using a Mobile Self-Study App. In: ITICSE 2020, ACM (ed.), Proceedings of ITICSE, pp. 61-67.2020.9781450368742.[doi][bib]
David M. Cerna, Martina Seidl, Wolfgang Schreiner, Wolfgang Windsteiger, Armin Biere.Computational Logic in the First Semester of Computer Science: An Experience Report. In: Proceedings of the 12th International Conference on Computer Supported Education - Volume 2: CSEDU, Springer (ed.), Proceedings of CSEDU, pp. 374-381.2020.978-989-758-417-6.[doi][bib]
David M. Cerna.Anti-unification and the Theory of Semirings.Theor. Comput. Sci.848, pp. 133-139.2020.RISC / CAS ICS,0304-3975.[doi][bib]
David Cerna and Alexander Leitsch and Anela Lolic.Schematic Refutations of Formula Schemata.Journal of Automated Reasoning, pp. -.2020.1573-0670.[doi][bib]
David M. Cerna, Temur Kutsia.Higher-order pattern generalization modulo equational theories.Mathematical Structures in Computer Science30(6), pp. 627-663.2020.ISSN 0960-1295.[url][bib]
David M. Cerna and Rafael P. D. Kiesel and Alexandra Dzhiganskaya.A Mobile Application for Self-Guided Study of Formal Reasoning. In: Proceedings 8th International Workshop on Theorem Proving Components for Educational Software, ThEdu@CADE 2019, Natal, Brazil, 25th August 2019, Pedro Quaresma and Walther Neuper and Jo{ {a}}o Marcos (ed.), EPTCS313, pp. 35-53.2020.2075-2180.[doi][bib]
David M. Cerna , Temur Kutsia.Unital Anti-Unification: Type and Algorithms. In: 5th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2020, June 29-July 6, 2020, Paris, France (Virtual Conference, Zena M. Ariola (ed.), Proceedings of FSCD, LIPICS167/20-02, pp. 1-20.2020.1868-8969.[doi][bib]
Dominici Diego, Pillwein Veronika.A sequence of polynomials generated by a Kapteyn series of the second kind. In: Algorithmic combinatorics: enumerative combinatorics, special functions and computer algebra--in honour of Peter Paule on his 60th birthday, Pillwein, Veronika and Schneider, Carsten (ed.), Texts Monogr. Symbol. Comput., pp. 159-179.2020.Springer, Cham,978-3-030-44558-4; 978-3-030-44559-1.[doi][bib]
Dominici Diego.Recurrence coefficients of Toda-type orthogonal polynomials I. Asymptotic analysis.Bull. Math. Sci.10(2), pp. 2050003, 32-2050003.2020. ISSN 1664-3607.[doi][bib]
Dominici Diego.Hankel determinants, Hahn polynomials, and a formula of Krattenthaler.S'em. Lothar. Combin.81, pp. Art. B81i, 14-Art. .2020.1286-4889.[bib]
Dominici Diego.Power series expansion of a Hankel determinant.Linear Algebra Appl.601, pp. 17-54.2020. ISSN 0024-3795.[doi][bib]
Dominici Diego.Matrix factorizations and orthogonal polynomials.Random Matrices Theory Appl.9(1), pp. 2040003, 33-2040003.2020. ISSN 2010-3263.[doi][bib]
Dominici Diego.Mehler-Heine type formulas for the Krawtchouk polynomials.J. Math. Anal. Appl.486(1), pp. 123877, 25-123877, .2020. ISSN 0022-247X.[doi][bib]
Besik Dundua, Temur Kutsia, Mircea Marin, Cleopatra Pau.Constraint Solving over Multiple Similarity Relations. In: Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Zena M. Ariola (ed.), Leibniz International Proceedings in Informatics (LIPIcs)167, pp. 30:1-30:19.2020.Schloss Dagstuhl-Leibniz-Zentrum für Informatik,ISBN 978-3-95977-155-9, ISSN 1868-8969.[doi][bib]
Besik Dundua, Temur Kutsia, Mircea Marin, Mikheil Rukhaia.Specification and Analysis of ABAC Policies in a Rule-Based Framework. In: AMINSE 2019: Applications of Mathematics and Informatics in Natural Sciences and Engineering, George Jaiani, David Natroshvili (ed.), Springer Proceedings in Mathematics & Statistics334, pp. 101-116.2020.Springer,ISBN 978-3-030-56356-1, 978-3-030-56355-4.[doi][pdf][bib]
Mircea Marin, Besik Dundua, Temur Kutsia.A Rule-Based System for Computation and Deduction in Mathematica. In: WRLA 2020: Rewriting Logic and Its Applications, Santiago Escobar, Narciso Martí-Oliet (ed.), Lecture Notes in Computer Science12328, pp. 57-74.2020.Springer,ISBN 978-3-030-63595-4, 978-3-030-63594-7.[doi][pdf][bib]
Besik Dundua, Temur Kutsia, Mircea Marin, Cleo Pau.Extending the 𝜌Log Calculus with Proximity Relations. In: AMINSE 2019: Applications of Mathematics and Informatics in Natural Sciences and Engineering, George Jaiani, David Natroshvili (ed.), Springer Proceedings in Mathematics & Statistics334, pp. 83-100.2020.Springer,ISBN 978-3-030-56356-1, 978-3-030-56355-4.[doi][pdf][bib]
S. Falkensteiner.Power Series Solutions of AODEs - Existence, Uniqueness, Convergence and Computation. RISC Hagenberg, Johannes Kepler University Linz. PhD Thesis.June2020.Also available as RISC report no. 20-13.[pdf][bib]
S. Falkensteiner, C. Garay-Lopez, M. Haiech, M. P. Noordman, Z. Toghani, F. Boulier.The Fundamental Theorem of Tropical Partial Differential Algebraic Geometry. In: ISSAC '20: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, Angelos Mantzaflaris (ed.), Proceedings of 45th International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 178-185.072020.Association for Computing Machinery,ISBN 9781450371001.[bib]
Sean Dewar, Georg Grasegger, Jan Legerský.Computing Animations of Linkages with Rotational Symmetry (Media Exposition). In: 36th International Symposium on Computational Geometry (SoCG 2020), Sergio Cabello and Danny Z. Chen (ed.), Leibniz International Proceedings in Informatics (LIPIcs)164, pp. 77:1-77:4.2020.Schloss Dagstuhl-Leibniz-Zentrum für Informatik,Dagstuhl, Germany,ISBN 978-3-95977-143-6.[doi][bib]
G. Grasegger, J. Legerský, J. Schicho.Graphs with Flexible Labelings allowing Injective Realizations.Discrete Mathematics343(6), pp. Art. 111713-.2020.ISSN 0012-365X.[doi][bib]
G. Grasegger, J. Legerský.FlexRiLoG - A SageMath Package for Motions of Graphs. In: Mathematical Software – ICMS 2020, Bigatti A., Carette J., Davenport J., Joswig M., de Wolff T. (ed.), Proceedings of ICMS 2020, Lecture Notes in Computer Science12097, pp. 442-450.2020.Springer, Cham,ISBN 978-3-030-52199-8.[doi][bib]
G. Grasegger, J. Legerský, J. Schicho.On the Classification of Motions of Paradoxically Movable Graphs.Journal of Computational Geometry11(1), pp. 548-575.2020.ISSN: 1920-180X.[doi][bib]
M. Gallet, G. Grasegger, J. Schicho.Counting realizations of {L}aman graphs on the sphere.Electronic Journal of Combinatorics27(2), pp. 1-18.2020.1077-8926 .[url][bib]
A. Jimenez-Pastor, V. Pillwein, M.F. Singer.Some structural results on D^n finite functions.Advances in Applied Mathematics117, pp. 0-0.June2020.Elsevier,0196-8858.[doi][pdf][bib]
Alin Bostan, Antonio Jiménez-Pastor.On the exponential generating function of labelled trees.Comptes Rendus. Mathématique358(9-10), pp. 1005-1009.2020.Académie des sciences, Paris,1631-0721.[doi][bib]
Antonio Jiménez-Pastor, Alin Bostan, Frédéric Chyzak, Pierre Lairez.The Sage Package Comb_walks for Walks in the Quarter Plane.ACM Commun. Comput. Algebra54(2), pp. 30-38.sep2020.Association for Computing Machinery,New York, NY, USA,1932-2240.[doi][bib]
Ilias Kotsireas, Temur Kutsia, Dimitris Simos. Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques.Annals of Mathematics and Artificial Intelligence88(1), pp. 213-236.2020.ISSN 1573-7470.[doi][pdf][bib]
Li, Z. and Nawratil, G. and Rist, F. and Hensel, M..Invertible Paradoxic Loop Structures for Transformable Design.Computer Graphics Forum, pp. 261-275.2020.1467-8659.[doi][bib]
Franz Winkler, Johann Mitteramskogler.Symbolic solutions of algebraic ODEs - A comparison of methods.Publications Mathemticae Debrecen, pp. 0-0.2020.0.[bib]
Temur Kutsia, Cleo Pau.Proximity-based Unification with Arity Mismatch. In: Proceedings of the 34th International Workshop on Unification, Temur Kutsia, Andrew M. Marshall (ed.), pp. 9:1-9:6.2020.[bib]
Peter Paule (ed.), Tetsuo Ida.An Introduction to Computational Origami.Texts and Monographs of Symbolic Computation1st edition,2020.Springer,978-3-319-59189-6.[bib]
D. Dominici, V. Pillwein.A sequence of polynomials generated by a Kapteyn series of the second kind. In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein and C. Schneider (ed.), Texts and Monographs in Symbolic Computuation, in press, pp. ?-?.2020.Springer,arXiv:1607.05314 [math.CO].[url][pdf][bib]
Radu, Cristian-Silviu.A reduction theorem of certain relations modulo p involving modular forms. In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein, C. Schneider (ed.), pp. 317-337.2020.Springer,978-3-030-44558-4.[doi][pdf][bib]
Franz-Xaver Reichl.The Integration of SMT Solvers into the RISCAL Model Checker. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Master Thesis.April2020.[pdf][bib]
M. Gallet, M. Makhul, J. Schicho.Probabilities of incidence between lines and a plane curve over finite field.Finite Fields and Their Applications61, pp. 1-22.2020.1071-5797.[bib]
V. Bartzos, I. Emiris, J. Schicho.On the multihomogeneous Bezout bound on the number of embeddings of minimally rigid graphs.Applicable Algebra in Engineering, Communication and Computing31, pp. 325-357.2020.0938-1279.[url][bib]
M. Gallet, J. Schicho.Counting Projections of Rational Curves.Israel Journal of Mathematics240, pp. 503-538.2020.0021-2172 .[url][bib]
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider.Three loop QCD corrections to heavy quark form factors. In: Proc. ACAT 2019, , J. Phys.: Conf. Ser.1525/012018, pp. 1-10.2020.ISSN 1742-6596.arXiv:1905.03728 [hep-ph].[doi][bib]
C. Krattenthaler, C. Schneider.Evaluation of binomial double sums involving absolute values. In: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, in Honour of Peter Paule on his 60th Birthday, V. Pillwein, C. Schneider (ed.), Texts and Monographs in Symbolic Computuation, pp. 249-295.2020.Springer,ISBN 978-3-030-44558-4.arXiv:1607.05314 [math.CO].[doi][pdf][bib]
C. Schneider.Minimal representations and algebraic relations for single nested products.Programming and Computer Software46(2), pp. 133-161.2020.ISSN 1608-3261.arXiv:1911.04837 [cs.SC].[doi][pdf][bib]
J. Blümlein, A. Maier, P. Marquard, G. Schäfer, C. Schneider.From Momentum Expansions to Post-Minkowskian Hamiltonians by Computer Algebra Algorithms.Physics Letters B801(135157), pp. 1-8.2020.ISSN 0370-2693.arXiv:1911.04411 [gr-qc].[doi][bib]
J. Blümlein, P. Marquard, N. Rana, C. Schneider.Heavy quark form factors at three loops. In: 14th International Symposium on Radiative Corrections (RADCOR2019), D. Kosower, M. Cacciari (ed.)POS(RADCOR2019)013, pp. 1-7.2020.ISSN 1824-8039.[doi][bib]
Johannes Blümlein, Peter Marquard, Carsten Schneider.A refined machinery to calculate large moments from coupled systems of linear differential equations. In: 14th International Symposium on Radiative Corrections (RADCOR2019), D. Kosower, M. Cacciari (ed.), POS(RADCOR2019)078, pp. 1-13.2020.ISSN 1824-8039.arXiv:1912.04390 [cs.SC].[doi][bib]
A. Behring, J. Blümlein, A. De Freitas, A. Goedicke, S. Klein, A. van Manteuffel, C. Schneider, K. Schönwald.The Polarized Three-Loop Anomalous Dimensions from a Massive Calculation. In: 14th International Symposium on Radiative Corrections (RADCOR2019), D. Kosower, M. Cacciari (ed.), POS(RADCOR2019)047arXiv:1911.06189 [hep-ph], pp. 1-10.2020.ISSN 1824-8039.[doi][bib]
J. Ablinger, J. Blümlein, A. De Freitas, M. Saragnese, C. Schneider, K. Schönwald.The three-loop polarized pure singlet operator matrix element with two different masses.Nuclear Physics B 952(114916), pp. 1-18.2020.ISSN 0550-3213.arXiv:1911.11630 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schönwald.The three-loop single mass polarized pure singlet operator matrix element.Nuclear Physics B953(114945), pp. 1-25.2020.ISSN 0550-3213.arXiv:1912.02536 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Goedicke, M. Saragnese, C. Schneider, K. Schönwald.The Two-mass Contribution to the Three-Loop Polarized Operator Matrix Element $A_{gg, Q}^{(3)}$ .Nuclear Physics B955, pp. 1-70.2020.ISSN 0550-3213.arXiv:2004.08916 [hep-ph].[doi][bib]
Manfred Droste, Temur Kutsia, George Rahonis, Wolfgang Schreiner.McCarthy-Kleene fuzzy automata and MSO logics.Information and Computation, pp. -.2020.Elsevier,ISSN 0890-5401.In Press.[doi][bib]
Ádam Tóth, Tamas Bérczes, Janos Sztrik, Attila Kuki, Wolfgang Schreiner.The Simulation of Finite-Source Retrial Queueing Systems with Collisions and Blocking.Journal of Mathematical Sciences 246(4), pp. 548-559.March2020.ISSN 1573-8795.[doi][bib]
Wolfgang Schreiner, Franz-Xaver Reichl.Mathematical Model Checking Based on Semantics and SMT.Transactions on Internet Research16(2), pp. 4-13.July2020.IPSI,ISSN 1820-4503.[url][bib]
Wolfgang Schreiner, William Steingartner, Valerie Novitzká.A Novel Categorical Approach to the Semantics of Relational First-Order Logic.Symmetry12(10), pp. 1584-.2020.MDPI,Basel, Switzerland,ISSN 2073-8994.[doi][pdf][bib]
J. Cano, S. Falkensteiner, R. Sendra.Algebraic, Rational and Puiseux Series Solutions of Systems of Autonomous Algebraic ODEs of Dimension One.Mathematics in Computer Science15, pp. 189-198.2020.ISSN 16618289.[doi][bib]
Nicolas Allen Smoot.On the Computation of Identities Relating Partition Numbers in Arithmetic Progressions with Eta Quotients: An Implementation of Radu's Algorithm.Journal of Symbolic Computation, pp. -.2020.0747-7171.To Appear.[pdf][bib]
N. Smoot.Computer Algebra with the Fifth Operation: Applications of Modular Functions to Partition Congruences. Research Institute for Symbolic Computation, JKU Linz. PhD Thesis.2020.[pdf][bib]
Moritz Willnauer.Modelling and Solving a Scheduling Problem by Max-Flow. RISC Institute, JKU Linz. Bachelor Thesis.March2020.[pdf][bib]
Ingolf Neumüller.Eine industrielle Anwendung von heuristischen Optimierungsverfahren für das Bin-Packing Problem. RISC Institute, JKU Linz. Master Thesis.September2020.[pdf][bib]
Lukas Weigert.Strong Rational General Solutions of AODEs using Optimal Curve Parametrization. Research Institute for Symbolic Computation. Master Thesis.April2020.Also available as RISC Report 20-17.[pdf][bib]
Franz Winkler.Symbolic computation in algebra, geometry, and differential equations. In: Proceedings CAI-2019, , Special issue of "Information and Computation", pp. 0-0.2020.0.[bib]
2019
J. Ablinger.Discovering and Proving Infinite Pochhammer Sum Identities.Experimental Mathematics, pp. 1-15.2019.Taylor & Francis,10.1080/10586458.2019.1627254.[doi][bib]
Ali Kemal Uncu, Alexander Berkovich.Polynomial Identities Implying Capparelli's Partition Theorems .Accepted - Journal of Number Theory, pp. -.2019.N/A.[url][bib]
Ali Kemal Uncu, Alexander Berkovich.Refined q-Trinomial Coefficients and Two Infinite Hierarchies of q-Series Identities .ArXiv e-prints (accepted), pp. 1-10.2019.N/A.[url][bib]
David M. Cerna, Temur Kutsia.A Generic Framework for Higher-Order Generalizations. In: Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), Herman Geuvers (ed.), Leibniz International Proceedings in Informatics (LIPIcs)131, pp. 10:1-10:19.2019.Schloss Dagstuhl,ISSN 1868-8969.[doi][bib]
Besik Dundua, Temur Kutsia, Mircea Marin.Variadic Equational Matching. In: Intelligent Computer Mathematics - 12th International Conference, CICM 2019, Cezary Kaliszyk, Edwin Brady, Andrea Kohlhase, Claudio Sacerdoti Coen (ed.), Lecture Notes in Computer Science11617, pp. 77-92.2019.Springer,ISBN 978-3-030-23249-8.[pdf][bib]
Mircea Marin, Temur Kutsia, Besik Dundua.A Rule-based Approach to the Decidability of Safety of ABACα. In: Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, SACMAT 2019, Florian Kerschbaum, Atefeh Mashatan, Jianwei Niu, Adam J. Lee (ed.), pp. 173-178.2019.ACM,ISBN 978-1-4503-6753-0.[doi][pdf][bib]
Ankush Goswami.A q-analogue for Euler’s evaluations of the Riemann zeta function.Research in Number Theory5:3, pp. 1-11.2019.Springer,10.1007.[bib]
Ankush Goswami.A q-analogue for Euler’s $\zeta(6)=\pi^6/6$. In: Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday, Springer-Birkhauser (ed.), Proceedings of Combinatory Analysis 2018: A Conference in Honor of George Andrews' 80th Birthday, pp. 1-5.2019.none.[bib]
Ankush Goswami.Some Problems in Analytic Number Theory. University of Florida. PhD Thesis.2019.First part of this thesis is to appear in Proceedings of Analytic and Combinatorial Number Theory: The Legacy of Ramanujan - A CONFERENCE IN HONOR OF BRUCE C. BERNDT'S 80TH BIRTHDAY.[bib]
G. Grasegger, J. Legerský, J. Schicho.Graphs with Flexible Labelings.Discrete & Computational Geometry62(2), pp. 461-480.2019.1432-0444.arXiv:1708.05298.[doi][bib]
Ralf Hemmecke, Silviu Radu.Construction of all Polynomial Relations among Dedekind Eta Functions of Level $N$.Journal of Symbolic Compuation95, pp. 39-52.2019.ISSN 0747-7171.Also available as RISC Report 18-03 http://www.risc.jku.at/publications/download/risc_5561/etarelations.pdf.[doi][bib]
Ralf Hemmecke, Silviu Radu, Liangjie Ye.The Generators of all Polynomial Relations among Jacobi Theta Functions. In: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, Johannes Blümlein and Carsten Schneider and Peter Paule (ed.), Texts & Monographs in Symbolic Computation18-09, pp. 259-268.2019.Springer International Publishing,Cham,978-3-030-04479-4.Also available as RISC Report 18-09 http://www.risc.jku.at/publications/download/risc_5719/thetarelations.pdf.[doi][bib]
Jiménez-Pastor Antonio, Pillwein Veronika.A Computable Extension for Holonomic Functions: DD-Finite Functions.Journal of Symbolic Computation94, pp. 90-104.September-October2019.ISSN 0747-7171.[doi][bib]
Jan Legerský.Flexible and Rigid Labelings of Graphs. Research Institute for Symbolic Computation, Johannes Kepler University Linz. PhD Thesis.2019.[url][pdf][bib]
J. Legerský, M. Svobodová.Construction of algorithms for parallel addition in expanding bases via Extending Window Method.Theoretical Computer Science795, pp. 547-569.2019. ISSN 0304-3975.[doi][bib]
A. Maletzky.Formalization of Dubé's Degree Bounds for Gröbner Bases in Isabelle/HOL. In: Intelligent Computer Mathematics (Proceedings of CICM 2019, Prague, Czech Republic, July 8-12), Cezary Kaliszyk and Edwin Brady and Andrea Kohlhase and Claudio Sacerdoti-Coen (ed.), Proceedings of CICM 2019, Lecture Notes in Computer Science, pp. ?-?.2019.Springer,to appear.[pdf][bib]
Evans Doe Ocansey.Difference Ring Algorithms for Nested Products. RISC, Johannes Kepler University. PhD Thesis.November2019.[pdf][bib]
Temur Kutsia, Cleo Pau.Solving Proximity Constraints. In: Logic-Based Program Synthesis and Transformation - 29th International Symposium, LOPSTR 2019. Revised Selected Papers, Maurizio Gabbrielli (ed.), Lecture Notes in Computer Science 12042, pp. 107-122.2019.ISBN 978-3-030-45259-9.[pdf][bib]
Temur Kutsia, Cleo Pau.Solving Proximity Constraints. In: 33nd International Workshop on Unification, UNIF 2019, Daniele Nantes, Serdar Erbatur (ed.), pp. --.2019.[bib]
Peter Paule, Silviu Radu.A proof of the Weierstrass gap theorem not using the Riemann-Roch formula.Annals of Combinatorics23(19-02), pp. 963-1007.May2019.Springer,0218-0006.[doi][bib]
V. Pillwein.On the positivity of the Gillis–Reznick–Zeilberger rational function.Advances in Applied Mathematics104, pp. 75 - 84.2019. ISSN 0196-8858.[url][bib]
Haubold Tim, Pillwein Veronika, Beuchler Sven.Symbolic Evaluation of hp-FEM Element Matrices. In: Proceedings in Applied Mathematics and Mechanics (PAMM), Gesellschaft für Angewandte Mathematik und Mechanik (GAMM) (ed.), Proceedings of 2019 Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM)19/1, pp. e201900446-e2019004.2019.[doi][bib]
M. Hauer, B. Jüttler, J. Schicho.Projective and affine symmetries and equivalences of rational and polynomial surfaces.J. Comp. Appl. Math.349, pp. 424-437.2019.0377-0427.[bib]
P. Paule, C. Schneider.Towards a symbolic summation theory for unspecified sequences. In: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, J. Blümlein, P. Paule, C. Schneider (ed.), Texts and Monographs in Symbolic Computation, pp. 351-390.2019.Springer,ISBN 978-3-030-04479-4.arXiv:1809.06578 [cs.SC].[doi][pdf][bib]
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider.Automated Solution of First Order Factorizable Systems of Differential Equations in One Variable.Nucl. Phys. B939, pp. 253-291.2019.ISSN 0550-3213.arXiv:1810.12261 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, M. Round, C. Schneider.Numerical Implementation of Harmonic Polylogarithms to Weight w = 8.Comput. Phys. Comm.240, pp. 189-201.2019.ISSN 0010-4655.arXiv:1809.07084 [hep-ph].[doi][pdf][bib]
J. Blümlein, P. Marquard, N. Rana, C. Schneider.The Heavy Fermion Contributions to the Massive Three Loop Form Factors.Nuclear Physics B949(114751), pp. 1-97.2019.ISSN 0550-3213.arXiv:1908.00357 [hep-ph].[doi][bib]
A. Behring, J. Blümlein, A. De Freitas, A. Goedicke, S. Klein, A. von Manteuffel, C. Schneider, K. Schönwald.The Polarized Three-Loop Anomalous Dimensions from On-Shell Massive Operator Matrix Elements.Nuclear Physics B948(114753), pp. 1-41.2019.ISSN 0550-3213.arXiv:1908.03779 [hep-ph].[doi][bib]
Wolfgang Schreiner.Das Kooperationsprojekt "Supercomputer MACH-2". In: ACOnet Jahresbericht 2018, Christian Panigl (ed.), pp. 53-55.2019.Universität Wien,ISSN 2616-7972.[url][bib]
Wolfgang Schreiner.Theorem and Algorithm Checking for Courses on Logic and Formal Methods. In: Post-Proceedings ThEdu'18, Pedro Quaresma and Walther Neuper (ed.), Proceedings of 7th International Workshop on Theorem proving components for Educational software, Oxford, United Kingdom, 18 July 2018, Electronic Proceedings in Theoretical Computer Science (EPTCS)290, pp. 56-75.April 12019.Open Publishing Association,ISSN 2075-2180.[doi][pdf][bib]
Wolfgang Schreiner.Logic and Semantic Technologies for Computer Science Education. In: Informatics’2019, 2019 IEEE 15th International Scientific Conference on Informatics, Poprad, Slovakia, November 20–22, William Steingartner, Štefan Korecko, Anikó Szakál (ed.), pp. 415-420.2019.IEEE,ISBN 978-1-7281-3178-8.invited paper.[doi][bib]
William Steingartner, Valerie Novitzká, Wolfgang Schreiner.A Coalgebraic Operational Semantics for an Imperative Language.Computing and Informatics, pp. -.2019.ISSN 1335-9150.To appear.[bib]
S. Falkensteiner, R. Sendra.Solving First Order Autonomous Algebraic Ordinary Differential Equations by Places.Mathematics in Computer Science14, pp. 327-337.122019.ISSN 1661-8289.[doi][bib]
Nicolas Allen Smoot.A Family of Congruences for Rogers-Ramanujan Subpartitions.Journal of Number Theory196, pp. 35-60.March2019.ISSN 0022-314X.[pdf][bib]
Stefan Amberger.A Parallel, In-Place, Rectangular Matrix Transpose Algorithm. Research Institute for Symbolic Computatation (RISC), Johannes Kepler University, Linz, Austria. Master Thesis.March2019.[pdf][bib]
Hsuan-Ming Chen.Migrating Mathematical Programs to Web Interface Frameworks. Research Institute for Symbolic Computatation (RISC), Johannes Kepler University, Linz, Austria. Master Thesis.April2019.Internationaler Universitätslehrgang: Informatics: Engineering & Management.[pdf][bib]
Ali Kemal Uncu.A Polynomial Identity Implying Schur's Partition Theorem .ArXiv e-prints (submitted), pp. 1-11.2019.N/A.[url][bib]
Franz Winkler.The Algebro-Geometric Method for Solving Algebraic Differential Equations - A Survey.Journal of System Science and Complexity32, pp. 256-270.2019.1009-6124.[bib]
J.R. Sendra, Franz Winkler.The algebro-geometric solution method for algebraic differential equations - An introduction by examples. In: Complex Differential and Difference Equations, Proceedings of the School and Conference CDDE, held at Bedlewo, Poland, deGruyter (ed.), pp. 129-146.2019.Polish Academy of Sciences, deGruyter,978-3-11-061142-7.[bib]
2018
J. Ablinger.An Improved Method to Compute the Inverse Mellin Transform of Holonomic Sequences. In: Proceedings of "Loops and Legs in Quantum Field Theory - LL 2018, J. Blümlein and P. Marquard (ed.), PoS(LL2018), pp. 1-10.2018.ISSN 1824-8039.[url][bib]
N. Amiridze, T. Kutsia.Anti-Unification and Natural Language Processing. In: Fifth Workshop on Natural Language and Computer Science, NLCS’18, A. Asudeh, V. de Paiva, L. Moss (ed.), EasyChair preprints203, pp. 1-12.2018.[doi][pdf][bib]
Gallet Matteo, Ranestad Kristian, Villamizar Nelly.Varieties of apolar subschemes of toric surfaces.Ark. Mat.56(1), pp. 73-99.2018. ISSN 0004-2080.[doi][bib]
Gallet Matteo, Ranestad Kristian, Villamizar Nelly.Varieties of apolar subschemes of toric surfaces.Ark. Mat.56(1), pp. 73-99.2018. ISSN 0004-2080.[doi][bib]
Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret.Term-Graph Anti-Unification. In: 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Helene Kirchner (ed.), Leibniz International Proceedings in Informatics (LIPIcs)108, pp. 9:1-9:17.2018.Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,Dagstuhl, Germany,ISBN 978-3-95977-077-4 ISSN 1868-8969.[url][bib]
Berkovich A., Uncu A. K..On some polynomials and series of Bloch-Polya Type.PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY146(7), pp. 2827-2838.July2018.1088-6826.[url][bib]
Berkovich A., Uncu A. K..Some Elementary Partition Inequalities and Their Implications.ArXiv e-prints (to appear in Annals of Cobinatorics), pp. -.2018.Preprint.[url][bib]
Ali Kemal Uncu, Alexander Berkovich.Elementary Polynomial Identities Involving q-Trinomial Coefficients .ArXiv e-prints (submitted), pp. -.2018.N/A.[url][bib]
Jose Capco.Generalizing some Results in Field Theory for Rings.Communications in Algebra, pp. 0-12.2018.0092-7872.Preprint.[pdf][bib]
David M. Cerna, Temur Kutsia.Higher-Order Equational Pattern Anti-Unification. In: 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Helene Kirchner (ed.), Leibniz International Proceedings in Informatics (LIPIcs)108, pp. 12:1-12:17.2018.Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,Dagstuhl, Germany,ISBN 978-3-95977-077-4 ISSN 1868-8969.[url][bib]
Dominici Diego.Mehler-Heine type formulas for Charlier and Meixner polynomials II. Higher order terms.J. Class. Anal.12(1), pp. 9-13.2018. ISSN 1848-5979.[doi][bib]
Dominici Diego.Laguerre-Freud equations for generalized Hahn polynomials of type I.J. Difference Equ. Appl.24(6), pp. 916-940.2018. ISSN 1023-6198.[doi][bib]
Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat.Mechanical Synthesis of Sorting Algorithms for Binary Trees by Logic and Combinatorial Techniques.Journal of Symbolic Computation90, pp. 3-41.2018.Elsevier,07477171.[doi][bib]
Sandra Alves, Besik Dundua, Mário Florido, Temur Kutsia.Pattern-based calculi with finitary matching.Logic Journal of the IGPL26(2), pp. 203-243.2018.ISSN 1367-0751.[doi][bib]
Wolfgang Schreiner, Alexander Brunhuemer, Christoph Fürst.Teaching the Formalization of Mathematical Theories and Algorithms via the Automatic Checking of Finite Models. In: Post-Proceedings ThEdu'17, Pedro Quaresma and Walther Neuper (ed.), Proceedings of 6th International Workshop on Theorem proving components for Educational software (ThEdu'17), Gothenburg, Sweden, 6 Aug 2017, Electronic Proceedings in Theoretical Computer Science (EPTCS)267, pp. 120-139.2018.Open Publishing Association,ISSN 2075-2180.[doi][pdf][bib]
Gallet Matteo, Ranestad Kristian, Villamizar Nelly.Varieties of apolar subschemes of toric surfaces.Ark. Mat.56(1), pp. 73-99.2018. ISSN 0004-2080.[doi][bib]
Georg Grasegger, Alberto Lastra, J. Rafael Sendra, Franz Winkler.Rational General Solutions of Systems of First-Order Partial Differential Equations.Journal of Computational and Applied Mathematics331, pp. 88-103.2018.ISSN: 0377-0427.[bib]
G. Grasegger, A. Lastra, J.R. Sendra, F. Winkler.Rational general solutions of systems of first-order algebraic partial differential equations.J. Computational and Applied Mathematics(331), pp. 88-103.2018.ISSN 0377-0427.[pdf][bib]
N.T. Vo, G. Grasegger, F. Winkler.Deciding the existence of rational general solutions for first-order algebraic ODEs.Journal of Symbolic Computation(87), pp. 127-139.2018.ISSN 0747-7171.[pdf][bib]
Ralf Hemmecke.Dancing Samba with Ramanujan Partition Congruences.Journal of Symbolic Compuation84, pp. 14-24.2018.0747-7171.Also available as RISC Report 16-06 https://www.risc.jku.at/publications/download/risc_5338/DancingSambaRamanujan.pdf.[doi][bib]
Jiménez-Pastor Antonio, Pillwein Veronika.Algorithmic Arithmetics with DD-Finite Functions. In: Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, Arreche Carlos (ed.), ISSAC '18, pp. 231-237.2018.ACM,New York, NY, USA,ISBN 978-1-4503-5550-6.[doi][bib]
Ivan Gonzalez, Karen Kohl, Lin Jiu, and Victor H. Moll.The Method of Brackets in Experimental Mathematics. In: Frontiers in Orthogonal Polynomials and q-Series, Xin Li, Zuhair Nashed (ed.), pp. -.2018.World Scientific Publishing,978-981-3228-87-0.[url][bib]
Christoph Koutschan, Peter Paule.Holonomic Tools for Basic Hypergeometric Functions. In: Frontiers of Orthogonal Polynomials and q-Series, Xin Li, Zuhair Nashed (ed.), pp. 393-416.2018.World Scientific Publishing,ISBN 978-981-3228-87-0.[doi][pdf][bib]
E. Bartzos, I.Z. Emiris, J. Legerský, E. Tsigaridas.On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs. In: ISSAC '18 Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, C. Arreche (ed.), Proceedings of International Symposium on Symbolic and Algebraic Computation 2018, pp. 55-62.2018.978-1-4503-5550-6.[doi][bib]
J. Legerský.Minimal non-integer alphabets allowing parallel addition.Acta Polytechnica, Journal of Advanced Engineering58(5), pp. 285-291.2018.ISSN 1805-2363.[doi][bib]
A. Maletzky, F. Immler.Gröbner Bases of Modules and Faugère's F4 Algorithm in Isabelle/HOL. In: Intelligent Computer Mathematics (Proceedings of CICM 2018, Hagenberg, Austria, August 13-17), Florian Rabe and William Farmer and Grant Passmore and Abdou Youssef (ed.), Proceedings of CICM 2018, Lecture Notes in Computer Science11006, pp. 178-193.2018.Springer,ISBN 978-3-319-96811-7.The final publication is available at Springer via https://doi.org/10.1007/978-3-319-96812-4_16.[doi][bib]
S. McCallum, F. Winkler.Differential Resultants, in Recent Advances in Algebra, Numerical Analysis and Statistics. In: Proc. Internat. Conf. on Mathematics (ICM 2018), R. Bris et al. (ed.), Proceedings of ICM 2018, pp. 1-11.Dezember2018.Ton Duc Thang University (TDTU), Ho Chi Minh City, Vietnam,ISBN 978-2-7598-9058-3.[url][pdf][bib]
Temur Kutsia, Cleo Pau.Proximity-Based Generalization. In: 32nd International Workshop on Unification, UNIF 2018, Mauricio Ayala-Rincon and Philippe Balbiani (ed.), pp. - .2018.[pdf][bib]
Peter Paule, Cristian-Silviu Radu.Rogers-Ramanujan functions, modular functions, and computer algebra. In: Advances in Computer Algebra - In Honour of Sergei Abramov's 70th Birthday, C. Schneider, E. Zima. (ed.), Springer Proceedings in Mathematics & Statistics226, pp. 229-280.2018.Springer, Cham,978-3-319-73231-2.[doi][pdf][bib]
J. Ablinger, J. Blümlein, A. De Freitas, M. van Hoeij, E. Imamoglu, C.G. Raab, C.-S. Radu, C. Schneider.Iterated Elliptic and Hypergeometric Integrals for Feynman Diagrams.J. Math. Phys.59(062305), pp. 1-55.2018.ISSN 0022-2488.arXiv:1706.01299 [hep-th].[doi][pdf][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, E. Imamoglu, M. van Hoeij A. von Manteuffel, C.G. Raab, C.-S. Radu, C. Schneider.Iterative and Iterative-Noniterative Integral Solutions in 3-Loop Massive QCD Calculations. In: Proc. of the 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology), A. Hoang, C. Schneider (ed.)PoS (RADCOR2017) 069, pp. 1-13.2018.ISSN 1824-8039.arXiv:1711.09742 [hep-ph].[doi][bib]
Cristian-Silviu Radu.An algorithm to prove algebraic relations involving eta quotients.Annals of Combinatorics22, pp. 377-391.2018.Springer,0219-3094.[doi][pdf][bib]
A. Lin, M. Makhul, H. N. Mojarrad, J. Schicho, K. Swanepoel, F. de Zeeuw.On sets defining few ordinary circles.Discrete and Computational Geometry59, pp. 59-87.2018.0179-5376.[bib]
N. Lubbes, J. Schicho.Kinematic generation of Darboux cyclides.Comp. Aided Geom. Des.64, pp. -.2018.0167-8396.[bib]
Z. Li, J. Schicho, H.-P. Schröcker.Kempe's Universality Theorem for Rational Space Curves.Found. Comp. Math.18, pp. 509-536.2018.1615-3375.[bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Goedicke, C. Schneider, K. Schönwald.The Two-mass Contribution to the Three-Loop Gluonic Operator Matrix Element $A_{gg, Q}^{(3)}$.Nucl. Phys. B932, pp. 129-240.2018.ISSN 0550-3213.arXiv:1804.02226 [hep-ph].[doi][bib]
J. Middeke, C. Schneider.Denominator Bounds for Systems of Recurrence Equations using ΠΣ-Extensions. In: Advances in Computer Algebra. WWCA 2016., C. Schneider, E. Zima (ed.), Springer Proceedings in Mathematics & Statistics226, pp. 149-173.2018.Springer,ISSN 2194-1009.arXiv:1705.00280 [cs.SC].[doi][pdf][bib]
E.D. Ocansey, C. Schneider.Representing (q-)hypergeometric products and mixed versions in difference rings. In: Advances in Computer Algebra. WWCA 2016., C. Schneider, E. Zima (ed.), Springer Proceedings in Mathematics & Statistics226, pp. 175-213.2018.Springer,ISSN 2194-1009.arXiv:1705.01368 [cs.SC].[doi][pdf][bib]
J. Blümlein, M. Round, C. Schneider.Refined Holonomic Summation Algorithms in Particle Physics. In: Advances in Computer Algebra. WWCA 2016., E. Zima, C. Schneider (ed.), Springer Proceedings in Mathematics & Statistics 226, pp. 51-91.2018.Springer,ISSN 2194-1009.arXiv:1706.03677 [cs.SC].[doi][pdf][bib]
J. Ablinger, J. Blümlein, A. De Freitas, C. Schneider, K. Schönwald.The two-mass contribution to the three-loop pure singlet operator matrix element.Nucl. Phys. B(927), pp. 339-367.2018.ISSN 0550-3213.arXiv:1711.06717 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider.Heavy Flavor Wilson Coefficients in Deep-Inelastic Scattering: Recent Results. In: Proceedings of QCDEV2017, L. Gamberg, A. Prokudin, J.W. Qiu and A. Radyushkin (ed.)PoS(QCDEV2017)031 , pp. 1-10.2018.ISSN 1824-8039.arXiv:1711.07957 [hep-ph].[doi][bib]
J. Ablinger, C. Schneider.Algebraic independence of sequences generated by (cyclotomic) harmonic sums.Annals of Combinatorics22(2), pp. 213-244.2018.ISSN: 0218-0006.arXiv:1510.03692 [cs.SC].[doi][pdf][bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Goedicke, C. Schneider, K. Schönwald, F. Wißbrock.The massive 3-loop operator matrix elements with two masses and the generalized variable flavor number scheme. In: Proc. of the 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology), A. Hoang, C. Schneider (ed.)PoS (RADCOR2017) 071, pp. 1-20.2018.ISSN 1824-8039. arXiv:1712.00745 [hep-ph].[doi][bib]
Jakob Ablinger, Johannes Blümlein, Mark Round, Carsten Schneider.Special functions, transcendentals and their numerics. In: Proc. of the 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology), A. Hoang, C. Schneider (ed.)PoS (RADCOR2017) 010, pp. 1-7.2018.ISSN 1824-8039. arXiv:1712.08541 [hep-th].[doi][bib]
J. Ablinger, A. Behring, J. Bluemlein, G. Falcioni, A. De Freitas, P. Marquard, N. Rana, C. Schneider.The Heavy Quark Form Factors at Two Loops.Physical Review D97(094022), pp. 1-44.2018.ISSN 1550-2368.arXiv:1712.09889 [hep-ph].[doi][bib]
J. Blümlein, A. De Freitas, C. Schneider, K. Schönwald.The Variable Flavor Number Scheme at Next-to-Leading Order.Physics Letters B782, pp. 362-366.2018.ISSN: 0370-2693.arXiv:1804.03129 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider.Heavy Quark Form Factors at Three Loops in the Planar Limit.Physics Letters B782, pp. 528-532.2018.ISSN: 0370-2693.arXiv:1804.07313 [hep-ph].[doi][bib]
J. Blümlein, C. Schneider.Analytic Computing Methods for Precision Calculations in Quantum Field Theory.INTERNATIONAL JOURNAL OF MODERN PHYSICS A (IJMPA)33(1830015), pp. 1-35.2018.ISSN: 1793-656X.arXiv:1809.02889 [hep-ph].[doi][bib]
J. Blümlein, A. De Freitas, M. van Hoeij, E. Imamoglu, P. Marquard, C. Schneider.The ρ parameter at three loops and elliptic integrals. In: Proceedings of "Loops and Legs in Quantum Field Theory - LL 2018", 29 April - 4 May 2018, J. Blümlein, P. Marquard (ed.), PoS(LL2018)017, pp. 1-14.2018.ISSN 1824-8039.arXiv:1807.05287 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Goedicke, C. Schneider, K. Schönwald.Two-mass three-loop effects in deep-inelastic scattering. In: Proceedings of "Loops and Legs in Quantum Field Theory - LL 2018, J. Blümlein, P. Marquard (ed.), PoS(LL2018)051, pp. 1-8.2018.ISSN 1824-8039.arXiv:1807.07855 [hep-ph].[doi][bib]
Jakob Ablinger, Johannes Bluemlein, Peter Marquard, Narayan Rana, Carsten Schneider.Massive three loop form factors in the planar limit. In: Proceedings of "Loops and Legs in Quantum Field Theory - LL 2018, J. Blümlein, P. Marquard (ed.), PoS(LL2018)009, pp. 1-10.2018.ISSN 1824-8039.ISSN 1824-8039.[doi][bib]
J. Blümlein, C. Schneider.Computer algebra tools for Feynman integrals and related multi-sums. In: Proceedings of Loops and Legs in Quantum Field Theory - LL 2018, J. Blümlein, P. Marquard (ed.), PoS(LL2018)052, pp. 1-17.2018.ISSN 1824-8039.arXiv:1809.06168 [cs.SC].[doi][bib]
Johannes Middeke, Carsten Schneider.Towards a Direct Method for Finding Hypergeometric Solutions of Linear First Order Recurrence Systems.ACM Communications52(3), pp. 185-187.September2018.0000.Extended abstract of the poster presentation at 43st International Symposium on Symbolic and Algebraic Computation (ISSAC'18).[doi][pdf][bib]
Wolfgang Schreiner.Validating Mathematical Theories and Algorithms with RISCAL. In: Intelligent Computer Mathematics, F. Rabe, W. Farmer, G. Passmore, A. Youssef (ed.), Proceedings of CICM 2018, 11th Conference on Intelligent Computer Mathematics, Hagenberg, Austria, August 13-17, 2018, Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence11006, pp. 248-254.2018.Springer,Berlin,ISBN 978-3-319-96811-7.The final authenticated version is available online at Springer.[doi][pdf][bib]
Wolfgang Schreiner.Logic as a Path to Enlightenment (Work in Progress Report). In: Computer Mathematics in Education - Enlightenment or Incantation?, Walther Neuper (ed.), Proceedings of CME-EI18, Workshop at CICM 2018, 11th Conference on Intelligent Computer Mathematics, Hagenberg, Austria, August 17, 2018., pp. 1-5.August2018.CEUR Workshop Proceedings, Volume 2307, http://ceur-ws.org/Vol-2307/,ISSN 1613-0073.[url][pdf][bib]
Ramez Elbaroudy.A Gateway for the Generic Conversion of Protocols for Smart Meters and IoT Applications. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Master Thesis.July2018.[pdf][bib]
M. Schlenkrich.Das Shifting-Bottleneck Verfahren für das Job-Shop Scheduling-Problem. JKU Linz. Bachelor Thesis.September2018.[pdf][bib]
Lucas Payr.Formalization and Validation of Fundamental Sequence Algorithms by Computer-assisted Checking of Finite Models. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Bachelor Thesis.December2018.[pdf][bib]
Ali Kemal Uncu.On double sum generating functions in connection with some classical partition theorems .ArXiv e-prints, pp. 1-20.2018.N/A.[bib]
N.T. Vo, G. Grasegger, F. Winkler.Computation of all rational solutions of first-order algebraic ODEs.Advances in Applied Mathematics98, pp. 1-24.March2018.Elsevier,0196-8858.[doi][bib]
F. Winkler.Das Unendliche im mathemtischen Alltag. In: Beiträge des 41. Internationalen Wittgenstein Symposiums, G.M. Mras, P. Weingartner, B. Ritter (ed.), Proceedings of 41. Internationales Wittgenstein Symposium, pp. 285-287.August2018.ISSN 1022-3398.[pdf][bib]
2017
J. Ablinger.Discovering and Proving Infinite Binomial Sums Identities.Experimental Mathematics26(1), pp. 62-71.2017.ISSN 1058-6458.10.1080/10586458.2015.1116028.[url][bib]
J. Ablinger.Computing the Inverse Mellin Transform of Holonomic Sequences using Kovacic's Algorithm. In: Proc. of the 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology), A. Hoang and C. Schneider (ed.)PoS (RADCOR2017) 069, pp. 1-8.2017.ISSN 1824-8039.arXiv:1801.01039 [cs.SC].[url][bib]
Prabir Das Adhikary, Koustav Banerjee.An elementary alternative proof for Chan's analogue of Ramanujan's most beautiful identity and some inequality of the cubic partition.Notes on Number Theory and Discrete Mathematics23(1), pp. 77-87.2017.1310-5132 / 2367-8275.[url][pdf][bib]
Alexander Baumgartner, Temur Kutsia.Unranked Second-Order Anti-Unification.Information and Computation255(2), pp. 262-286.2017.ISSN: 0890-5401.[doi][bib]
Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret.Higher-Order Pattern Anti-Unification in Linear Time. Journal of Automated Reasoning58(2), pp. 293-310.2017.ISSN 0168-7433.[doi][bib]
Berkovich Alexander, Uncu Ali K..Variation on a theme of Nathan Fine. New weighted partition identities.J. Number Theory176, pp. 226-248.2017. ISSN 0022-314X.[doi][bib]
Bruno Buchberger.Gröbner Bases Computation by Triangularizing Macaulay Matrices.Advanced Studies in Pure Mathematics (The 50th Anniversary of Gröbner Bases)75, pp. 1-9.2017.Mathematical Society of Japan,0.[bib]
Abraham Erika , Abbott John , Becker Bernd , Bigatti Anna Maria , Brain Martin , Buchberger Bruno , Cimatti Alessandro , Davenport James , England Matthew , Fontaine Pascal , Forrest Stephen , Griggio Alberto , Kröning Daniel , Seiler Werner M. , Sturm .Satisfiability Checking and Symbolic Computation.ACM Communications in Computer Algebra50(4), pp. 145-147.2017.0.[bib]
David M. Cerna , Wolfgang Schreiner.Measuring the Gap: Algorithmic Approximation Bounds for the Space Complexity of Stream Specifications. In: Epic series in computer science, Mohamed Mosbah, Michaël Rusinowitch (eds). (ed.), Proceedings of SCSS 2017, 8th International Symposium on Symbolic Computation in Software Science, Epic45, pp. 1-15.April2017.Easy chair,ISSN 2398-7340.[url][pdf][bib]
David Cerna, Alexander Leitsch, Giselle Reis, Simon Wolfsteiner.Ceres in Intuitionistic Logic.Annals of Pure and Applied Logic, pp. 1783-1836.October2017.Elsevier, ISSN 0168-0072.[url][bib]
David M. Cerna and Michael Lettmann.Integrating a Global Induction Mechanism into a Sequent Calculus. In: TABLEAUX 2017, Renate A. Schmidt and Cl{\'{a}}udia Nalon (ed.), Proceedings of Tableaux, lecture notes in computer science, pp. 278-294.September2017.Springer,978-3-319-66901-4.[bib]
David M. Cerna and Michael Lettmann.Towards a Clausal Analysis of Proof Schemata. In: SYNASC 2017, Tudor Jebelean and Viorel Negru and Dana Petcu and Daniela Zaharie and Tetsuo Ida and Stephan Watt (ed.), IEEE Xplore, pp. 113-120.September2017.978-1-5386-2625-2.[bib]
Besik Dundua, Temur Kutsia, Klaus Reisenberger-Hagmayr.An overview of PρLog. In: Proceedings of the 19th International Symposium on Practical Aspects of Declarative Languages, PADL 2017, Y. Lierler and W. Taha (ed.), Lecture Notes in Computer Science10137, pp. 34-49.2017.Springer,ISBN 978-3-319-51675-2.[pdf][bib]
Mauricio Ayala-Rincon, Besik Dundua, Temur Kutsia, Mircea Marin.Rewriting Logic from a ρLog Point of View. In: Proceedings of the 12th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2017) , Sandra Alves and Renata Wasserman (ed.), pp. -.2017.[pdf][bib]
Sandra Alves, Besik Dundua, Mario Florido, Temur Kutsia.Pattern-Based Calculi with Finitary Matching.Logic Journal of the IGPL, pp. -.2017.Oxford University Press,ISSN 1367-0751.To appear.[doi][bib]
Christoph Fuerst, Alexander Levin.Relative Reduction and Buchberger’s Algorithm in Filtered Free Modules. In: Mathematics in Computer Science, W. Koepf (ed.), pp. 1-11.2017.1661-8289.[bib]
Georg Grasegger, N. Thieu Vo.An Algebraic-Geometric Method for Computing Zolotarev Polynomials. In: Proceedings of the 2017 international symposium on symbolic and algebraic computation (ISSAC), Burr, M. (ed.), pp. 173-180.2017.ACM Press,New York,ISBN: 978-1-4503-5064-8.[bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Hasselhuhn, C. Schneider, F. Wißbrock.Three Loop Massive Operator Matrix Elements and Asymptotic Wilson Coefficients with Two Different Masses.Nucl. Phys. B.921, pp. 585-688.2017.ISSN 0550-3213.arXiv:1705.07030 [hep-ph].[doi][bib]
E. Abraham, T. Jebelean.Adapting Cylindrical Algebraic Decomposition for Proof Specific Tasks. In: ICAI 2017: 10th International Conference on Applied Informatics, G. Kusper (ed.), Proceedings of ICAI 2017: 10th International Conference on Applied Informatics, pp. 0-0.2017.ISBN 0.In print.[url][pdf][bib]
Ivan Gonzalez, Karen Kohl, Lin Jiu, and Victor H. Moll.An extension of the method of brackets. Part 1.Open Mathematics (formerly Central European Journal of Mathematics)15, pp. 1181-1211.2017.2391-5455.[url][bib]
L. Jiu.Integral representations of equally positive integer-indexed harmonic sums at infinity.Research in Number Theory3(10), pp. 1-4.2017.2363-9555.[url][bib]
M. Gallet, C. Koutschan, Z. Li, G. Regensburger, J. Schicho, N. Villamizar.Planar linkages following a prescribed motion.Math. Comp.87, pp. 473-506.2017.ISSN: 1088-6842.[url][bib]
Jose Capco, Georg Grasegger, Matteo Gallet, Christoph Koutschan, Niels Lubbes, Josef Schicho.Computing the number of realizations of a Laman graph. In: Electronic Notes in Discrete Mathematics (Proceedings of Eurocomb 2017), Vadim Lozin (ed.), Proceedings of The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17)61, pp. 207-213.2017.ISSN 1571-0653.[url][bib]
Manfred Schmidt-Schauss, Temur Kutsia, Jordy Levy, Mateu Villaret.Nominal Unification of Higher Order Expressions with Recursive Let. In: Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, M. Hermenegildo and P. Lopez-Garcia (ed.), LNCS10184, pp. 328-344.2017.Springer,ISBN 978-3-319-63138-7.[pdf][bib]
Johannes Blömer, Ilias Kotsireas, Temur Kutsia, Dimitris E. Simos, editors.Mathematical Aspects of Computer and Information Sciences.Lecture Notes in Computer Science10693,2017.Springer,ISBN 978-3-319-72452-2.[doi][bib]
A. Maletzky, W. Windsteiger.The Formalization of Vickrey Auctions: A Comparison of Two Approaches in Isabelle and Theorema. In: Intelligent Computer Mathematics: 10th International Conference, CICM 2017, Edinburgh, UK, July 17-21, H. Geuvers, M. England, O. Hasan, F. Rabe, O. Teschke (ed.), Lecture Notes in Computer Science10383, pp. 25-39.2017.Springer,ISBN 978-3-319-62075-6.doi 10.1007/978-3-319-62075-6_3.[url][pdf][bib]
Johannes Middeke.Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, Michael Burr (ed.), Proceedings of International Symposium on Symbolic and Algebraic Computation, pp. 325-332.2017.978-1-4503-5064-8.[bib]
Jiayue Qi.The Group-theoretical Method of Matrix Multiplication. Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences. Master Thesis.2017.[url][bib]
M. Gallet, G. Nawratil, J. Schicho, J. Selig.Mobile Icosapods.Adv. Appl. Math.88, pp. 1-25.2017.ISSN: 0196-8858.[doi][bib]
U. Hertrich-Jeromin, B. Jüttler, J. Schicho.New developments in geometry. Theory and applications.Comp. Aided Geom. Des.47, pp. 1-2.2017.ISSN: 0167-8396.[doi][bib]
M. Gallet, G. Nawratil, J. Schicho.Liaison linkages.J. Symb. Comp.79, pp. 65-98.2017.ISSN: 0747-7171.[doi][bib]
C. Schneider.Summation Theory II: Characterizations of $RPiSigma$-extensions and algorithmic aspects.J. Symb. Comput.80(3), pp. 616-664.2017.ISSN 0747-7171.arXiv:1603.04285 [cs.SC].[doi][pdf][bib]
C. Schneider, R. Sulzgruber.Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm.Electron. J. Combin. 24(2), pp. 1-33.2017.ISSN: 1077-8926.#P2.28, arXiv:1606.07597.[doi][bib]
J. Blümlein, C. Schneider.The Method of Arbitrarily Large Moments to Calculate Single Scale Processes in Quantum Field Theory.Physics Letters B771, pp. 31-36.2017.ISSN 0370-2693.arXiv:1701.04614 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider.The Three-Loop Splitting Functions $P_{qg}^{(2)}$ and $P_{gg}^{(2, \rm N_F)}$.Nucl. Phys. B.922, pp. 1-40.2017.ISSN 0550-3213..arXiv:1705.01508 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, G. Falcioni, A. De Freitas, P. Marquard, N. Rana, C. Schneider.Heavy quark form factors at two loops in perturbative QCD.ACTA PHYSICA POLONICA B48(12), pp. 2155-2166.2017. ISSN 0587-4254.Presented at the XLI International Conference of Theoretical Physics “Matter to the Deepest”, Podlesice, Poland, September 3–8, 2017, arXiv:1711.04880 [hep-ph].[doi][bib]
Ovidiu Constantin Novac, Tamás Bérczes, Attila Kuki, Ádám Tóth, Wolfgang Schreiner.Modeling RF-Based Sensor Networks by Using Dual-Source Retrial Queueing Systems. In: ICEMES 2017, 14th International Conference on Engineering of Modern Electric Systems, Oradea, Romania, June 1–2, 2017, Mircea Gordan, Teodor Leuca, Florin Constantinescu (ed.), pp. 149-153.2017.IEEE Xplore,ISBN 978-1-5090-6073-3.[doi][bib]
Manfred Droste, Temur Kutsia, George Rahonis, Wolfgang Schreiner.MK-fuzzy Automata and MSO Logics. In: 8th Symposium on Games, Automata, Logics and Formal Verification (GandALF’17), P. Bouyer, A. Orlandini, P. San Pietro (ed.), Electronic Proceedings in Theoretical Computer Science (EPTCS)256, pp. 106-120.September2017.Rome, Italy, September 22-27,ISSN 2075-2180.[pdf][bib]
C. Ilonka.An Online Auction System for Selling Fiber Products. ISI Hagenberg, JKU Linz. Master Thesis.July2017.[pdf][bib]
Alexander Brunhuemer.Validating the Formalization of Theories and Algorithms of Discrete Mathematics by the Computer-Supported Checking of Finite Models. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Bachelor Thesis.September2017.[pdf][bib]
Uncu Ali Kemal.Weighted Rogers-Ramanujan partitions and Dyson crank.The Ramanujan Journal, pp. -.May2017. ISSN 1572-9303.[doi][bib]
W. Windsteiger.Theorema 2.0: A Brief Tutorial. In: Proceedings of SYNASC 2017, Tudor Jebelean and Daniela Zaharie (ed.), Proceedings of SYNASC 2017, IEEE Explore, pp. 1-3.2017.ISBN 978-1-5386-2626-9.[doi][pdf][bib]
xinhua xiong.Overpartitions and ternary quadratic forms.The Ramanujan Journal42(2), pp. 429-442.2017.issn:1382-4090.[bib]
Liangjie Ye.Elliptic Function Based Algorithms to Prove Jacobi Theta Function Relations.Journal of Symbolic Computation, to appear, pp. 1-25.2017.-.[pdf][bib]
Liangjie Ye.A Symbolic Decision Procedure for Relations Arising among Taylor Coefficients of Classical Jacobi Theta Functions.Journal of Symbolic Computation 82, pp. 134-163.2017.ISSN: 0747-7171.[pdf][bib]
Liangjie Ye.Complex Analysis Based Computer Algebra Algorithms for Proving Jacobi Theta Function Identities. RISC and the DK program Linz. PhD Thesis.2017.Updated version in June 2017.[pdf][bib]
2016
J. Ablinger.Inverse Mellin Transform of Holonomic Sequences. In: Proc. Loops and Legs in Quantum Field Theory - LL 2016, J. Bluemlein and P. Marquard and T. Riemann (ed.), Proc. of SciencesPoS (LL2016) 067, pp. -.2016.ISSN 1824-8039.arXiv:1606.02845 [cs.SC].[url][bib]
Wolfgang Schreiner, David Cerna, Temur Kutsia, Michael Krieger, Bashar Ahmad, Helmut Otto, Martin Rummerstorfer, Thomas Gössl.Practical Event Monitoring in the LogicGuard Framework. In: embedded world Conference 2016, February 23-25 2016, Nürnberg, Germany, Matthias Sturm et al. (ed.), pp. -.February2016.Design & Elektronik,Haar, Germany,ISBN 978-3-645-50159-0.[pdf][bib]
Koustav Banerjee, Atul Dixit.New Representations for $sigma(q)$ via Reciprocity Theorems. In: Analytic Number Theory, Modular Forms and q- Hypergeometric Series, George Andrews, Frank Garvan (ed.), pp. 39-57.2016.978-3-319-68376-8.[url][bib]
Berkovich Alexander, Uncu Ali Kemal.On partitions with fixed number of even-indexed and odd-indexed odd parts.J. Number Theory167, pp. 7-30.2016. ISSN 0022-314X.[doi][bib]
Berkovich A., Kemal Uncu A..New Weighted Partition Theorems with the Emphasis on the Smallest Part of Partitions.ALLADI60 2016: Analytic Number Theory, Modular Forms and q-Hypergeometric Series , pp. -.2016.978-3-319-68375-1.[url][bib]
Bruno Buchberger.Stam's Identities Collection: A Case Study for Math Knowledge Bases. In: Mathematical Software - ICMS 2016: 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings, Gert-Martin Greuel, Thorsten Koch, Peter Paule and Andrew Sommese (ed.), pp. 437-442.2016.Springer International Publishing,Cham,978-3-319-42432-3.[doi][pdf][bib]
Bruno Buchberger.The GDML and EuKIM Projects: Short Report on the Initiative. In: Mathematical Software - ICMS 2016: 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings, Gert-Martin Greuel, Thorsten Koch, Peter Paule and Andrew Sommese (ed.), pp. 443-446.2016.Springer International Publishing,Cham,978-3-319-42432-3.[doi][pdf][bib]
Erika Abraham, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, and Thomas Sturm.Satisfiability Checking meets Symbolic Computation (Project Paper).CoRRabs/1607.08028, pp. -.2016.-.[url][pdf][bib]
David M. Cerna, Wolfgang Schreiner, and Temur Kutsia.Space Analysis of a Predicate Logic Fragment for the Specification of Stream Monitors. In: SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science, James H. Davenport and Fadoua Ghourabi (ed.), Proceedings of The 7th International Symposium on Symbolic Computation in Software Science, EPiC Series in Computing39, pp. 29-41.2016.EasyChair,ISSN 2040-557X.[url][pdf][bib]
David M. Cerna and Alexander Leitsch.Schematic Cut Elimination and the Ordered Pigeonhole Principle. In: Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings, Nicola Olivetti and Ashish Tiwari (ed.), Proceedings of IJCAR, Lecture Notes in Computer Science9706, pp. 241-256.June2016.Springer,RISC Institute,0302-9743.[doi][bib]
David M. Cerna and Wolfgang Schreiner, Temur Kutsia.Predicting Space Requirements for a Stream Monitor Specification Language. In: Runtime Verification - 16th International Conference, RV 2016, Madrid, Spain, September 23-30, 2016, Proceedings, Yliès Falcone and César Sánchez (ed.), Proceedings of Runtime Verification, pp. 135-151.September2016.Springer International Publishing,978-3-319-46981-2.[doi][pdf][bib]
Dominici Diego.Polynomial sequences associated with the moments of hypergeometric weights.SIGMA Symmetry Integrability Geom. Methods Appl.12, pp. Paper No. 044, 18-P.2016.1815-0659.[doi][bib]
Dominici Diego.Mehler-Heine type formulas for Charlier and Meixner polynomials.Ramanujan J.39(2), pp. 271-289.2016. ISSN 1382-4090.[doi][bib]
Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat.Proof-based Synthesis of Sorting Algorithms for Trees. In: Proceedings of LATA 2016, the 10th International Conference on Language and Automata Theory and Applications, Adrian-Horia Dediu, Jan Janousek, Carlos Martin-Vide, Bianca Truthe (ed.), Proceedings of LATA 2016, LNCS9618, pp. 562-575.2016.Springer,ISBN 978-3-319-29999-0.[bib]
Isabela Dramnesc and Tudor Jebelean, Sorin Stratulat.A case study on algorithm discovery from proofs: The insert function on binary trees. In: 11th IEEE International Symposium on Applied Computational Intelligence and Informatics, SACI 2016, Timisoara, Romania, May 12-14, 2016, IEEE (ed.), pp. 231-236.2016.978-1-5090-2380-6.[doi][bib]
Besik Dundua, Mario Florido, Temur Kutsia, Mircea Marin.CLP(H): Constraint Logic Programming for Hedges.Theory and Practice of Logic Programming16(2), pp. 141-162.2016.ISSN 1471-0684.[url][bib]
Mircea Marin, Temur Kutsia, Besik Dundua.A rewrite-based computational model for functional logic programming. In: Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, SCSS 2016, James H. Davenport (ed.), EPiC Series in Computing39, pp. 95-106.2016.EasyChair,ISSN 2398-7340.[url][bib]
B. Dundua, T. Kutsia, K. Reisenberger-Hagmayr.PρLog: Combining Logic Programming with Conditional Transformation Systems (Tool Description). In: Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016, M. Carro, A. King, N. Saeedloei, and M. De Vos (ed.), OpenAccess Series in Informatics (OASIcs)52, pp. 10.1-10.5.2016.Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,ISBN 978-3-95977-007-1, ISSN 2190-6807.[url][bib]
Christoph Fuerst.Axiomatic Description of Gröbner Reduction. RISC, JKU Linz. PhD Thesis.December2016.[pdf][bib]
Matteo Gallet.Algebraic Geometry methods in Kinematics: Mobile Pods. Johannes Kepler University. PhD Thesis.October2016.[bib]
G. Grasegger, A. Lastra, J.R. Sendra, F. Winkler.A solution method for autonomous first-order algebraic partial differential equations.Journal of Computational and Applied Mathematics300, pp. 119-133.2016.0377-0427.[doi][bib]
G. Grasegger, N.T. Vo, F. Winkler.A decision algorithm for rational general solutions of first-order algebraic ODEs. In: Proceedings XV Encuentro de Algebra Computacional y Aplicaciones (EACA 2016), Universidad de la Rioja, J. Heras and A. Romero (eds.) (ed.), pp. 101-104.2016.978-84-608-9024-9.[bib]
J. Ablinger, J. Behring, J. Blümlein, G. Falcioni, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider, F. Wissbrock.New Results on Massive 3-Loop Wilson Coefficients in Deep-Inelastic Scattering. In: Proc. Loops and Legs in Quantum Field Theory - LL 2016, J. Bluemlein and P. Marquard and T. Riemann (ed.), Proc. of SciencesPoS (LL2016) 065, pp. 1-16.2016.ISSN 1824-8039.arXiv:1609.03397 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, C.G. Raab, M. Round, C. Schneider, F. Wißbrock.3-Loop Corrections to the Heavy Flavor Wilson Coefficients in Deep-Inelastic Scattering. In: Proceedings of the European Physical Society Conference on High Energy Physics (EPS-HEP), PoS(EPS-HEP2015)504, pp. 1-13.2016.ISSN 1824-8039.arXiv:1602.00583 [hep-ph].[doi][bib]
Jakob Ablinger, Arnd Behring, Johannes Blümlein, Abilio De Freitas, Alexander Hasselhuhn, Andreas von Manteuffel, Mark Round, Carsten Schneider, Fabian Wißbrock.Heavy flavour corrections to polarised and unpolarised deep-inelastic scattering at 3-loop order. In: Proceedings of the QCD Evolution 2016, PoS(QCDEV2016)052, pp. 1-16.2016.National Institute for Subatomic Physics (Nikhef) in Amsterdam,ISSN 1824-8039.arXiv:1611.01104 [hep-ph].[doi][bib]
Manuel Kauers, Peter Paule, Greg Reid.Workshop on Symbolic Combinatorics and Algorithmic Differential Algebra.ACM Communications in Computer Algebra50(Issue 1), pp. 27-34.March2016.1932-2240.[pdf][bib]
Boris Konev, Temur Kutsia.Anti-Unification of Concepts in Description Logic EL. In: Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016, Chitta Baral, James P. Delgrande, Frank Wolter (ed.), pp. 227-236.April 25-292016.AAAI Press,Cape Town, South Africa,978-1-57735-755-1.[url][bib]
Brandt Kronholm, Felix Breuer.A Polyhedral Model of Partitions with Bounded Differences and a Bijective Proof of a Theorem of Andrews, Beck, and Robbins.Research in Number Theory, pp. 1-15.March2016.Springer,2363-9555.[bib]
Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger.Theorema 2.0: Computer-Assisted Natural-Style Mathematics.JFR9(1), pp. 149-185.2016.ISSN 1972-5787.[doi][bib]
A. Maletzky.Mathematical Theory Exploration in Theorema: Reduction Rings. In: Intelligent Computer Mathematics (Proceedings of CICM 2016, Bialystok, Poland, July 25-29), Michael Kohlhase, Moa Johansson, Bruce Miller, Leonardo de Moura, Frank Tompa (ed.), Proceedings of CICM 2016, Lecture Notes in Artificial Intelligence9791, pp. 3-17.July2016.Springer-Verlag,ISBN 978-3-319-42546-7.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-42547-4_1. Preprint on arXiv: 1602.04339 [cs.SC].[doi][bib]
A. Maletzky.Interactive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0. In: Mathematical Software - ICMS 2016, Gert-Martin Greuel and Peter Paule and Andrew Sommese (ed.), Proceedings of 5th International Congress on Mathematical Software, Berlin, Germany, July 11-14, Lecture Notes in Computer Science9725, pp. 59-66.2016.Springer-Verlag,ISBN 978-3-319-42432-3.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-42432-3_8.[doi][pdf][bib]
A. Maletzky.Computer-Assisted Exploration of Gröbner Bases Theory in Theorema. RISC, Johannes Kepler University Linz. PhD Thesis.May2016.[bib]
Peter Paule, Cristian-Silviu Radu.A new witness identity for $11|p(11n+6)$. In: Analytic Number Theory, Modular Forms and q-Hypergeometric Series, George E. Andrews, Frank Garvan (ed.), pp. 625-640.2016.Springer, 2194-1009.[pdf][bib]
Peter Paule, Silviu Radu.Partition analysis, modular functions, and computer algebra. In: Recent Trends in Combinatorics, IMA Volume, A. Beveridge, J. R. Griggs, L. Hogben, G. Musiker, P. Tetali (ed.), The IMA Volumes in Mathematics and its Applications159, pp. 511-543.2016.Springer, Cham,978-3-319-24296-5.[doi][pdf][bib]
A. Dixit, V.H. Moll, V. Pillwein.A hypergeometric inequality.Annals of Combinatorics20(1), pp. 65-72.2016.0218-0006.[pdf][bib]
Christoph Koutschan and Martin Neumüller and Cristian-Silviu Radu.Inverse inequality estimates with symbolic computation.Advances in Applied Mathematics80, pp. 1-23.2016.0196-8858.[doi][pdf][bib]
Zijia Li, , J. Schicho, Hans-Peter Schröcker.The rational motion of minimal dual quaternion degree with prescribed trajectory.Comp. Aided Geom. Des.41, pp. 1-9.2016.ISSN: 0167-8396.[doi][bib]
Zijia Li , Josef Schicho, Hans-Peter Schröcker.A survey on the theory of bonds.IMA Journal of Mathematical Control and Information, pp. -.2016.ISSN: 1471-6887.online.[doi][bib]
G. Nawratil, J. Schicho.Duporcq pentapods.J. Mechanisms Robotics9, pp. -.2016.ISSN: 1942-4302.[url][bib]
C. Schneider.A Difference Ring Theory for Symbolic Summation.J. Symb. Comput.72, pp. 82-127.2016.ISSN 0747-7171. arXiv:1408.2776 [cs.SC].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider.Calculating Three Loop Ladder and V-Topologies for Massive Operator Matrix Elements by Computer Algebra.Comput. Phys. Comm.202, pp. 33-112.2016.ISSN 0010-4655.arXiv:1509.08324 [hep-ph].[doi][pdf][bib]
C. Schneider.Symbolic Summation in Difference Rings and Applications. In: Proc. ISSAC 2016, M. Rosenkranz (ed.), pp. 9-12.2016.ISBN 978-1-4503-4380-0/16/07.[doi][pdf][bib]
E.D. Ocansey, C. Schneider.Representation of hypergeometric products in difference rings.ACM Communications in Computer Algebra50(4), pp. 161-163.2016.ISSN 1932-2240 .Extended abstract of the poster presentation at ISSAC 2016.[doi][pdf][bib]
J. Middeke, C. Schneider.Denominator Bounds for Higher Order Systems of Linear Recurrence Equations.ACM Communications in Computer Algebra50(4), pp. 185-187.2016.ISSN 1932-2240.Extended abstract of the poster presentation at ISSAC 2016.[doi][pdf][pdf][bib]
J. Ablinger, A. Behring, J. Bluemlein, A. de Freitas, C. Schneider.Algorithms to solve coupled systems of differential equations in terms of power series. In: Proc. Loops and Legs in Quantum Field Theory - LL 2016, J. Bluemlein, P. Marquard, T. Riemann (ed.) (ed.)PoS(LL2016)005, pp. 1-15.2016.ISSN 1824-8039.arXiv:1608.05376 [cs.SC].[doi][bib]
A. Behring, J. Blümlein, G. Falcioni, A. De Freitas, A. von Manteuffel, C. Schneider.The Asymptotic 3-Loop Heavy Flavor Corrections to the Charged Current Structure Functions $F_L^{W^+-W^-}(x, Q^2)$ and $F_2^{W^+-W^-}(x, Q^2)$.Physical Review D94(11), pp. 1-19.2016.ISSN 1550-2368.arXiv:1609.06255 [hep-ph].[doi][pdf][bib]
Jakob Ablinger, Johannes Bluemlein, Abilio de Freitas, Carsten Schneider.A toolbox to solve coupled systems of differential and difference equations. In: Proc. of the 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology), Nigel Glover, Daniel Maitre, Ben Pecjak (ed.)PoS(RADCOR2015)060, pp. 1-13.2016.ISSN 1824-8039.arXiv:1601.01856 [cs.SC].[doi][bib]
Adam Toth, Tamas Berczes, Attila Kuki, Bela Almasi, Wolfgang Schreiner, Jinting Wang, Fang Wang.Analysis of Finite-Source Cluster Networks.Creative Mathematics and Informatics25(2), pp. 223-235.2016.SINUS Association,ISSN 1584 - 286X.[bib]
David M. Cerna and Wolfgang Schreiner, Temur Kutsia.Predicting Space Requirements for a Stream Monitor Specification Language. In: Runtime Verification - 16th International Conference, RV 2016, Madrid, Spain, September 23-30, 2016, Proceedings, Yli{\`{e}}s Falcone and C{\'{e}}sar S{\'{a}}nchez (ed.), pp. 135-151.2016.978-3-319-46981-2.[doi][bib]
David M. Cerna and Wolfgang Schreiner and Temur Kutsia.Predicting Space Requirements for a Stream Monitor Specification Language. In: Runtime Verification - 16th International Conference, {RV} 2016, Madrid, Spain, September 23-30, 2016, Proceedings, Yli{\`{e}}s Falcone and C{\'{e}}sar S{\'{a}}nchez (ed.), pp. 135-151.2016.978-3-319-46981-2.[bib]
Daniela Ritirc.Formally Modeling and Analyzing Mathematical Algorithms with Software Specification Languages & Tools. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Master Thesis.January2016.[pdf][bib]
N. Thieu Vo.Rational and Algebraic Solutions of First-Order Algebraic ODEs. Research Institute for Symbolic Computation. PhD Thesis.2016.[pdf][bib]
Xinhua Xiong.Overpartition function modulo 16 and some binary quadratic forms.International Journal of Number Theory12(5), pp. 1195-1208.2016.ISSN 1793-0421.[bib]
Xinhua Xiong.A positivity conjecture related first positive rank and crank moments for overpartitions. Proc. Japan Acad. Ser. A: Math. Sci., 92 (2016), no. 11,, pp. 117-120.2016.ISSN .[url][bib]
Xinhua Xiong.Small Values of Coefficients of a Half Lerch Sum.arXiv:1605.09508, submitted to journal., pp. 1-10.2016.ISSN.[bib]
Xinhua Xiong.Euler's partition theorem for all moduli and new companions to Rogers-Ramanujan-Andrews-Gordon identities.arXiv:1607.07583, submitted to journal., pp. 1-26.2016.[bib]
2015
Wolfgang Schreiner, Temur Kutsia, Michael Krieger, Bashar Ahmad, Helmut Otto, Martin Rummerstorfer.Securing Device Communication by Predicate Logic Specifications. In: embedded world Conference 2015, February 24-26 2015, Nürnberg, Germany, Matthias Sturm et al. (ed.), pp. -.February2015.Design&Elektronik,Haar, Germany,ISBN 978-3-645-50144-6.[pdf][bib]
Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret.Nominal Anti-Unification. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications, RTA'15, Maribel Fernandez (ed.), Leibniz International Proceedings in Informatics (LIPIcs), pp. 57-73.2015.ISSN 1868-8969.[pdf][bib]
Alexander Baumgartner.Anti-Unification Algorithms: Design, Analysis, and Implementation. RISC, JKU Linz. PhD Thesis.September2015.[pdf][bib]
Berkovich Alexander, Uncu Ali Kemal.A new companion to Capparelli's identities.Adv. in Appl. Math.71, pp. 125-137.2015. ISSN 0196-8858.[doi][bib]
F. Breuer.An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics. In: Computer Algebra and Polynomials, J. Gutierrez, J. Schicho, M. Weimann (ed.), Lecture Notes in Computer Science8942, pp. 1-29.2015.978-3-319-15080-2.[url][bib]
J. Blümlein, A. De Freitas, C. Schneider.Higher Order Heavy Quark Corrections to Deep-Inelastic Scattering. In: Advances in Computational Particle Physics, J. Blümlein, K. Jansen, M. Krämer, J.H. Kühn (ed.), Proceedings of Final Meeting of DFG SFB-TR-9, Nucl. Phys. B (Proc. Suppl.), pp. 185-201.2015.ISSN 0550-3213.arXiv:1411.5669 [hep-ph].[doi][pdf][bib]
Élie de Panafieu.Phase Transition of Random Non-Uniform Hypergraphs.Journal of Discrete Algorithms, pp. ?-?.2015.????.[pdf][bib]
Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat.Theory Exploration of Binary Trees. In: The IEEE 13th Jubilee International Symposium on Intelligent Systems and Informatics, . (ed.), Proceedings of SISY 2015, pp. 139-144.2015.IEEE Xplore,..[bib]
Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat.Combinatorial Techniques for Proof-based Synthesis of Sorting Algorithms. In: SYNASC 2015: Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Laura Kovacs (ed.), pp. 137-144.2015.IEEE Computer Society,ISBN 978-0-7695-5742-2.[bib]
Isabela Dramnesc, Tudor Jebelean.Synthesis of list algorithms by mechanical proving.Journal of Symbolic Computation69, pp. 61-92.2015.ISSN 0747-7171.[bib]
Isabela Dramnesc, Tudor Jebelean.A Case Study in Proof Based Synthesis of Algorithms on Monotone Lists. In: The 10th International Symposium on Applied Computational Intelligence and Informatics, . (ed.), Proceedings of SACI 2015, pp. 483-488.2015.IEEE Xplore,_.[bib]
Besik Dundua, Mario Florido, Temur Kutsia.Lambda Calculus with Regular Types. In: Proceeding of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, , pp. -.2015.To appear.[pdf][bib]
Christoph Fuerst, Guenter Landsmann.Computation of Dimension in Filtered Free Modules by Gröbner Reduction. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ACM (ed.), Proceedings of ISSAC '15, pp. 181-188.2015.978-1-4503-3435-8.[doi][bib]
G. Grasegger, F. Winkler.Symbolic Solutions of First-Order Algebraic ODEs. In: Computer algebra and polynomials, J. Gutierrez, J. Schicho, M. Weimann (ed.), Lecture Notes in Computer Science8942, pp. 94-104.2015.Springer International Publishing,ISSN 0302-9743.[doi][bib]
Georg Grasegger.Symbolic solutions of first-order algebraic differential equations. Johannes Kepler University Linz. PhD Thesis.062015.[url][bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider.3-loop Massive $O(T_F^2)$ Contributions to the DIS Operator Matrix Element $A_{gg}$. In: 17th International Conference in Quantum Chromodynamics (QCD 14), Stephan Narison (ed.), Proceedings of QCD Montpellier Conference, Nucl. Phys. B (Proc. Suppl.)258-259, pp. 37-40.2015.ISSN 0550-3213.arXiv:1409.1435 [hep-ph].[doi][pdf][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, C. Raab, M. Round, S. Schneider, F. Wißbrock.3-loop heavy flavor Wilson coefficients in deep-inelastic scattering. In: 17th International Conference in Quantum Chromodynamics (QCD 14), Stephan Narison (ed.), Nucl. Phys. B (Proc. Suppl.)258-259, pp. 41-44.2015.ISSN 0550-3213. arXiv:1409.1804 [hep-ph].[doi][pdf][bib]
A. Behring, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, C. Schneider.The O(alpha_s^3) Heavy Flavor Contributions to the Charged Current Structure Function xF_3(x, Q^2) at Large Momentum Transfer.Physical Review D92(114005), pp. 1-19.2015.ISSN 1550-2368.arXiv:1508.01449 [hep-ph].[doi][pdf][bib]
Ilias Kotsireas, Temur Kutsia, Dimitris E. Simos.Constructing Orthogonal Designs in Powers of Two: Groebner Bases Meet Equational Unification. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications, RTA'15, Maribel Fernandez (ed.), Leibniz International Proceedings in Informatics (LIPIcs), pp. 241-256.2015.Schloss Dagstuhl,ISSN 1868-8969.[pdf][bib]
Franz Lichtenberger.Making Formal Methods Popular: The Crux is Math Education!. In: Formal Methods in Software Engineering Education Teaching and Training, Andreas Bollin, Tiziana Margaria, Isabelle Perseil (ed.), Proceedings of 1st Workshop on Formal Methods in Software Engeneering Education and Training - FMSEET'15, CEUR Workshop Proceedings1385, pp. 27-34.June2015.Sun SITE Central Europe,RWTH Aachen,ISSN 1613-0073.[url][pdf][bib]
A. Maletzky.Automated Reasoning in Reduction Rings using the Theorema System. In: Computer Algebra in Scientific Computing, Vladimir P. Gerdt and Wolfram Koepf and Werner M. Seiler and Evgenii V. Vorozhtsov (ed.), Proceedings of CASC 2015 (September 14-18, Aachen, Germany), LNCS9301, pp. 305-319.2015.Springer-Verlag Berlin Heidelberg,ISSN 0302-9743.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-24021-3_23.[doi][pdf][bib]
A. Maletzky.Verifying Buchberger's Algorithm in Reduction Rings. In: Proceedings of the 4th International Seminar on Program Verification, Automated Debugging, and Symbolic Computation, Tudor Jebelean and Dongming Wang (ed.), Proceedings of PAS'2015, Beijing, China, October 21-23, pp. 16-23.October2015.??.arXiv:1604.08736 [cs.SC].[url][bib]
Temur Kutsia, Mircea Marin.Regular Expression Order-Sorted Unification and Matching.Journal of Symbolic Computation67, pp. 42-67.2015.ISSN 0747-7171.[doi][pdf][bib]
G. Nikolov, V. Pillwein.An extension of Turan's inequality for ultraspherical polynomials.Mathematical Inequalities & Applications18(1), pp. 321-335.2015.[pdf][bib]
A. Alexandrov, H. Dietert, G. Nikolov, V. Pillwein.Proof of a conjecture of M. Patrick concerning Jacobi polynomials .Journal of Mathematical Analysis and Applications428(2), pp. 750-761.2015.[bib]
V. Pillwein.Symbolic Computation and Finite Element Methods.. In: CASC 2015, V.P. Gerdt, W. Koepf, W.M. Seiler, and E.V. Vorozhtsov (ed.), LNCS9301, pp. 374-388.2015.Springer-Verlag Berlin Heidelberg,0302-9743.[pdf][bib]
Cristian-Silviu Radu.A note on a problem proposed by Kim and Lisonek. In: Computer Algebra and Polynomials, J. Gutierrez, J. Schicho, M. Weimann (ed.), Lecture notes in Computer Science8942, pp. 151-156.2015.Springer, Cham, 978-3-319-15080-2.[doi][bib]
CRISTIAN-SILVIU RADU.An algorithmic approach to Ramanujan-Kolberg identities.Journal of Symbolic Computation68(1), pp. 225-253.2015.0747-7171.[doi][pdf][bib]
H. Rahkooy.Dual Space Algorithms for Computing Multiplicity Structure of Isolated Points. RISC, JKU Linz. PhD Thesis.July2015.[bib]
Josef Schicho, Matteo Gallet.Ambiguities in a Problem in Planar Geodesy.SIGMA(008), pp. 1-13.2015.1815-0659.[url][bib]
G. Hegedüs, Z. Li, J. Schicho, H.-P. Schroecker.The theory of bonds II: closed 6R linkages with maximal genus.J. Symb. Comp.68, pp. 167-180.2015.0747-7171.[bib]
H. Ahmadinezhad, Z. Li, J. Schicho.An algebraic study of linkages with helical joints.J. Pure and Appl. Algebra219, pp. 2245-2259.2015.0022-4049.[bib]
G. Nawratil, J. Schicho.Pentapods with Mobility 2.ASME Journnal of Mechanasms and RoboticsJ. Mechanisms Robotics, pp. -.2015.1942-4302.[bib]
Z. Li, J. Schicho.A technique for deriving equational conditions on the Denavit-Hartenberg parameters of a 6R linkage that are necessary for movability.Mech. Mach. Theory94, pp. 1-8.2015.0094-114X.[bib]
Z. Li, J. Schicho, H.-P. Schroecker.Spatial straight-line linkages by factorization of motion polynomials.J. Mechanisms Robotics, pp. -.2015.1942-4302.[bib]
Z. Li, , J. Schicho, H.-P. Schroecker.7R Darboux Linkages by Factorication of Motion Polynomials. In: Proc. IFToMM 14, S.-H. Chang et al (ed.), pp. 841-847.2015.978-986-04-6098-8.[bib]
Z. Li, , T. Rad, J. Schicho, H.-P. Schroecker.Factorization of Rational Motions: A Survey with Examples and Applications. In: Proc. IFToMM 14, S.-H. Chang et al. (ed.), pp. 833-840.2015.ISBN 978-986-04-6098-8.[bib]
C. Schneider.Fast Algorithms for Refined Parameterized Telescoping in Difference Fields. In: Computer Algebra and Polynomials, Applications of Algebra and Number Theory, Jaime Gutierrez, Josef Schicho, Martin Weimann (ed.), Lecture Notes in Computer Science (LNCS)8942, pp. 157-191.2015.Springer,ISSN: 0302-9743 .arXiv:1307.7887 [cs.SC].[doi][pdf][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider.The 3-Loop Pure Singlet Heavy Flavor Contributions to the Structure Function $F_2(x, Q^2)$ and the Anomalous Dimension.Nuclear Physics B890, pp. 48-151.2015.ISSN 0550-3213.arXiv:1409.1135 [hep-ph].[doi][bib]
A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider.The 3-Loop Non-Singlet Heavy Flavor Contributions to the Structure Function g_1(x, Q^2) at Large Momentum Transfer.Nucl. Phys. B897, pp. 612-644.2015.ISSN 0550-3213..arXiv:1504.08217 [hep-ph].[doi][bib]
V. Pillwein, M. Schussler.An efficient procedure deciding positivity for a class of holonomic sequences.ACM Communications in Computer Algebra49(3), pp. 90-93.2015.Extended abstract of the poster presentation at ISSAC 2015.[pdf][bib]
A. Lastra, J.R. Sendra, L.X.C. Ngô, F. Winkler.Rational general solutions of systems of autonomous ordinary differential equations of algebro-geometric dimension one.Publ.Math.Debrecen(86/1-2), pp. 49-69.2015.0033-3883.[bib]
L.X.C. Ngô, J.R. Sendra, F. Winkler.Birational transformations preserving rational solutions of algebraic ordinary differential equations.J. Computational and Applied Mathematics(286), pp. 114-127.2015.0377-0427.[bib]
W.Y.C.Chen, D.D.M.Sang and Diane Y.H. Shi.An overpartition analogue of Bressoud’s theorem of Rogers-Ramanujan type.The Ramanujan Journal36(1), pp. 69-80.2015.1382-4090.[bib]
N. T. Vo, F. Winkler.Algebraic General Solutions of First Order Algebraic ODEs. In: Computer Algebra in Scientific Computing, Vladimir P. Gerdt et. al. (ed.), Lecture Notes in Computer Science9301, pp. 479-492.2015.Springer International Publishing,ISSN 0302-9743.[url][bib]
Manuela Wiesinger-Widi.Gröbner Bases and Generalized Sylvester Matrices. Johannes Kepler University Linz. PhD Thesis.072015.[url][bib]
2014
J. Ablinger.The package HarmonicSums: Computer Algebra and Analytic aspects of Nested Sums. In: Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), pp. 1-10.2014.ISSN 1824-8039.[url][bib]
Alexander Baumgartner, Temur Kutsia.Unranked Second-Order Anti-Unification. In: Proceedings of the 21st Workshop on Logic, Language, Information and Computation, WoLLIC 2014 , Ulrich Kohlenbach (ed.), Lecture Notes in Computer Science8652, pp. 66- 80.2014.Springer,ISBN 978-3-662-44144-2.[pdf][bib]
Alexander Baumgartner, Temur Kutsia.A library of anti-unification algorithms. In: Proceedings of the 14th European Conference on Logics in Artificial Intelligence, JELIA 2014, Eduardo Ferme and Joao Leite (ed.), Lecture Notes in Computer Science, pp. 543-557.2014.Springer,ISBN 978-3-319-11557-3.[pdf][bib]
Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret.Nominal anti-unification. In: Proceedings of the 28th International Workshop on Unification, UNIF 2014, Temur Kutsia, Christophe Ringeissen (ed.), pp. 62-68.2014.[pdf][bib]
M. Beck, F. Breuer, L. Godkin, J. L. Martin.Enumerating Colorings, Tensions and Flows in Cell Complexes.Journal of Combinatorial Theory, Series A122(4), pp. 82-106.2014.0097-3165.[doi][bib]
David M. Cerna.A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata. In: Intelligent Computer Mathematics - International Conference, {CICM} 2014, Coimbra, Portugal, July 7-11, 2014. Proceedings, Stephen M. Watt and James H. Davenport and Alan P. Sexton and Petr Sojka and Josef Urban (ed.), Proceedings of CICM, pp. 61-75.2014.10.1007/978-3-319-08434-3\_6.[bib]
Élie de Panafieu, Vlady Ravelomanana.Analytic Description of the Phase Transition of Inhomogeneous Multigraphs.European Journal of Combinatorics, pp. -.2014.Elsevier,????.[pdf][bib]
Dominici Diego, Van Assche Walter.Zero distribution of polynomials satisfying a differential-difference equation.Anal. Appl. (Singap.)12(6), pp. 635-666.2014. ISSN 0219-5305.[doi][bib]
Dominici Diego, Marcell'an Francisco.Discrete semiclassical orthogonal polynomials of class one.Pacific J. Math.268(2), pp. 389-411.2014. ISSN 0030-8730.[doi][bib]
Isabela Dramnesc, Tudor Jebelean.Theory Exploration of Sets Represented as Monotone Lists. In: Proceedings of SISY 2014 IEEE 12th International Symposium on Intelligent Systems and Informatics, IEEE Xplore (ed.), pp. 163-168.2014. ..[bib]
Besik Dundua, Mario Florido, Temur Kutsia, Mircea Marin.Constraint Logic Programming for Hedges: A Semantic Reconstruction. In: Proceedings of the Twelfth International Symposium on Functional and Logic Programming, FLOPS 2014, Michael Codish and Eijiro Sumii (ed.), LNCS8475, pp. 285-301.2014.Springer,ISBN 978-3-319-07150-3.[pdf][bib]
G. Grasegger, G. Horváth, K.A. Kearnes.Polynomial Equivalence of Finite Rings.Journal of the Australian Mathematical Society96(2), pp. 244-257.2014.1446-8107.[url][bib]
G. Grasegger.Radical Solutions of First Order Autonomous Algebraic Ordinary Differential Equations. In: ISSAC '14: Proceedings of the 39th International Symposium on International Symposium on Symbolic and Algebraic Computation, Katsusuke Nabeshima (ed.), pp. 217-223.2014.ACM,New York,ISBN 978-1-4503-2501-1.[pdf][bib]
G. Grasegger, A. Lastra, J.R. Sendra, F. Winkler.On Symbolic Solutions of Algebraic Partial Differential Equations. In: Computer Algebra in Scientific Computing, V.P. Gerdt et al. (ed.), Lecture Notes in Computer Science8660, pp. 111-120.2014.Springer International Publishing,ISSN 0302-9743.[url][bib]
A. Behring, J. Bluemlein, A. De Freitas, T. Pfoh, C. Raab, M. Round, J. Ablinger, A. Hasselhuhn, C. Schneider, F. Wissbrock, A. von Manteuffel.New Results on the 3-Loop Heavy Flavor Corrections in Deep-Inelastic Scattering. In: Proc. of RADCOR, , PoS(RADCOR 2013)058, pp. 1-21.2014.ISSN 1824-8039.arXiv:1312.0124 [hep-ph].[doi][bib]
J. Ablinger, J. Bluemlein, A. De Freitas A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider, F. Wissbrock.The Transition Matrix Element $A_{gq}(N)$ of the Variable Flavor Number Scheme at $O(\alpha_s^3)$.Nuclear Physics B882, pp. 263-288.2014.ISSN: 0550-3213.arXiv:1402.0359 [hep-ph].[doi][bib]
Blümlein Johannes, Hasselhuhn Alexander, Pfoh Torsten.The $O(alpha_s^2)$ heavy quark corrections to charged current deep-inelastic scattering at large virtualities.Nucl.Phys.B881, pp. 1-41.2014.ISSN: 0550-3213.arXiv:1401.4352.[bib]
J. Ablinger, J. Bluemlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider.The $O(alpha_s^3 T_F^2)$ Contributions to the Gluonic Operator Matrix Element.Nuclear Physics B885, pp. 280-317.2014.ISSN: 0550-3213. arXiv:1405.4259 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider, F. Wissbrock. The 3-Loop Non-Singlet Heavy Flavor Contributions and Anomalous Dimensions for thE Structure Function $F_2(x, Q^2)$ and Transversity.Nuclear Physics B886, pp. 733-823.2014.ISSN: 0550-3213.arXiv:1406.4654 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, M. Round, C. Schneider, F. Wißbrock.3-Loop Heavy Flavor Corrections in Deep-Inelastic Scattering with Two Heavy Quark Lines. In: Proceedings of Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), PoS(LL2014)015, pp. 1-10.2014.ISSN 1824-8039.arXiv:1407.2821 [hep-ph].[doi][bib]
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, C. Raab, M. Round, C. Schneider, F. Wißbrock.Recent progress on the calculation of three-loop heavy flavor Wilson coefficients in deep-inelastic scattering. In: Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), PoS(LL2014)041, pp. 1-11.2014.ISSN 1824-8039.arXiv:1407.3638 [hep-ph].[doi][bib]
Maximilian Jaroschek.Radicals of Ore Polynomials. In: Proceedings of EACA 2014, , pp. -.2014.to appear.[pdf][bib]
F. Johansson.Fast and rigorous computation of special functions to high precision. RISC. PhD Thesis.2014.[pdf][bib]
Manuel Kauers, Maximilian Jaroschek, Fredrik Johansson.Ore Polynomials in Sage. In: Computer Algebra and Polynomials, Jaime Gutierrez, Josef Schicho, Martin Weimann (ed.), Lecture Notes in Computer Science, pp. ?-?.2014.tba.[ps][pdf][bib]
Fredrik Johansson, Brian Nakamura.Using functional equations to enumerate 1324-avoiding permutations.Advances in Applied Mathematics56(0), pp. 20 - 34.2014.ISSN 0196-8858.[url][bib]
Manuel Kauers, Ryan ODonnell, Li-Yang Tan, Yuan Zhou.Hypercontractive inequalities via SOS, and the Frankl-R\"odl graph. In: Proceedings of SODA'14, tba (ed.), pp. ?-?.2014.tba.[pdf][bib]
Manuel Kauers, Lily Yen.On the length of integers in telescopers for proper hypergeometric terms.Journal of Symbolic Computation, pp. ?-?.2014.ISSN 0747-7171.to appear.[ps][pdf][bib]
Manuel Kauers.Computer Algebra. In: Handbook of Combinatorics, Miklos Bona (ed.), pp. ?-?.2014.Taylor and Francis,tba.[bib]
Manuel Kauers.Bounds for D-Finite Closure Properties. In: Proceedings of ISSAC 2014, Katsusuke Nabeshima (ed.), pp. 288-295.2014.isbn 978-1-4503-2501-1/14/07.[pdf][bib]
Alin Bostan, Mireille Bousquet-Melou, Manuel Kauers, Stephen Melczer. On 3-dimensional lattice walks confined to the positive octant.Annals of Combinatorics, pp. ??-??.2014.ISSN 0218-0006.to appear.[pdf][bib]
Christoph Koutschan, Peter Paule, Sergei K. Suslov.Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II. In: Algebraic and Algorithmic Aspects of Differential and Integral Operators, Moulay Barkatou and Thomas Cluzeau and Georg Regensburger and Markus Rosenkranz (ed.), Lecture Notes in Computer Science8372, pp. 135-145.2014.Springer,Berlin Heidelberg,ISBN 978-3-642-54478-1.[pdf][bib]
Shaoshi Chen, Manuel Kauers, Christoph Koutschan.A Generalized Apagodu-Zeilberger Algorithm. In: Proceedings of ISSAC 2014, Katsusuke Nabeshima (ed.), pp. 107-114.2014.ISBN 978-1-4503-2501-1.[pdf][bib]
B. Kronholm, A. Larsen.Symmetry and Prime Divisibility Properties of Partitions of $n$ into Exactly $m$ Parts.Annals of Combinatorics, pp. -.March2014.Springer Basel,Basel, Switzerland,ISSN 0218-0006.[url][pdf][bib]
Temur Kutsia, Jordi Levy, Mateu Villaret.Anti-Unification for Unranked Terms and Hedges. Journal of Automated Reasoning52(2), pp. 155-190.2014.ISSN 0168-7433.[doi][bib]
A. Maletzky, B. Buchberger.Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema. In: Mathematical Software - ICMS 2014, Hoon Hong and Chee Yap (ed.), Proceedings of The 4th International Congress on Mathematical Software (ICMS'2014), Seoul, Korea, August 5-9, 2014, Lecture Notes in Computer Science8592, pp. 41-48.2014.Springer Berlin Heidelberg,ISBN 978-3-662-44198-5.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44199-2_8.[doi][pdf][bib]
B. Buchberger, A. Maletzky.Groebner Bases in Theorema. In: Mathematical Software - ICMS 2014, Hoon Hong and Chee Yap (ed.), Proceedings of The 4th International Congress on Mathematical Software (ICMS'2014), Seoul, Korea, August 5-9, 2014, Lecture Notes in Computer Science8592, pp. 374-381.2014.Springer Berlin Heidelberg,ISBN 978-3-662-44198-5.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44199-2_58.[doi][pdf][bib]
I. Moale, V. Pillwein.A note on uniform approximation of functions having a double pole.LMS J. Comput. Math.17(1), pp. 233-244.2014.[pdf][bib]
J. Ablinger, J. Blümlein, C. Raab, C. Schneider, F. Wissbrock.Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms.Nuclear Physics B885, pp. 409-447.2014.ISSN: 0550-3213. arXiv:1403.1137 [hep-ph].[doi][bib]
J. Ablinger, J. Blümlein, C.G. Raab, C. Schneider.Iterated Binomial Sums and their Associated Iterated Integrals.J. Math. Phys.55(112301), pp. 1-57.2014.ISSN 0022-2488.arXiv:1407.1822 [hep-th].[doi][bib]
J. Ablinger, J. Blümlein, C G. Raab, C. Schneider.Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams. In: Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), PoS(LL2014)020, pp. 1-13.2014.ISSN 1824-8039.arXiv:1407.4721 [hep-th].[doi][bib]
J. Blümlein, I. Dubovyk, J. Gluza, M. Ochman, C.G. Raab, T. Riemann, C. Schneider.Non-planar Feynman integrals, Mellin-Barnes representations, multiple sums. In: Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), PoS(LL2014)52, pp. 1-14.2014.ISSN 1824-8039.arXiv:1407.7832 [hep-ph].[doi][bib]
J. Schicho.A simplified game for resolution of singularities. In: The Resolution of Singular Algebraic Varieties, D. Ellwood and H. Hauser and S. Mori and J. Schicho (ed.), pp. 209-224.2014.Amer. Math. Soc.,ISBN 978-0-8218-8982-4.[bib]
M. Gallet, G. Nawratil, J. Schicho.Bond theory for pentapods and hexapods.Journal of Geometry, pp. 1-18.2014.0047-2468.online first.[doi][pdf][bib]
M. Gallet, G. Nawratil, J. Schicho.Moebius photogrammetry.Journal of Geometry, pp. 1-19.2014.1420-8997.[doi][pdf][bib]
J. Schicho, J. Top.Algebraic approaches to FlipIt. In: The Resolution of Singular Algebraic Varieties, D. Ellwood and H. Hauser and S. Mori and J. Schicho (ed.), pp. 319-326.2014.Amer. Math. Soc.,ISBN 978-0-8218-8982-4.[bib]
S. Di Rocco, J. Schicho.Foreword to the Special Issue on Computational Algebraic Geometry.Math. Comp. Sci.8, pp. 117-118.2014. ISSN: 1661-8270.[bib]
Z. Li, J. Schicho F. Thomas and A. P. Gracia.Three types of parallel linkages. In: Computational Kinematics, F. Thomas and A. P. Gracia (ed.), pp. 111-120.2014.Springer,ISBN: 978-94-007-7213-7.[bib]
J. Ablinger, J. Bluemlein, C. Schneider.Generalized Harmonic, Cyclotomic, and Binomial Sums, their Polylogarithms and Special Numbers. In: Proc. ACAT 2013, , J. Phys.: Conf. Ser523/012060, pp. 1-10.2014. ISSN 1742-6596. arXiv:1310.5645 [math-ph].[doi][bib]
A. De Freitas, J. Blümlein, C. Schneider.Recent Symbolic Summation Methods to Solve Coupled Systems of Differential and Difference Equations. In: Loops and Legs in Quantum Field Theory - LL 2014, J. Bluemlein, P. Marquard, T. Riemann (ed.), PoS(LL2014)017, pp. 1-13.2014.ISSN 1824-8039. arXiv:1407.2537 [cs.SC].[doi][bib]
C. Schneider.A streamlined difference ring theory: Indefinite nested sums, the alternating sign and the parameterized telescoping problem. In: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 15th International Symposium, Franz Winkler, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen Watt, Daniela Zaharie (ed.), pp. 26-33.2014.IEEE Computer Society,ISBN-13:978-1-4799-8448-0. arXiv:1412.2782v1 [cs.SC].[doi][pdf][bib]
C. Schneider.Modern Summation Methods for Loop Integrals in Quantum Field Theory: The Packages {S}igma, {EvaluateMultiSums} and {SumProduction}. In: Proc. ACAT 2013, - (ed.), J. Phys.: Conf. Ser.523, pp. 1-17.2014.ISSN 1742-6596.arXiv:1310.0160 [cs.SC].[doi][bib]
Wolfgang Schreiner, Tamas Berczes, Janos Sztrik.Probabilistic Model Checking on HPC Systems for the Performance Analysis of Mobile Networks.Annales Mathematicae et Informaticae43, pp. 123-144.2014.Líceum University Press,ISSN 1787-5021, ISSN 1787-6117.[bib]
J. Schicho, D. Sevilla.Tschirnhaus-Weierstrass curves.Math. Comp.83, pp. 3005-3015.2014. ISSN 0025-5718.[bib]
Thomas Ponweiser.Computer Algebra and Analysis: Complex Variables Visualized. RISC Institute, JKU Linz, Austria. Diploma Thesis.2014.[pdf][bib]
V. Pillwein, S. Takacs.A local Fourier convergence analysis of a multigrid method using symbolic computation.Journal of Symbolic Computation63, pp. 1-20.2014.ISSN:0747-7171 .[pdf][bib]
W. Windsteiger.Theorema 2.0: A System for Mathematical Theory Exploration. In: Proceedings International Congress on Mathematical Software (ICMS'2014), Seoul, Korea, August 5-8, 2014, Chee Yap and Hoon Hong (ed.), Proceedings of International Congress on Mathematical Software (ICMS'2014), Lecture Notes in Computer Science (LNCS)8592, pp. 49-52.2014.ISBN 978-3-662-44198-5.[url][pdf][bib]
Winkler Franz.Algebraic differential equations - Rational solutions and beyond.Southeast Asian Bulletin of Mathematics(38), pp. 153-162.2014.0129-2021.[bib]
Ardila Federico, Baker Tia, Yatchak Rika.Moving robots efficiently using the combinatorics of CAT(0) cubical complexes.SIAM J. Discrete Math.28(2), pp. 986-1007.2014. ISSN 0895-4801.[doi][bib]
2013
J. Ablinger, J. Bluemlein.Harmonic Sums, Polylogarithms, Special Numbers, and Their Generalizations. In: Computer Algebra in Quantum Field Theory, C. Schneider, J. Bluemlein (ed.), Texts and Monographs in Symbolic Computation, pp. 1-32.2013.Springer,ISBN-13: 978-3709116159.[bib]
Ainhoa Aparicio Monforte, Manuel Kauers.Formal Laurent Series in Several Variables.Expositiones Mathematicae31(4), pp. 350-367.2013.ISSN 0723-0869.[pdf][bib]
Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret.A Variant of Higher-Order Anti-Unification. In: Proceedings of the 24th International Conference on Rewriting Techniques and Applications, RTA 2013, Femke van Raamsdonk (ed.), Leibniz International Proceedings in Informatics21, pp. 113-127.2013.ISBN 978-3-939897-53-8, ISSN 1868-8969.[url][bib]
Alexander Baumgartner, Temur Kutsia.Unranked Anti-Unification with Hedge and Context Variables. In: Proceedings of the 27th International Workshop on Unification, UNIF 2013, Barbara Morawska, Konstantin Korovin (ed.), pp. 13-21.2013.[url][bib]
Christian Dönch.Characterization of relative Gröbner bases.Journal of Symbolic Computation55, pp. 19-29.2013.0747-7171.[bib]
Dominici D., Johnston S. J., Jordaan K..Real zeros of $_2F_1$ hypergeometric polynomials.J. Comput. Appl. Math.247, pp. 152-161.2013. ISSN 0377-0427.[doi][bib]
Sandra Alves, Besik Dundua, Mario Florido, Temur Kutsia.A Confluent Pattern Calculus with Hedge Variables. In: Proceedings of the 2nd International Workshop on Confluence, IWC 2013, Nao Hirokawa, Vincent van Oostrom (ed.), pp. 41-45.2013.[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: Proceedings of the 36th International Conference on High Energy Physics, PoS(ICHEP2012)270, pp. 1-9.2013. ISSN 1824-8039.arXiv:1212.5950 [hep-ph].[doi][bib]
J. Ablinger, J. Bluemlein, A. De Freitas, A. Hasselhuhn, A. von Manteuffel, C. Raab, M. Round, C. Schneider, F. Wissbrock.Recent Results on the 3-Loop Heavy Flavor Wilson Coefficients in Deep-Inelastic Scattering. In: XXI International Workshop on Deep-Inelastic Scattering and Related Subjects - DIS2013, PoS(DIS 2013)301, pp. 1-8.2013.ISSN 1824-8039.arXiv:1307.7548 [hep-ph].[doi][bib]
Alexander Hasselhuhn.3-loop contributions to heavy flavor Wilson coefficients of neutral and charged current DIS. TU Dortmund University. PhD Thesis.2013.[url][bib]
M. Erascu, H. Hong.The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation. Journal of Reliable Computing18, pp. 73-81.2013.1573-1340.[pdf][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. 157-164.2013.isbn 978-1-4503-2059-7/13/06.[ps][pdf][bib]
Maximilian Jaroschek.Improved Polynomial Remainder Sequences for Ore Polynomials.Journal of Symbolic Computation58, pp. 64-76.2013.ISSN 0747-7171.[url][bib]
Maximilian Jaroschek.Removable Singularities of Ore Operators. RISC. PhD Thesis.November2013.[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. 211-218.2013.isbn 978-1-4503-2059-7/13/06.[ps][pdf][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]
Christoph Koutschan, Thotsaporn Thanatipanonda.Advanced Computer Algebra for Determinants.Annals of Combinatorics17(3), pp. 509-523.2013.ISSN 0218-0006.[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 Mathematics11(4), pp. 609-620.2013.ISSN 1895-1074.[pdf][bib]
B. Kronholm.Generalized Congruence Properties of the Restricted Partition Function p(n, m).The Ramanujan Journal30(3), pp. 425-436.2013.1572-9303.[url][bib]
Y. Huang, L.X.C. Ngo, F. Winkler.Rational general solutions of higher order algebraic ODEs.J. Systems Science and Complexity (JSSC)26/2, pp. 261-280.2013.1009-6124.[bib]
Y. Huang, L.X.C. Ngo, F. Winkler.Rational general solutions of trivariate rational systems of autonomous ODEs.Mathematics in Computer Science6/4, pp. 361-374.2013.1661-8270.[bib]
Peter Paule, Sergei K. Suslov.Relativistic Coulomb Integrals and Zeilbergers Holonomic Systems Approach. I.. In: Computer Algebra in Quantum Field Theory, Texts and Monographs in Symbolic Computation, Springer, 2013, Carsten Schneider, Johannes Blümlein (ed.), pp. 225-241.2013.Springer,978-3-7091-1615-9.[bib]
Peter Paule.Mathematics, Computer Science and Logic - A Never Ending Story The Bruno Buchberger Festschrift.1st edition,2013.Springer,978-3-319-00965-0.[bib]
S. Beuchler and V. Pillwein and S. Zaglmayr.Sparsity optimized high order finite element functions for H(curl) on tetrahedra.Advances in Applied Mathematics50, pp. 749-769.2013.[doi][pdf][bib]
V. Pillwein.Termination Conditions for Positivity Proving Procedures. In: Proceedings of ISSAC'13, M. Kauers (ed.), pp. 315-322.2013.isbn 978-1-4503-2059-7/13/06.[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 Society365, pp. 4881-4894.2013.1088-6850(e), 0002-9947(p) .[doi][pdf][bib]
Cristian-Silviu Rand, James Sellers.An extensive analysis of the parity of broken 3-diamond partitions. Journal of Number Theory 133(11), pp. 3703-3716.2013.0022-314X.[doi][pdf][bib]
M. Hodorog, J. Schicho.A Regularization Approach for Estimating the Type of a plane Curve Singularity.Theor. Comp. Sci.479, pp. 99-119.2013.0304-3975.[bib]
A. Dickenstein, S. Di Rocco, E. Hubert, J. Schicho (eds.).Effective Methods in Algebraic Geometry.J. Symb. Comp.151, pp. 1-114.2013.0747-7171.[bib]
G. Hegedüs, J. Schicho, H.-P. Schröcker.Factorization of Rational Curves in the Study Quadric and Revolute Linkages.Mech. Mach. Theory69(1), pp. 142-152.2013.0094-114X.[bib]
G. Hegedüs, J. Schicho, H.-P. Schröcker.The Theory of Bonds: A New Method for the Analysis of Linkages.Mech. Mach. Theory70, pp. 404-424.2013.0094-114X.[bib]
Z. Li, J. Schicho.Classification of angle-symmetric 6R linkages.Mech. Mach. Theory70, pp. 372-379.2013.0094-114X.[bib]
J. Schicho, F.-O. Schreyer, M. Weimann.Computational aspects of gonal maps.AAECC24, pp. 313-341.2013.0938-1279 .[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.arXiv:1205.4184 [hep-ph].[doi][pdf][bib]
J. Ablinger, J. Bluemlein, C. Schneider.Analytic and Algorithmic Aspects of Generalized Harmonic Sums and Polylogarithms.J. Math. Phys.54(082301), pp. 1-74.2013.ISSN 0022-2488.arXiv:1302.0378 [math-ph].[doi][pdf][bib]
C. Schneider.Simplifying Multiple Sums in Difference Fields. In: Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, C. Schneider, J. Bluemlein (ed.), Texts and Monographs in Symbolic Computation, pp. 325-360.2013.Springer,ISBN-13: 978-3709116159.arXiv:1304.4134 [cs.SC].[doi][pdf][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]
C. Schneider.Symbolic Summation in Difference Fields and Its Application in Particle Physics.Computer Algebra Rundbrief53, pp. 8-12.2013.ISSN 0933-5994.[url][bib]
Andrii Kryvolap, Mykola Nikitchenko, Wolfgang Schreiner.Program Algebras with Monotone Floyd-Hoare Composition. In: ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer 2013, Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, Grygoriy Zholtkevych, Mikhail Zavileysky, Hennadiy Kravtsov, Vitaliy Kobets, Vladimir Peschanenko (ed.), Proceedings of ICTERI 2013: 9th International Conference, Kherson, Ukraine, CEUR-WS.org CEUR Workshop Proceedings1000, pp. 533-549.June 19-222013.CEUR-WS.org,ISSN 1613-0073.[pdf][bib]
Andrii Kryvolap, Mykola Nikitchenko, Wolfgang Schreiner.Extending Floyd-Hoare Logic for Partial Pre- and Postconditions. In: ICTERI 2013: 9th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer, Kherson, Ukraine, June 19-22, 2013, Revised Selected Papers, Vadim Ermolayev et al (ed.), Communications in Computer and Information Science, pp. 0-23.2013.Springer,Berlin,ISBN 978-3-319-03997-8 (Print) 978-3-319-03998-5 (Online).[pdf][bib]
CRISTIAN-SILVIU RADU, JAMES SELLERS.Congruences modulo squares of primes for Fu's k dots bracelet partitions. International Journal of Number Theory9(4), pp. 939-943.2013.World Scientific, 1793-0421.[doi][pdf][bib]
CRISTIAN-SILVIU RADU, JAMES SELLERS.Infinitely many congruences for broken 2-diamond partitions modulo 3.Journal of Combinatorics and Number Theory4(3), pp. 195-200.2013.Nova Science Publishers,1942-5600.[pdf][bib]
W.Y.C.Chen, D.D.M.Sang and Diane Y.H. Shi. The Rogers-Ramanujan-Gordon theorem for overpartitions.Proceedings of the London Mathematical Society106(3), pp. 1371-1393.2013.0024-6115.[bib]
S. El Bedewy.Gesture-Based Browsing of Mathematics. Internationaler Universitätslehrgang Informatics: Engineering and Management (ISI), Johannes Kepler University Linz. Master Thesis.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.), Lecture Notes in Artificial Intelligence (LNAI)7961, pp. 200-215.2013.Springer,ISBN 978-3-642-39319-8.[pdf][bib]
Koukouvinos Christos, Simos Dimitris E, Zafeirakopoulos Zafeirakis.A Groebner Bases Method for Complementary Sequences. In: Proceedings of Applications of Computer Algebra, Jose Luis Galan Garcia, Gabriel Aguilera Venegas, Pedro Rodirguez Cielos (ed.), pp. 255-260.2013.84-616-4565-0.[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, C. Schneider, J. Bluemlein (ed.), Texts and Monographs in Symbolic Computation, pp. 75-96.2013.Springer,ISBN-13: 978-3709116159.arXiv:1305.4818 [cs.SC].[doi][pdf][bib]
2012
J. Ablinger.Computer Algebra Algorithms for Special Functions in Particle Physics. J. Kepler University Linz. PhD Thesis.April2012.[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 Computation47(2), pp. 192-213.022012. ISSN 0747-7171.[url][bib]
Dominici Diego, Knessl Charles.Asymptotic analysis of a family of polynomials associated with the inverse error function.Rocky Mountain J. Math.42(3), pp. 847-872.2012. ISSN 0035-7596.[doi][bib]
Dominici Diego E., Gill Peter M. W., Limpanuparb Taweetham.A remarkable identity involving Bessel functions.Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci.468(2145), pp. 2667-2681.2012. ISSN 1364-5021.[doi][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-262012.IEEE Xplore,Obuda University, Budapest, Hungary and "Politehnica" University of Timisoara, Romania,Print ISBN 978-1-4673-1013-0.[bib]
Isabela Dramnesc, 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, 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.September2012.IEEE Xplore,ISBN 978-1-4673-4751-8.[url][bib]
Isabela Dramnesc, 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.September2012.IEEE Computer Society,ISBN-13: 978-0-7695-4934-7.[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]
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.arXiv:1212.6823 [hep-ph].[doi][bib]
Fredrik 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.Trading Order for Degree in Creative Telescoping.Journal of Symbolic Compuation47(8), pp. 968-995.2012.ISSN 0747-7171.[ps][pdf][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 Combinatorics18(2), pp. 1-76.2012.1077-8926.P37.[ps][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.July2012.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.July2012.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.December2012.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 Computation1, 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 Theory8(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 Mathematics21(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 Mathematics312(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 Physics53(8), pp. 082704-.2012.ISSN 0022-2488.[pdf][bib]
B. Kronholm.A Result on Ramanujan-Like Congruence Properties of the Restricted partition Function p(n, m) Across Both Variables.INTEGERS12(A63), pp. 1-6.2012.1553-1732.[url][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]
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 Mathematics230(3), pp. 819-838.2012.0001-8708.[doi][pdf][bib]
George E. Andrews and Peter Paule.MacMahon's Dream. In: Partitions, q-Series, and Modular Forms, K. Alladi and F. Garvan (ed.), Developments in Mathematics23, pp. 1-12.2012.Springer,978-1-4614-0028-8.[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. 537-544.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 Mathematik122(2), pp. 197-225.2012.[pdf][bib]
Y. Cha, V. Pillwein.Closed form solutions of linear difference equations in terms of symmetric products.ACM Communications in Computer Algebra46(3-4), pp. 80-81.Sep2012.0.[bib]
Liu Chao, Wu Dandan, Qi Jiayue.The Real Estate Market Comprehensive Evaluation based on Sparse Principal Component Analysis -- An Example of Beijing.ECONOMIC RESEARCH GUIDENo.30.2012(Serial No.176), pp. 158-160.2012.1673-291X(2012) 30-0158-03.[url][bib]
Clemens G. Raab.Using Groebner bases for finding the logarithmic part of the integral of transcendental functions.Journal of Symbolic Computation47(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.August2012.[pdf][bib]
Cristian-Silviu Radu.A proof of Subbarao's conjecture.Journal fuer Reine und angewandte Mathematik2012(672), pp. 161-175.2012.De Gruyter, 1435-5345.[doi][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.arXiv:1011.2656 [cs.SC].[doi][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.arXiv:1202.2700 [hep-ph].[doi][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.arXiv:1202.4303 [math-ph].[doi][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 B864, pp. 52-84.2012.ISSN: 0550-3213.arXiv:1206.2252v1 [hep-ph].[doi][pdf][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].[doi][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.February2012.Wroclaw, Poland, July 31, 2011,ISSN: 2075-2180.[doi][bib]
Ph. Kügler, W. Windsteiger.Algorithmische Methoden - Funktionen, Matrizen, Multivariate Polynome.Reihe: Mathematik kompakt.1st edition,May2012.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 Proceedings921, pp. 73-81.2012.Aachen,1613-0073.[url][pdf][bib]
W. Windsteiger.Theorema 2.0: A Graphical User Interface for a Mathematical Assistant System. In: Proceedings 10th International Workshop On User Interfaces for Theorem Provers, Bremen, Germany, July 11th 2012, Cezary Kaliszyk and Christoph Lüth (ed.), Proceedings of UITP 2012, Electronic Proceedings in Theoretical Computer Science118, pp. 72-82.2012.Open Publishing Association,ISBN 2075-2180 (ISSN).doi: 10.4204/EPTCS.118.5.[url][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]
Zafeirakis Zafeirakopoulos.Linear Diophantine Systems: Partition Analysis and Polyhedral Geometry. Research Institute for Symbolic Computation / DK-compmath. PhD Thesis.December2012.[pdf][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. ---.september2011.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. -.September2011.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. 273-331.2011.Springer, Wien,ISBN 978-3-7091-0793-5.Also available as RICAM Report 2010-05, September 2010.[pdf][bib]
Bruno Buchberger, Manuel Kauers.Buchberger's Algorithm.Scholarpedia6(10), pp. 7764-7764.October2011.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.June2011.ACM,978-1-4503-0675-1.[url][ps][pdf][bib]
Tautz R. C., Lerche I., Dominici D..Methods for summing general Kapteyn series.J. Phys. A44(38), pp. 385202, 14-385202, .2011. ISSN 1751-8113.[doi][bib]
Dominici Diego Ernesto.On Taylor series and Kapteyn series of the first and second type.J. Comput. Appl. Math.236(1), pp. 39-48.2011. ISSN 0377-0427.[doi][bib]
Dominici Diego.An arithmetic metric.College Math. J.42(3), pp. 207-214.2011. ISSN 0746-8342.[doi][bib]
Cohl Howard S., Dominici Diego E..Generalized Heine's identity for complex Fourier series of binomials.Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci.467(2126), pp. 333-345.2011. ISSN 1364-5021.[doi][bib]
Dominici Diego, Driver Kathy, Jordaan Kerstin.Polynomial solutions of differential-difference equations.J. Approx. Theory163(1), pp. 41-48.2011. ISSN 0021-9045.[doi][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.September2011.IEEE Computer Society,ISBN 978-0-7695-4630-8.[url][pdf][bib]
Burcin Erocal.Algebraic extensions for summation in finite terms. RISC, Johannes Kepler University, Linz. PhD Thesis.February2011.[pdf][bib]
Christoph Fuerst.Combinatorial Sums: Egorychev's Method of Coefficients and Riordan Arrays. RISC, Johannes Kepler University Linz. Diploma Thesis.March2011.[pdf][bib]
M. Hodorog.Symbolic-Numeric Algorithms for Plane Algebraic Curves. Research Institute for Symbolic Computation (RISC), Doctoral Program "Computational Mathematics". PhD Thesis.November2011.RISC Technical Report 11-14.[pdf][bib]
Manuel Kauers, Peter Paule.The Concrete Tetrahedron.Text and Monographs in Symbolic Computation1st edition,2011.Springer Wien,978-3-7091-0444-6.[bib]
Manuel Kauers.How To Use Cylindrical Algebraic Decomposition.Seminaire Lotharingien de Combinatoire65(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 Mathematics47(4), pp. 813-819.2011.ISSN 0196-8858.[ps][pdf][bib]
Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz.Dominance in the Family of Sugeno-Weber t-norms.Fuzzy Sets and Systems181(1), pp. 74-87.October2011.ISSN 0165-0114.[ps][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.October2011.Vasteras, Sweden,Doktoratskolleg,Research Institute for Symbolic Computation,ISSN 1404-3041.[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 AMS139(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 Sciences20, 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 Sciences108(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 Mathematics47(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 Intelligencer33(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 Science6885, 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]
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]
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.July2011.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. -.December2011.Orlando, Florida, USA,IEEE,[bib]
I. Moale and F. Peherstorfer.Explicit min-max polynomials on the disc.J. Approx. Theory163, 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. Theory163, 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 Computation46(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.October2011.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. B844, pp. 26-54.2011.ISSN: 0550-3213.arXiv:1008.3347 [hep-ph].[doi][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.arXiv:1101.2803 [cs.SC].[doi][pdf][bib]
H. Prodinger, C. Schneider, S. Wagner.Unfair permutations.Europ. J. Comb.32, pp. 1282-1298.2011.ISSN: 0195-6698.[doi][pdf][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:1105.6063 [math-ph].[doi][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]
Andrei-Ovidiu Coman.Video Tracking of Humans in Robotic Environments. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.September2011.[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 Theory8, pp. 2249-2259.2011.1793-7310.[bib]
W.Y.C.Chen, D.D.M.Sang and Diane Y.H. Shi. Anti-lecture hall compositions and overpartitions.J.Combin. Theory, Ser. A.118(4), pp. 1451-1464.2011.0097-3165.[bib]
Marek Sacha.Structuring and Reusing Knowledge in the Theorema System. Internationaler Universitätslehrgang Informatics: Engineering and Management (ISI), Johannes Kepler University Linz. Diploma Thesis.2011.[pdf][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]
T. Thanatipanonda.Further Hopping with Toads and Frogs.The Electronic Journal of Combinatorics18(1)(P67), pp. 1-12.2011.1077-8926.[pdf][bib]
Manuela Wiesinger-Widi.Groebner Bases and Generalized Sylvester Matrices.ACM Communications in Computer Algebra45(2), pp. -.June2011.Accepted extended abstract from ISSAC 2011 poster presentation.[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 (LNAI)6824, pp. 58-73.2011.Springer,ISSN 0302-9743.[doi][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]
Xinhua Xiong.The number of cubic partitions modulo powers of 5.arXiv:math.NT/1004.4737. Science China in Mathematics 41(1), pp. 1-15.2011.ISSN 1674-7216.[url][bib]
Xinhua Xiong.Two identities involving the cubic partition function.Int. J. Number Theory7(6), pp. 1615-1626.2011.ISSN 1793-0421.[bib]
Xinhua Xiong.Two congruences involving Andrews-Paule's broken 3-diamond partitions and 5-diamond partitions.Proc. Japan Acad. Ser. A: Math. Sci.87(5), pp. 65-68.2011.ISSN : 0386-2194.[bib]
Xinhua Xiong.A short proof of an identity for cubic partition function.Commun. Korean Math. Soc.26(4), pp. 551-555.2011.ISSN: 1225-1763 .[url][bib]
Qunying Liao, Liangjie Ye.Lower Bounds and Constructions for q-ary Codes Correcting Asymmetric Errors.Advances in Mathematics(China)42(6), pp. 795-800.2011.ISSN:1000-0917 .[url][pdf][bib]
2010
Christian Aistleitner.Differential aspects of differential characteristic set computations. Johannes Kepler University, Linz, Austria. PhD Thesis.June2010.[pdf][bib]
Christian Aistleitner.Relations between Groebner bases, differential Groebner bases, and differential characteristic sets. Johannes Kepler University, Linz, Austria. Diploma Thesis.December2010.[pdf][bib]
Loredana Tec, Georg Regensburger, Markus Rosenkranz and Bruno Buchberger.An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra. In: Mathematical Software - ICMS 2010, Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, Komei Fukuda and Joris van der Hoeven and Michael Joswig and Nobuki Takayama (ed.), Proceedings of ICMS, Lecture Notes in Computer Science6327, pp. 245-248.2010.Springer,978-3-642-15581-9.[pdf][bib]
Bruno Buchberger, Manuel Kauers.Groebner Bases.Scholarpedia5(10), pp. 7763-7763.October2010.ISSN 1941-6016.[url][bib]
N. Popov, T. Jebelean, B. Buchberger.From Program Verification to Automated Debugging. In: Workshop on Symbolic Computation in Software Science, T. Jebelean and M. Mosbah and N. Popov (ed.), Proceedings of SCSS 2010, pp. 55-65.July2010.RISC-Linz Report Series,Johannes Kepler University of Linz, Austria,..[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.[doi][bib]
Yongjae Cha.Closed Form Solutions of Linear Difference Equations. Florida State University. PhD Thesis.2010.[url][bib]
Isabela Dramnesc, Tudor Jebelean, Adrian Craciun.A Case Study in Systematic Exploration of Tuple Theory. In: Workshop of Symbolic Computation in Software Science, Tudor Jebelean, Mohamed Mosbah, Nikolaj Popov (ed.), Proceedings of SCSS 2010 Symbolic Computation in Software Science, Hagenberg1/10-10, pp. 82-95.29-30 July2010.RISC-Linz Report Series,Johannes Kepler University of Linz, Austria,.[pdf][bib]
Christian Doench, Franz Winkler.Bivariate Difference-differential Dimension Polynomials and Their Computation in Maple. In: Proceedings of the 8th International Conference on Applied Informatics, Attila Egri-Nagy, Emőd Kovács, Gergely Kovásznai, Gábor Kusper, Tibor Tómács (ed.), pp. 211-218.2010.ISBN 978-963-9894-72-3.[pdf][bib]
Tautz R. C., Dominici D..The analytical summation of a new class of Kapteyn series.Phys. Lett. A374(13-14), pp. 1414-1419.2010. ISSN 0375-9601.[doi][bib]
Dominici Diego.Fisher information of orthogonal polynomials. I.J. Comput. Appl. Math.233(6), pp. 1511-1518.2010. ISSN 0377-0427.[doi][bib]
Diego Dominici.Asymptotic Analysis of the Zeros of Hermite Polynomials. In: Progress in industrial mathematics at ECMI 2008, Alistair D. Fitt, John Norbury, Hilary Ockendon, Eddie Wilson (ed.), Mathematics in Industry15, pp. 99-103.2010.Springer ,Berlin, Heidelberg,978-3-642-12110-4.[bib]
Isabela Dramnesc, Tudor Jebelean.A Case Study in Proof Based Synthesis of Sorting Algorithms. In: Analele Universitatii de Vest, Timisoara, D.Gaspar, D.Zaharie, B.Buchberger, D.Burghelea, G.Cassier (ed.), Proceedings of 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2010), Matematica - InformaticaXLVIII/3, pp. 47-58.23-26 September2010.West University of Timisoara, Romania,ISSN-1841-3293.[pdf][bib]
Besik Dundua, Temur Kutsia, Mircea Marin.Strategies in P$\rho$Log.Electronic Proceedings in Theoretical Computer Science, pp. 32-43.2010.ISSN 2075-2180 .[pdf][bib]
Jorge Coelho, Besik Dundua, Mario Florido and Temur Kutsia.A Rule-Based Approach to XML Processing and Web Reasoning. In: Proceedings of the 4th International Conference on Web Reasoning and Rule Systems, RR 2010, Pascal Hitzler and Thomas Lukasiewicz (ed.), Lecture Notes in Computer Science6333, pp. 164-172.2010.Springer,ISSN 0302-9743, ISBN 978-3-642-15917-6.[url][bib]
Madalina Erascu, Tudor Jebelean.A Purely Logical Approach to Program Termination. In: Proceedings of the 11th International Workshop on Termination, Peter Schneider-Kamp (ed.), Proceedings of Federated Logic Conference, Edinburgh, 9-21 July, pp. - .2010.[pdf][bib]
M. Erascu, T. Jebelean.A Purely Logical Approach to the Termination of Imperative Loops. In: Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, T. Ida, V. Negru, T. Jebelean, D. Petcu, S. M. Watt, D. Zaharie (ed.), pp. 142-149.September2010.IEEE Computer Society, 978-0-7695-4324-6.[pdf][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 Science6327, pp. 12-27.2010.Springer,ISBN 978-3-642-15581-9.[pdf][bib]
Tamas Berczes, Gabor Guta, Gabor Kusper, Wolfgang Schreiner, Janos Sztrik.Evaluating a Probabilistic Model Checker for Modeling and Analyzing Retrial Queueing Systems .Annales Mathematicae et Informaticae, pp. -.December2010.Liceum University Press,ISSN 1787-5021.[url][bib]
Gabor Guta, Andras Pataricza, Wolfgang Schreiner, Daniel Varro.Semi-Automated Correction of Model-to-Text Transformations. In: Preliminary Proceedings of International Workshop on Models and Evolution (ME 2010), - (ed.), pp. 43-52.2010.-.[url][bib]
A. Constantin, E. Kartashova, E. Wahlen.Discrete wave turbulence of rotational capillary water waves.Phys. Fluidssubmitted, pp. 1-13.2010.AIP,isbn.[pdf][bib]
E. Kartashova.Capillary freak waves in He-II as a manifestation of discrete wave turbulent regime. In: Geophysical Research Abstracts, E. Pelinovsky, C. Kharif (ed.), Proceedings of EGU 2010 (European Geosciences Union, General Assembly 2010),12, pp. 1889-1889.2010.issn.[pdf][bib]
E. Kartashova, M. Bustamante.Resonance clustering in wave turbulent regimes: Integrable dynamics.Physica A: Stat. Mech. Appl.submitted, pp. 1-31.2010.Elsevier,ISSN: 0378-4371.[pdf][bib]
E. Kartashova, A. Kartashov.Turbulence of capillary waves revisited.EPLsubmitted, pp. 1-6.2010.isbn.[url][bib]
E. Kartashova.Nonlinear Resonance Analysis.Cambridge edition,2010.Cambridge University Press,ISBN-13: 9780521763608.[url][bib]
Alin Bostan, Manuel Kauers.The Complete Generating Function for Gessel Walks is Algebraic.Proceedings of the AMS138(9), pp. 3063-3078.September2010.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]
Anja Korporal, Georg Regensburger, Markus Rosenkranz.A MAPLE Package for Integro-Differential Operators and Boundary Problems.ACM Commun. Comput. Algebra44(3), pp. 120-122.September2010.ISSN:1932-2240.Also presented as a poster at ISSAC '10.[bib]
Christoph Koutschan.A Fast Approach to Creative Telescoping.Mathematics in Computer Science4(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 Mathematics517, pp. 219-230.2010.American Mathematical Society,ISSN 0271-4132.[pdf][bib]
Temur Kutsia, Jordi Levy, Mateu Villaret. On the Relation Between Context and Sequence Unification.Journal of Symbolic Computation45(1), pp. 74-95.2010.ISSN 0747-7171.[pdf][bib]
Temur Kutsia and Mircea Marin.Order-Sorted Unification with Regular Expression Sorts. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, Christopher Lynch (ed.), Leibniz International Proceedings in Informatics (LIPIcs)6, pp. 193-208.2010.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl Publishing,ISSN 1868-8969, ISBN 978-3-939897-18-7.[url][bib]
Mircea Marin and Temur Kutsia.Regular Hedge Language Factorization Revisited. In: Proceedings of the 14th International Conference on Developments in language Theory, DLT 2010, Sheng Yu (ed.), Lecture Notes in Computer Science6224 , pp. 328-339.2010.Springer,ISSN 0302-9743, ISBN 978-3-642-14454-7.[url][bib]
Mircea Marin, Temur Kutsia.On the Computation of Quotients and Factors of Regular Languages.Frontiers of Computer Science in China4(2), pp. 173-184.2010.Springer,ISSN 1673-7350.[url][bib]
Mircea Marin, Temur Kutsia.Linear Systems for Regular Hedge Languages. In: Advances in Databases and Information Systems, Associated Workshops and Doctoral Consortium of the 13th East European Conference, ADBIS 2009. Revised Selected Papers , Janis Grundspenkis, Marite Kirikova, Yannis Manolopoulos, Leonids Novickis (ed.), Lecture Notes in Computer Science5968, pp. 104-112.2010.Springer,ISSN 0302-9743, ISBN 978-3-642-12081-7.[pdf][bib]
Johannes Middeke.Conversion between Hermite and Popov normal forms using an FGLM-like approach.Albanian Journal of Mathematics4(4), pp. 181-193.2010.AulonaPress,1930-1235.Special Issue, Applications of Computer Algebra 2010, University of Vlora, Albania.[bib]
L.X.Chau Ngo, F. Winkler .Rational general solutions of first order non-autonomous parametrizable ODEs.Journal of Symbolic Computation, MEGA'2009,45(12), pp. 1426-1441.2010.Research Institut for Symbolic Computation,ISSN 0747-7171.[url][pdf][bib]
Peter Paule, Silviu Radu.Infinite families of strange partition congruences for broken 2-diamonds .The Ramanujan Journal23, pp. 409-416.2010.1382-4090.[doi][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]
A. Anisimov, T. Jebelean, A. Lyaletski, N. Popov.Projects of Evidence Algorithm and Theorema. In: Theoretical and Applied Aspects of Program Systems Development, A. Anisimov, V. Redko (ed.), pp. 54-58.October2010.Kiev, Ukraine,..[bib]
N. Popov, T. Jebelean.Proving Partial Correctness and Termination of Mutually Recursive Programs. In: SYNASC 2010, T. Ida, V. Negru, T. Jebelean, D. Petcu, S. Watt, and, D. Zaharie (ed.), Proceedings of Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 153-158.September2010.IEEE ,ISBN 978-0-7695-4324-6.[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]
M. Hodorog, B. Mourrain, J. Schicho.A Symbolic-Numeric Algorithm for Computing the Alexander Polynomial of a Plane Curve Singularity. In: Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, T. Ida, V. Negru, T. Jebelean, D. Petcu, S. Watt, D. Zaharie (ed.), Proceedings of 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, September 23-26, Timisoara, Romania, pp. 21-28.2010.978-0-7695-4324-6.[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.[doi][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 Proceedings12, 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.[doi][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].[doi][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 Theory205-206, pp. 110-115.2010.ISSN 0550-3213.arXiv:1006.4797 [math-ph].[doi][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 Theory205-206, pp. 242-249.2010.ISSN 0550-3213.arXiv::1007.0375 [hep-ph].[doi][pdf][bib]
Wolfgang Schreiner.The RISC ProgramExplorer: Reasoning about Programs as State Relations (Extended Abstract) . In: SCSS 2010, Mohamed Mosbah and Tudor Jebelean (ed.), Proceedings of Symbolic Computation in Software Science, Hagenberg, Austria, July 29-30, pp. -.2010.ISBN XXX-X-XXXXXX-XXX-X.[pdf][bib]
Ahmad Mohamed Hisham Ismail.Remotely Controlling a Mechanical Laboratory via the Internet. Internationaler Universitaetslehrgang Informatics: Engineering & Management. Diploma Thesis.Johannes Kepler University, Linz, Austria,July2010.[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]
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 Mathematics517, pp. 207-218.2010.AMS,ISBN 978-0-8218-4869-2.[pdf][bib]
Flavia Stan.Algorithms for Special Functions: Computer Algebra and Analytical Aspects. RISC, Johannes Kepler University Linz. PhD Thesis.June2010.RISC technical report 10-19.[pdf][bib]
Laura Giuri.Automated Contract Generation and Document Management in the Context of Economic Promotional Business . Internationaler Universitätslehrgang Informatics: Engineering and Management (ISI), Johannes Kepler University Linz. Diploma Thesis.2010.[bib]
Dietmar Kerbl.An automated induction prover for finite sets implemented in the Theorema system. RISC, Johannes Kepler University Linz. Diploma Thesis.October2010.[pdf][bib]
2009
Jakob Ablinger.A Computer Algebra Toolbox for Harmonic Sums Related to Particle Physics. Johannes Kepler University. Diploma Thesis.February2009.[pdf][bib]
Karoly Bosa, Wolfgang Schreiner.A Supercomputing API for the Grid. In: Proceedings of 3rd Austrian Grid Symposium 2009, J. Volkert, T. Fahringer, D. Kranzlmuller, R. Kobler, W. Schreiner (ed.), Proceedings of 3rd Austrian Grid Symposium, pp. 38-52.September 28-292009.Austrian Computer Society (OCG),Austrian Grid,ISBN 978-33-85403-269-4.[url][pdf][bib]
Wolfgang Schreiner, Karoly Bosa, Andreas Langegger, Thomas Leitner, Bernhard Moser, Szilard Pall, Volkmar Wieser, Wolfram Wöß .Parallel, Distributed, and Grid Computing. In: Hagenberg Research, B. Buchberger, M. Affenzeller, A. Ferscha, M. Haller, T. Jebelean, E. P. Klement, P. Paule, G. Pomberger, W. Schreiner, R. Stubenrauch, R. Wagner, G. Weiss, W. Windsteiger (ed.), Chapter VII, pp. 333-378.2009.Springer,Berlin,ISBN 78-3-642-02126-8.[url][bib]
R. Vajda, T. Jebelean, B. Buchberger.Combining Logical and Algebraic Techniques for Natural Style Proving in Elementary Analysis.Mathematics and Computers in Simulation79(8), pp. 2310-2316.April2009.Elsevier,ISSN: 0378-4754.Special Issue on Nonstandard Applications of Computer Algebra.[url][pdf][bib]
Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger.A Symbolic Framework for Operations on Linear Boundary Problems. In: Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing , Gerdt, Vladimir P.; Mayr, Ernst W.; Vorozhtsov, Evgenii H. (ed.), Proceedings of CASC '09, Kobe, Japan, LNCS5743, pp. 269-283.September2009.Springer-Verlag,ISBN: 978-3-642-04102-0.Also available as RICAM Report 09-10, May 2009.[url][bib]
Tudor Jebelean, Bruno Buchberger, Temur Kutsia, Nikolaj Popov, Wolfgang Schreiner, Wolfgang Windsteiger.Automated Reasoning. In: Hagenberg Research, B. Buchberger, M. Affenzeller, A. Ferscha, M. Haller, T. Jebelean, E.P. Klement, P. Paule, G. Pomberger, W. Schreiner, R. Stubenrauch, R. Wagner, G. Weiss, W. Windsteiger (ed.), pp. 63-101.2009.Springer Dordrecht Heidelberg London New York,ISBN 978-3-642-02126-8.[url][bib]
Peter Paule, Bruno Buchberger, Lena Kartashova, Manuel Kauers, Carsten Schneider, Franz Winkler.Algorithms in Symbolic Computation. In: Hagenberg Research, Bruno Buchberger et al. (ed.), Chapter 1, pp. 5-62.2009.Springer,978-3-642-02126-8.[doi][pdf][bib]
B. Buchberger.Lets Solve! A Gentle Introduction to Groebner Bases for High-School Students. In: Introduction to Mathematica, C. Miyaji (ed.), pp. 206-232.2009.TDU Publishing,Tokyo,000.[bib]
Cha Yongjae, van Hoeij Mark.Liouvillian solutions of irreducible linear difference equations. In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, John May (ed.), ISSAC '09, pp. 87-94.2009.ACM,New York, NY, USA,ISBN 978-1-60558-609-0.[doi][bib]
Dominici Diego.Asymptotic analysis of the Bell polynomials by the ray method.J. Comput. Appl. Math.233(3), pp. 708-718.2009. ISSN 0377-0427.[doi][bib]
Dominici Diego.A few observations on the Collatz problem.Int. J. Appl. Math. Stat.14(J09), pp. 97-107.2009. ISSN 0973-1377.[bib]
Dominici Diego.Polynomial solutions of nonlinear integral equations.J. Phys. A42(20), pp. 205201, 8-205201, 8.2009. ISSN 1751-8113.[doi][bib]
Besik Dundua, Temur Kutsia, Mircea Marin.Strategies in P$\rho$Log. In: 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'09), Maribel Fernandez (ed.), pp. 19-25.2009.-.[pdf][bib]
Madalina Erascu, Tudor Jebelean.A Calculus for Imperative Programs: Formalization and Implementation. In: Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing , S. Watt, V. Negru, T. Ida, T. Jebelean, D. Petcu, D. Zaharie (ed.), pp. 77- 84.2009.IEEE , 978-0-7695-3964-5.[pdf][bib]
Tamás Bérczes, Gábor Guta, Gábor Kusper, Wolfgang Schreiner, János Sztrik.Analyzing a Proxy Cache Server Performance Model with the Probabilistic Model Checker PRISM. In: WWV'09, 5th Int'l Workshop on Automated Specification and Verification of Web Systems, Demis Ballis, Temur Kutsia (ed.), pp. -.July2009.Hagenberg, Austria,-.[pdf][bib]
Gábor Guta, Wolfgang Schreiner, Dirk Draheim.A Lightweight MDSD Process Applied in Small Projects. In: Proc. of 35th EuroMicro Conference, Software Engineering and Advanced Applications (SEEA), - (ed.), pp. -.2009.-.[bib]
K. Wolfmaier, R. Ramler, G. Guta, H. Dobler.Observable Runtime Behavior for Defects Indicated by Automated Static Analysis. In: Proc. of 12th International Conference on Computer Aided Systems Theory (EuroCAST 2009), - (ed.), pp. -.2009.-.[bib]
M.D. Bustamante, E. Kartashova.Dynamics of nonlinear resonances in Hamiltonian systems.Europhysics Letters 85, pp. 14004-6.2009.IOP ,0295-5075 (print) , 1286-4854 (online).[url][pdf][bib]
M.D. Bustamante, E. Kartashova.Effect of the dynamical phases on the nonlinear amplitudes' evolution.Europhysics Letters 85, pp. 34002-5.2009.IOP ,ISSN (print edition): 0295-5075 ISSN (online): 1286-4854.[url][pdf][bib]
E. Kartashova.Dynamics of Nonlinear Resonaces. In: Geophysical research Abstracts, E. Pelinovsky, C. Kharif (ed.), Proceedings of European Geosciences Union, General Assembly 2009, pp. 3232-1.2009.European Geophysical Union,issn.[url][bib]
A. Constantin, E. Kartashova.Effect of non-zero constant vorticity on the nonlinear resonances of capillary water waves.EPL86, pp. 29001-6.2009.ISSN (print edition): 0295-5075 ISSN (online): 1286-4854.[url][pdf][bib]
E. Kartashova.Nonlinear resonances of water waves.DCDS Series B12(3), pp. 607-621.2009.American Institute of Mathematical Sciences,ISSN 1531-3492 (print) ISSN 1553-524X (electronic).[url][pdf][bib]
E. Kartashova, M. Lvov.Austrian-Ukrainian Project CENREC as example of information support of activity of international scientific community.Informational technologies in education1(3), pp. 57-63.2009.Kherson State University,1998-6939.[url][bib]
E. Kartashova.Discrete Wave Turbulence.Europhysics Letters87, pp. 44001-p5.2009. 0295-5075 (print) , 1286-4854 (online).EDITOR CHOICE.[url][pdf][bib]
Frederic Chyzak, Manuel Kauers, Bruno Salvy.A Non-Holonomic Systems Approach to Special Function Identities. In: Proceedings of ISSAC'09, John May (ed.), pp. 111-118.2009.978-1-60558-609-0.[ps][pdf][bib]
Alin Bostan, Manuel Kauers.Automatic Classification of Restricted Lattice Walks. In: Proceedings of FPSAC'09, Christian Krattenthaler, Volker Strehl, and Manuel Kauers (ed.), pp. 201-215.2009.[ps][pdf][bib]
Manuel Kauers, Christoph Koutschan.A Mathematica Package for q-Holonomic Sequences and Power Series.The Ramanujan Journal19(2), pp. 137-150.2009.Springer,ISSN 1382-4090.[ps][pdf][bib]
Manuel Kauers, Christoph Koutschan, Doron Zeilberger.A Proof of George Andrews' and Dave Robbins' q-TSPP-Conjecture (modulo a finite amount of routine calculations).The personal Journal of Ekhad and Zeilberger, pp. 1-8.January2009.[url][ps][pdf][bib]
Manuel Kauers, Christoph Koutschan, Doron Zeilberger.Proof of Ira Gessel's Lattice Path Conjecture.Proceedings of the National Academy of Sciences106(28), pp. 11502-11505.July2009.ISSN 0027-8424.[ps][pdf][bib]
Christoph Koutschan.Advanced Applications of the Holonomic Systems Approach. RISC-Linz, Johannes Kepler University. PhD Thesis.September2009.[url][pdf][bib]
Jorge Coelho, Mario Florido, Temur Kutsia.Collaborative Schema Construction using Regular Sequence Types. In: Proceedings of the 2009 IEEE International Conference of Information Reuse and Integration (IRI'09), Kang Zhang, Reda Alhajj (ed.), pp. 290-295.2009.ISBN 978-1-4244-4114-3 .[pdf][bib]
Temur Kutsia, Mircea Marin.Order-Sorted Unification with Regular Expression Sorts. In: Proc. UNIF/ADDCT 2009, Christopher Lynch et al. (ed.), pp. 2-16.2009.-.[pdf][bib]
Temur Kutsia, Mircea Marin.Matching of Order-Sorted Terms with Regular Expression Sorts and Second-Order Variables . In: Proc. SCSS 2009, Adel Bouhoula, Tetsuo Ida (ed.), pp. -.2009.-.[bib]
Günther Mayrhofer.Symbolic Computation Prover with Induction. Johannes Kepler University. Diploma Thesis.September2009.[pdf][bib]
Karin Nachbagauer.Power Series Solutions to Holonomic Differential Equations and the General Algebraic Equation. Johannes Kepler University Linz. Diploma Thesis.2009.The thesis also appeared as RISC report 09-15..Diploma thesis.[pdf][bib]
Peter Paule.The Renaissance of Algorithmic Mathematics. In: Hagenberg Research, Peter Paule (ed.), pp. 6-15.2009.Springer Berlin-Heidelberg,978-3-642-02126-8.[bib]
D. Braess, V. Pillwein, J. Schöberl.Equilibrated Residual Error Estimates are $p$-Robust.Comput. Methods Appl. Mech. Engrg.198, pp. 1189-1197.2009.[ps][pdf][bib]
N. Popov, T. Jebelean.Using Computer Algebra Techniques for the Specification, Verification and Synthesis of Recursive Programs.Mathematics and Computers in Simulation79(8), pp. 2293-2301.April2009.Elsevier,ISSN: 0378-4754.[pdf][bib]
N. Popov, T. Jebelean.Verification of Mutual Recursive Functional Programs. In: Proceedings of Workshop on Symbolic Computation in Software Science SCSS'09, T. Ida, A. Bouhoula (ed.), pp. 120-122.September2009.Carthage, Tunisia,..[pdf][bib]
N. Popov, T. Jebelean.Functional Program Verification in Theorema. Soundness and Completeness. In: Proceedings of 15th Biennial Workshop on Programmiersprachen und Grundlagen der Programmierung KPS'09, J. Knoop, A. Prantl (ed.), pp. 221-229.October2009.Maria Taferl, Austria,..[pdf][bib]
N. Popov, T. Jebelean.A Complete Method for Algorithm Validation. In: Proceedings of the Workshop on Automated Mathematical Theory Exploration AUTOMATHEO'09, B. Buchberger, R. McCasland, A. Craciun (ed.), pp. 21-25.June2009.Hagenberg, Austria,-.[pdf][bib]
Silviu Radu.An algorithmic approach to Ramanujan congruences .Ramanujan Journal20(2), pp. 215-251.2009.1382-4090 .[doi][pdf][bib]
Georg Regensburger, Markus Rosenkranz, Johannes Middeke.A skew polynomial approach to integro-differential operators. In: Proceedings of ISSAC 2009, Jeremy R. Johnson, Hyungju Park, Erich Kaltofen (ed.), Proceedings of Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, pp. 287-294.2009.ACM,978-1-60558-609-0.[url][pdf][bib]
Camelia Rosenkranz.Retrieval and Structuring of Large Mathematical Knowledge Bases in Theorema. Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Austria. PhD Thesis.Available as RISC Technical Report 09-04,February2009.[pdf][bib]
I. Bierenbaum, J. Bl�mlein, S. Klein, C. Schneider.Difference equations in massive higher order calculations. In: Proc. ACAT 2007, - (ed.)PoS(ACAT)082, pp. 1-15.2009.ISSN 18248039.arXiv:0707.4659 [math-ph].[doi][pdf][bib]
S. Moch, C. Schneider.Feynman integrals and difference equations. In: Proc. ACAT 2007, - (ed.)PoS(ACAT)083, pp. 1-11.2009.ISSN 18248039.[doi][pdf][bib]
C. Schneider, R. Osburn.Gaussian Hypergeometric series and supercongruences.Math. Comp.78(265), pp. 275-292.2009.ISSN 0025-5718.arXiv:math/0610281 [math.NT].[doi][pdf][bib]
J. Bluemlein, M. Kauers, S. Klein, C. Schneider.Determining the closed forms of the {$O(a_s^3)$} anomalous dimensions and {W}ilson coefficients from {M}ellin moments by means of computer algebra.Comput. Phys. Comm. 180, pp. 2143-2165.2009.ISSN 0010-4655.arXiv:0902.4091 [hep-ph].[doi][pdf][bib]
J. Bluemlein, M. Kauers, S. Klein, C. Schneider.From moments to functions in higher order QCD . In: XII Advanced Computing and Analysis Techniques in Physics Research, - (ed.)PoS(ACAT08)106, pp. 1-7.2009.ISSN 1824-8039.arXiv:0902.4095 [hep-ph].[doi][pdf][bib]
Wolfgang Schreiner.On Proving Assistants in the Classroom (and Elsewhere). In: CADGME 2009, Computer Algebra and Dynamic Geometry Systems in Mathematics Education , Csaba Sarvari et al. (ed.), pp. XX-XX.2009.ISBN XXXXXXXX.RISC, Castle of Hagenberg, Austria, July 11-13, 2009.[pdf][bib]
Amira Zaki.Re-engineering of a Grid Aware Medical Database System Based on a Metamodel. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.July2009.[pdf][bib]
Stefan Georgiev.Evaluation of Cluster Middleware in a Heterogeneous Computing Environment. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.July2009.[pdf][bib]
Zsuzsanna Sinka.Interactive Tools for Inspecting Proofs in Theorema. International Studies in Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.July2009.Master's Thesis.[pdf][bib]
Flavia Stan.Computer-Assisted Proofs of Special Function Identities Related to Poisson Integrals.The Ramanujan Journal20(1), pp. 55-67.2009.Springer,ISSN 1382-4090.[pdf][bib]
T. Thanatipanonda and D. Zeilberger.A Symbolic Finite-State Approach For Automated.Journal of Difference Equations and Applications15, pp. 111-118.2009.1023-6198.[pdf][bib]
T. Thanatipanonda.On the Monochromatic Schur Triples Type Problem.Electronic Journal of CombinatoricsR14 of Volume 16(1), pp. 1-10.2009.1077-8926.[pdf][bib]
Vajda Robert.An e-learning environment for elementary analysis: combining computer algebra, graphics and automated reasoning .Teaching Mathematics and Computer Science7(1), pp. 13-34.2009.University of Debrecen, Hungary,ISSN 1589 - 7389.[bib]
Vajda Robert.Supporting Exploration in Elementary Analysis by Computational, Graphical and Reasoning Tools. Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Austria. PhD Thesis.June2009.[pdf][bib]
Manuela Wiesinger.Contributions to MacMahon's Partition
Analysis. Johannes Kepler University. Diploma Thesis.January2009.RISC Report 09-05.[pdf][bib]
F. Winkler.Canonical Reduction Systems in Symbolic Mathematics. In: Proc. 3rd International Conference on Algebraic Informatics, S. Bozapalidis, G. Rahonis (ed.)5725, pp. 123-135.2009.Springer-Verlag,978-3-642-03563-0.[bib]
Hemmer Michael, Tsigaridas Elias P., Zafeirakopoulos Zafeirakis, Emiris Ioannis Z., Karavelas Menelaos I., Mourrain Bernard.Experimental evaluation and cross-benchmarking of univariate real solvers. In: SNC '09: Proceedings of the 2009 conference on Symbolic numeric computation, Hiroshi Kai, Hiroshi Sekigawa (ed.), pp. 45-54.2009.ACM,New York, NY, USA,ISBN 978-1-60558-664-9.[bib]
2008
Karoly Bosa, Wolfgang Schreiner.The Porting of a Medical Grid Application from Globus 4 to the gLite Middleware. In: Proceedings of DAPSYS 2008, Peter Kacsuk at al. (ed.), Proceedings of DAPSYS 2008, 7th INTERNATIONAL CONFERENCE ON DISTRIBUTED AND PARALLEL SYSTEMS, pp. 51-61.September2008.Springer,Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria,ISBN-13: 978-0-387-79447-1.[url][pdf][bib]
B. Buchberger, G. Regensburger, M. Rosenkranz, L. Tec.General Polynomial Reduction with Theorema Functors: Applications to Integro-Differential Operators and Polynomials .SIGSAM Bulletin42(3), pp. 135-137.September2008.ISSN 0163-5824.Extended abstract from ISSAC 2008 poster presentation.[url][bib]
Adrian Craciun.Lazy Thinking Algorithm Synthesis in Gröbner Bases Theory. Research Institute for Symbolic Computation (RISC). PhD Thesis.2008.[pdf][bib]
Dominici Diego.Variations on a theme by James Stirling.Note Mat.28(1), pp. 1-13.2008.ISBN 978-88-548-2267-2 ISSN 1123-2536.[bib]
Knessl Charles, Dominici Diego Ernesto.Asymptotic analysis of a fluid model modulated by an $M/M/1$ queue.Adv. in Appl. Probab.40(3), pp. 856-881.2008. ISSN 0001-8678.[doi][bib]
Dominici Diego.Some properties of the inverse error function. In: Tapas in experimental mathematics, Amdeberhan, Tewodros and Moll, Victor H. (ed.), Contemp. Math.457, pp. 191-203.2008.Amer. Math. Soc., Providence, RI,978-0-8218-4317-8.[doi][bib]
Dominici Diego.Asymptotic analysis of generalized Hermite polynomials.Analysis (Munich)28(2), pp. 239-261.2008. ISSN 0174-4747.[doi][bib]
Dominici Diego.Asymptotic analysis of the Krawtchouk polynomials by the WKB method.Ramanujan J.15(3), pp. 303-338.2008. ISSN 1382-4090.[doi][bib]
Diego Dominici.An application of Kapteyn series to a problem from queueing theory. In: Special Issue: Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Zürich 2007, Rolf Jeltsch (ed.), PAMM, Proceedings in Applied Mathematics and Mechanics7/1, pp. 2050005-2050006.2008.WILEY-VCH Verlag GmbH & Co,1617-7061.[bib]
Madalina Erascu, Tudor Jebelean.Practical Program Verification by Forward Symbolic Execution: Correctness and Examples. In: Austrian-Japan Workshop on Symbolic Computation in Software Science, Bruno Buchberger, Tetsuo Ida, Temur Kutsia (ed.)08-08, pp. 47-56.2008.RISC Report Series, University of Linz, Austria,[pdf][bib]
Madalina Erascu.Automated Formal Static Analysis and Retrieval of Source Code. International School for Informatics - Johannes Kepler University . Diploma Thesis.August2008.in RISC Raport Series 08-21.[pdf][bib]
Elena Kartashova.Kinematic Theory of Nonlinear Resonances.10,Geophysical Research Abstracts edition,2008. EGU (European Geophysical Union),isbn.[pdf][bib]
E. Kartashova, V. L`vov.Cluster Dynamics of Planetary Waves.Europhys. Letters83, pp. 50012-6.2008.ISSN: 0295-5075 (Print) 1286-4854 (Online).[url][pdf][bib]
E. Kartashova, S. Nazarenko, O. Rudenko.Resonant interactions of nonlinear water waves in a finite basin.Physical Review E78 (016304), pp. 1-9.2008.American Physical Society,1539-3755 (print) , 1550-2376 (online).[url][pdf][bib]
Manuel Kauers.Solving Difference Equations whose Coefficients are not Transcendental.Theoretical Computer Science401(1-3), pp. 217-227.July2008.ISSN 0304-3975.[ps][pdf][bib]
Manuel Kauers, Doron Zeilberger.The Quasi-Holonomic Ansatz and Restricted Lattice Walks.Journal of Difference Equations and Applications14(10-11), pp. 1119-1126.2008.ISSN 1023-6198.to appear.[pdf][ps][bib]
Manuel Kauers, Doron Zeilberger.Experiments with a Positivity Preserving Operator.Experimental Mathematics17(3), pp. 341-345.2008.ISSN 1058-6458.[ps][pdf][bib]
Manuel Kauers.Fast Solvers for Dense Linear Systems.Nuclear Physics B (Proc. Suppl.)183, pp. 245-250.2008.ISSN 0550-3213.[pdf][ps][bib]
Manuel Kauers.Integration of Algebraic Functions: A Simple Heuristic for Finding the Logarithmic Part. In: Proceedings of ISSAC'08, David Jeffrey (ed.), Proceedings of ISSAC'08, pp. 133-140.2008.978-1-59593-904-3.[ps][pdf][bib]
Manuel Kauers.Computer Algebra for Special Function Inequalities. In: Tapas in Experimental Mathematics, Tewodros Amdeberhan, Victor Moll (ed.), Contemporary Mathematics457, pp. 215-235.2008.AMS,ISBN 978-0-8218-4317-8.[ps][pdf][bib]
Christoph Koutschan.Regular Languages and Their Generating Functions: The Inverse Problem.Theoretical Computer Science391(1-2), pp. 65-74.2008.ISSN 0304-3975.[ps][pdf][bib]
Christoph Koutschan, Viktor Levandovskyy.Computing one of Victor Moll's irresistible integrals with computer algebra.Computer Science Journal of Moldova16(1(46)), pp. 35-49.2008.ISSN 1561-4042.[pdf][bib]
Tudor Jebelean, Gabor Kusper.Multi-Domain Logic and its Applications to SAT. In: SYNASC 2008, V. Negru et. al. (ed.), Proceedings of International Simposium on Symbolic and Numeric Scientific Computation, pp. 3-8.2008.IEEE Society Press,978-0-7695-3523-4.[pdf][bib]
Temur Kutsia.Flat Matching.JSC43(12), pp. 858-873.2008.ISSN 0747-7171.[url][pdf][bib]
Imre Zoltan Matko.Grid-aware Database Support for Medical Software. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.July2008.[pdf][bib]
Kenji Miyamoto.Parallel Algorithms for Sparse Matrices in an Industrial Optimization Software. Internationaler Universitätslehrgang Informatics: Engineering & Management (ISI Hagenberg). Diploma Thesis.July2008.[pdf][bib]
S. Bouchard, C. M. Gosselin, B. Moore.On the ability of a cable-driven robot to generate a prescribed set of wrenches. In: Proc. of the ASME International Design Engineering Technical Conferences, Mechanics and Robotics Conference, . (ed.), pp. -.2008...[pdf][bib]
William Y. C. Chen, Peter Paule, Husam L. Saad.Converging to Gosper's Algorithm.Adv. in Appl. Math.41(3), pp. 351-364.2008.0196-8858.[bib]
S. Beuchler, V. Pillwein.Completions to sparse shape functions for triangular and tetrahedral p-FEM. In: Domain Decomposition Methods in Science and Engineering XVII, U. Langer and M. Discacciati and D.E. Keyes and O.B. Widlund and W. Zulehner (ed.), Lecture Notes in Computational Science and Engineering60, pp. 435-442.2008.Springer,Heidelberg,Proceedings of the 17th International Conference on Domain Decomposition Methods held at St. Wolfgang / Strobl, Austria, July 3-7, 2006.[bib]
V. Pillwein.Positivity of certain sums over Jacobi kernel polynomials.Adv. in Appl. Math.41(3), pp. 365-377.2008.doi:10.1016/j.aam.2007.12.001.[pdf][ps][bib]
Veronika Pillwein.Computer Algebra Tools for Special Functions in High Order Finite Element Methods. Johannes Kepler University Linz. PhD Thesis.2008.[ps][pdf][bib]
N. Popov, T. Jebelean.A Prototype Environment for Verification of Recursive Programs. In: FORMED'08, Z. Istenes (ed.), Proceedings of Formal Methods in Computer Science Education, Budapest, Hungary, ENTCS, pp. 121-130.March2008.Elsevier,..[pdf][bib]
Nikolaj Popov.Functional Program Verification in Theorema. RISC, Johannes Kepler University. PhD Thesis.July2008.Technical report no. 08-12 in RISC Report Series.[pdf][bib]
N. Popov, T. Jebelean.Verification of Functional Programs Containing Nested Recursion . In: SCSS'08, B. Buchberger, T. Ida and T. Kutsia (ed.), Proceedings of Austrian-Japan Workshop on Symbolic Computation in Software Science, Hagenberg, Austria, pp. 163-175.July2008...[pdf][bib]
E. Kartashova, C. Raab, Ch. Feurer, G. Mayrhofer, W. Schreiner.Symbolic Computations for Nonlinear Wave Resonances. In: "Extreme Ocean Waves", E. Pelinovsky, Ch. Kharif (ed.), pp. 97-128.2008.Springer,ISBN: 978-1-4020-8313-6.[url][pdf][bib]
C. Schneider.A Refined Difference Field Theory for Symbolic Summation.J. Symbolic Comput.43(9), pp. 611-644.2008. ISSN 0747-7171.arXiv:0808.2543 [cs.SC].[doi][pdf][bib]
Manuel Kauers , Carsten Schneider.Automated Proofs for Some Stirling Number Identities.The Electronic Journal of Combinatorics15(1), pp. 1-7.2008.ISSN 1077-8926.R2.[doi][ps][pdf][bib]
M. Kuba, H. Prodinger, C. Schneider.Generalized Reciprocity Laws for Sums of Harmonic Numbers.INTEGERS. Electronic Journal of Combinatorial Number Theory8(A17), pp. 1-20.2008.ISSN 1553-1732.[url][pdf][bib]
I. Bierenbaum, J. Bluemlein, S. Klein, C. Schneider.Two-Loop Massive Operator Matrix Elements for Unpolarized Heavy Flavor Production to $O!(epsilon)$.Nucl.Phys. B803(1-2), pp. 1-41.November2008.ISSN: 0550-3213.arXiv:0803.0273 [hep-ph].[doi][pdf][bib]
Wolfgang Schreiner.The RISC ProofNavigator: A Proving Assistant for Program Verification in the Classroom.Formal Aspects of Computing, pp. -.April2008.Springer,London,ISSN 0934-5043.The original publication is available at www.springerlink.com. DOI 10.1007/s00165-008-0069-4.[doi][pdf][bib]
Dacian Tudor, Vladimir Cretu, Wolfgang Schreiner.Designing an Architecture for Distributed Shared Data on the Grid. In: Algorithms and Architectures for Parallel Processing, Anu G. Bourgeois and S. Q. Zheng (ed.), Proceedings of ICA3PP 2008, International Conference on Algorithms and Architectures for Parallel Processing, June 9-11, Agia Napa, Cyprus, Lecture Notes in Computer Science22, pp. 261-264.2008.Springer,ISBN 0302-9743.[pdf][bib]
Johannes Watzl.Investigations on Improving the SEE-GRID Optimization Algorithm. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Diploma Thesis.June2008.[pdf][bib]
Markus Stadlbauer.Integration von Entscheidungsprozeduren in einen interaktiven Beweisassistenten. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. Diploma Thesis.June2008.[pdf][bib]
Dacian Tudor, Georgiana Macariu, Wolfgang Schreiner, Vladimir Cretu .Experiences on Grid Shared Data Programming.Journal of Grid and Utility Computing (IJGUC), pp. 43-54.2008.Inderscience,ISSN 1741-847X.To appear.[pdf][bib]
E. Shemyakova, F. Winkler.On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators. In: Computer Mathematics - Proc. 8th Asian Symp. on Computer Mathematics (ASCM 2007), D. Kapur (ed.), Proceedings of ASCM 2007, Singapore, Dec. 2007, LNAI 5081, pp. 199-212.2008.Springer,ISSN 0302-9743, ISBN 978-3-540-87827-8.[pdf][bib]
T. Thanatipanonda.How to beat Capablanca.Advances in Applied40(2), pp. 226-233.February2008.0196-8858.[pdf][bib]
W. Windsteiger.Stimulating Students' Creativity Through Computer-Supported Experiments and Automated Theorem Proving. In: Promoting Creativity for all Students in Mathematics Education, Emiliya Velikova, Agnis Andzans (ed.), pp. 351-357.2008.8 Studentska Str., 7017 Rousse, Bulgaria,University of Rousse, Bulgaria,ISBN 978-954-712-420-2.Proceedings of Discussion Group 9, the 11th International Congress on Mathematical Education (ICME 11).[pdf][bib]
Ph. Kügler, W. Windsteiger.Algorithmische Methoden - Zahlen, Vektoren, Polynome.Reihe: Mathematik kompakt.1st edition,December2008.Birkhäuser Basel Boston Berlin,ISBN: 978-3-7643-8434-0.[url][bib]
M. Zhou, F. Winkler.Groebner bases in difference - differential modules and difference - differential dimension polynomials.Science in China Series A: Mathematics51(9), pp. 1732-1752.2008.ISSN 1006-9283.[pdf][pdf][bib]
M. Zhou, F. Winkler.Computing difference-differential dimension polynomials by relative Groebner bases in difference-differential modules.Journal of Symbolic Computation43(10), pp. 726-745.2008.ISSN 0747-7171.[pdf][bib]
Winkler, Sendra, Perez-Diaz.Rational Algebraic Curves - A Computer Algebra Approach.Algorithms and Computation in Mathematics22,Rational Algebraic Curves edition,2008.Springer Verlag Heidelberg,RISC,978-3-540-73724-7.[bib]
Alexander Zapletal.Compilation of Theorema Programs. RISC, Johannes Kepler University Linz. PhD Thesis.May2008.[pdf][bib]
S. Gerhold, L. Glebsky, C. Schneider, H. Weiss, B. Zimmermann.Computing the complexity for schelling segregation models.Communications in Nonlinear Science and Numerical Simulations13, pp. 2236-2245.2008.ISSN 1007-5704.[doi][pdf][bib]
Manuel Kauers, Burkhard Zimmermann.Computing the Algebraic Relations of C-finite Sequences and Multisequences.Journal of Symbolic Computation43(11), pp. 787-803.2008.ISSN 0747-7171..[ps][pdf][bib]
2007
Karoly Bosa, Wolfgang Schreiner, Michael Buchberger, Thomas Kaltofen.A Grid Software for Virtual Eye Surgery Based on Globus 4 and gLite. In: Proceedings of ISPDC 2007, IEEE Computer Society (ed.), Proceedings of ISPDC 2007, 6th International Symposium on Parallel and Distributed Computing, pp. 151-158.2007.0.[url][pdf][ps][bib]
A. Craciun, M. Hodorog.Decompositions of Natural Numbers: From A Case Study in Mathematical Theory Exploration. In: Proceedings of the 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC07), D. Petcu, V. Negru, D. Zaharie and T. Jebelean (ed.), pp. 1-8.26-29 September2007.West University of Timisoara, Romania,ISBN: 0-7695-3078-8.[pdf][bib]
Dominici Diego.Asymptotic analysis of the Hermite polynomials from their differential-difference equation.J. Difference Equ. Appl.13(12), pp. 1115-1128.2007. ISSN 1023-6198.[doi][bib]
Dominici Diego.A new Kapteyn series.Integral Transforms Spec. Funct.18(5-6), pp. 409-418.2007. ISSN 1065-2469.[doi][bib]
Dominici Diego.Asymptotic analysis of the Askey-scheme. I. From Krawtchouk to Charlier.Cent. Eur. J. Math.5(2), pp. 280-304.2007. ISSN 1895-1074.[doi][bib]
Dominici Diego.Some remarks on a paper by L. Carlitz: ``Some arithmetic properties of a special sequence of polynomials'' [Duke Math. J. bf 26 (1959), 583-590; MR0109230].J. Comput. Appl. Math.198(1), pp. 129-142.2007. ISSN 0377-0427.[doi][bib]
J.P. Bell, S. Gerhold. On the Positivity Set of a Linear Recurrence Sequence..Israel J. Math.157, pp. 333-345.2007.'ISSN' 0021-2172.[bib]
J.P. Bell, S. Gerhold, M. Klazar, F. Luca. Non-Holonomicity of Sequences defined via Elementary Functions.. Annals of Combinatorics, pp. ?-.2007.'ISSN' 0218-0006.To appear..[bib]
Martin Giese.First-Order Logic. In: Verification of Object-Oriented Software: The KeY Approach, Bernhard Beckert and Reiner Hähnle and Peter H. Schmitt (ed.), Chapter 2, LNCS4334, pp. 21-68.2007.Springer-Verlag,978-3-540-68977-5.[bib]
B. Beckert, M. Giese, R. Hähnle, V. Klebanov, P. Rümmer, S. Schlager, P. H. Schmitt.The KeY System 1.0 (Deduction Component). In: Proceedings of CADE-21, Bremen, Frank Pfenning (ed.), Proceedings of Conference on Automated Deduction, LNCS4603, pp. 379-384.2007.Springer,Heidelberg,ISBN 978-3-540-73594-6.[pdf][bib]
L. Ruff, T. Jebelean.Functional Based Synthesis of a Systolic Array for GCD Computation. In: Implementation and Application of Functional Languages, Z. Horvath, V. Zsok (ed.), LNCS4449, pp. 37-54.2007.Springer,978-3-540-74129-9.[bib]
E. Kartashova, V. L´vov.A model of intra-seasonal oscillations in the Earth atmosphere.Physical Review Letters 98(19), pp. 198501-4.May2007.American Physical Society,ISSN: 0031-9007 (print), ISSN 1079-7114 (electronic).THIS PAPER HAS BEEN FEATURED in "Nature Physics" , Vol. 3 (6), p.368 (IMPACT FACTOR: 12.04); http://www.nature.com/nphys/journal/v3/n6/full/nphys643.html.[url][pdf][bib]
E. Kartashova, A. Kartashov.Laminated wave turbulence: generic algorithms II.CiCP (Communications in Computational Physics)2(4), pp. 783-794.2007.ISSN 1815-2406 (print), 1991-7120 (electronic).[url][pdf][bib]
E. Kartashova, S. McCallum.Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators. In: Towards Mechanized Mathematical Assistants (Proc. of MKM and Calculemus 2007), Manuel Kauers, Manfred Kerber, Robert Miner, Wolfgang Windsteiger (ed.), Lecture Notes in Computer Science (LNCS)4573, pp. 106-115.2007.Springer, Heidelberg,ISSN 0302-9743.[url][pdf][bib]
E. Kartashova, A. Kartashov.Laminated wave turbulence: generic algorithms III.Physica A: Statistical Mechanics and Its Applications380, pp. 66-74.2007.Elsevier,0378-4371 (print).[url][pdf][bib]
E. Kartashova.Exact and quasi-resonances in discrete water-wave turbulence.Physical Review Letters98(21), pp. 214502-4.2007.American Physical Society,ISSN: 0031-9007 (print), ISSN 1079-7114 (electronic).[url][pdf][bib]
E. Kartashova, V. L`vov.Intra-seasonal ocsillations as nonlinear planetary wave interactions. In: Geophysical Research Abstracts, Eds. (ed.) Vol.9, pp. 1449-1449.2007.European Geoscience Union (EGU),issn.[url][pdf][bib]
E. Kartashova.The role of resonance conditions in the dynamics of nonlinear waves. In: Geophysical Research Abstracts, Eds. (ed.) Vol. 9, pp. 1445-1445.2007.European Geoscience Union (EGU),issn.[url][pdf][bib]
E. Kartashova.Coherent structures in wave turbulent transport - graph-theoretical approach. In: Geophysical Research Abstracts, Eds. (ed.) Vol. 9, pp. 1447-1447.2007.European Geoscience Union (EGU),issn.[url][pdf][bib]
Manuel Kauers.Computer Algebra and Power Series with Positive Coefficients. In: Proceedings of FPSAC'07, , pp. 1-7.2007.[ps][pdf][bib]
Manuel Kauers, Peter Paule.A Computer Proof of Moll's Log-Concavity Conjecture.Proceedings of the AMS135(12), pp. 3847-3856.December2007.ISSN 0002-9939.[ps][bib]
Horst Alzer, Stefan Gerhold, Manuel Kauers, Alexandru Lupas.On Turan's Inequality for Legendre Polynomials.Expositiones Mathematicae25(2), pp. 181-186.May2007.ISSN 0723-0869.[ps][pdf][bib]
Manuel Kauers.An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences.Transactions on Algorithms3(2), pp. 1-13.2007.1549-6325.article 18.[ps][pdf][bib]
Manuel Kauers.Summation Algorithms for Stirling Number Identities.Journal of Symbolic Computation42(10), pp. 948-970.October2007.ISSN 0747-7171.[ps][pdf][bib]
L. Kovacs.Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema. In: Proc. of WING'07, RISC, Austria, M. Giese and T. Jebelean (ed.), pp. 56-69.2007.-.RISC Report Series No. 07-07.[bib]
L. Kovacs.Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema. RISC, Johannes Kepler University Linz, Austria. PhD Thesis.October2007.RISC Technical Report No. 07-16.[pdf][bib]
L. Kovacs.Aligator: a Package for Reasoning about Loops. In: Proc. of 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), , pp. -.October2007.Yerevan, Armenia,Short paper. to appear.[bib]
B. Kronholm.On Congruence Properties of Consecutive Values of p(n, m).INTEGERS7(A16), pp. 1-6.2007.1553-1732.[url][pdf][bib]
Temur Kutsia.Solving Equations with Sequence Variables and Sequence Functions.JSC42(3), pp. 352-388.2007.ISSN 0747-7171.[url][pdf][bib]
T. Kutsia, J. Levy, M. Villaret.Sequence Unification Through Currying. In: Proceedings of the 18th International Conference on Rewriting Techniques and Applications (RTA'07), F. Baader (ed.), Lecture Notes in Computer Science4533, pp. 288-302.2007.ISBN 978-3-540-73447-5.[pdf][bib]
Jorge Coelho, Mario Florido, Temur Kutsia.Sequence Disunification and its Application in Collaborative Schema Construction. In: Web Information Systems - WISE 2007 Workshops, M. Weske, M.-S. Hacid, C. Godart (ed.), Lecture Notes in Computer Science4832, pp. 91-102.2007.Springer,ISSN 0302-9743.[url][bib]
G. Mayrhofer, S. Saminger, W. Windsteiger.CreaComp: Computer-Supported Experiments and Automated Proving in Learning and Teaching Mathematics. In: Proceedings of ICTMT8, Eva Milkova (ed.), pp. ?-?.2007.ISBN 978-80-7041-285-5.[pdf][bib]
G. Mayrhofer, S. Saminger, W. Windsteiger.CreaComp: Experimental Formal Mathematics for the Classroom. In: Symbolic Computation and Education, Shangzhi Li, Dongming Wang, and Jing-Zhong Zhang (ed.), pp. 94-114.2007.World Scientific Publishing Co.,Singapore, New Jersey,ISBN 978-981-277-599-3.[url][pdf][bib]
E. Kartashova, G. Mayrhofer.Cluster formation in mesoscopic systems.Physica A: Statistical Mechanics and Its Applications385, pp. 527-542.2007.Elsevier,0378-4371 (print)..[pdf][bib]
K. Nabeshima.Comprehensive Groebner bases in various domains. RISC-Linz. PhD Thesis.April2007.[ps][pdf][bib]
K. Nabeshima.A Speed-Up Algorithm for Computing Comprehensive Groebner Systems. In: ISSAC 2007, C. W. Brown (ed.), pp. 299-306.2007.ACM-press,978-1-59593-743-8.[ps][pdf][bib]
K. Nabeshima.Reduced Groebner Bases in Polynomial Rings over a Polynomial Ring.Mathematics in Computer Science1(2), pp. ??-??.2007.Brikhauser/Springer,to appear.[pdf][ps][bib]
F. Chyzak, P. Paule.Computer Algebra. In: The Digital Library of Mathematical Functions (DLMF), D. Lozier (ed.), pp. n/a-n/a.2007.National Institute of Standards and Technology (NIST),Gaithersburg, U.S.A.,electronic.In preparation.[bib]
George E. Andrews, Peter Paule.MacMahon's Partition Analysis XI: Broken diamonds and modular forms.Acta Arith.126, pp. 281-294.2007.ISSN 0065-1036.DOI: 10.4064/aa126-3-5.[bib]
G. E. Andrews and P. Paule.MacMahon's Partition Analysis XII: Plane Partitions.Journal of the London Mathematical Society76(3), pp. 647-666.2007.London Mathematical Society,0024-6107.[bib]
G.E. Andrews and P. Paule.MacMahon's Partition Analysis XI: The Search for Modular Forms.Acta Arithmetica 126, pp. 281-.2007.0.[bib]
S. Beuchler, V. Pillwein.Sparse shape functions for tetrahedral $p$-FEM using integrated Jacobi polynomials.Computing80(4), pp. 345-375.2007.[ps][pdf][bib]
N. Popov, T. Jebelean.Proving Termination of Recursive Programs by Matching Against Simplified Program Versions and Construction of Specialized Libraries in Theorema. In: Proceedings of 9-th International Workshop on Termination, D. Hofbauer, A. Serebrenik (ed.), pp. 48-52.June2007.Paris, France,ISSN-0935-3232.[pdf][bib]
Judit Robu.Automated Proof of Geometry Theorems Involving Order Relation in the Frame of the Theorema Project. In: Knowledge Engineering: Principles and Techniques, Horia F. Pop (ed.), Proceedings of Conference on Knowledge Engineering, Principles and Techniques, KEPT2007, Studia Universitatis "Babes-Bolyai", Series InformaticaSpecial Issue, pp. 307-315.2007.ISSN: 1224-869x.[pdf][bib]
C. Schneider, R. Pemantle.When is 0.999... equal to 1?.Amer. Math. Monthly114(4), pp. 344-350.2007.ISSN 0002-9890.arXiv:math/0511574 [math.CO].[doi][pdf][ps][bib]
C. Schneider.Parameterized telescoping proves algebraic independence of sums. In: Proceedings of the 19th international conference on formal power series and algebraic combinatorics, FPSAC'07, , pp. 1-12.2007.[url][pdf][bib]
C. Schneider.Simplifying Sums in ${Pi}{Sigma}^*$-Extensions.J. Algebra Appl.6(3), pp. 415-441.2007.ISSN: 0219-4988.Preliminary version online.[doi][ps][pdf][bib]
C. Schneider.Symbolic Summation Assists Combinatorics.Sem. Lothar. Combin.56, pp. 1-36.2007.ISSN 1286-4889.Article B56b.[url][pdf][ps][bib]
C. Schneider.Apery's Double Sum is Plain Sailing Indeed.Electron. J. Combin.14(N5), pp. 1-3.2007.ISSN 1077-8926.[doi][ps][pdf][bib]
M. Kauers, C. Schneider.Symbolic Summation with Radical Expressions. In: Proceedings of ISSAC'07, Christopher W. Brown (ed.), pp. 219-226.2007.isbn 978-1-59593-743-8.[doi][pdf][ps][bib]
P. Paule, C. Schneider.Truncating Binomial Series with Symbolic Summation.INTEGERS. Electronic Journal of Combinatorial Number Theory7(A22), pp. 1-9.2007.ISSN 1553-1732.[url][pdf][bib]
J. R. Sendra, F. Winkler, S. Pérez-Díaz.Rational Algebraic Curves - A Computer Algebra Approach.Algorithms and Computation in MathematicsVol. 22,1 edition,2007.Springer-Verlag Heidelberg,ISSN 1431-1550, ISBN 978-3-540-73724-7.[bib]
E.Shemyakova, F.Winkler.Obstacles to the Factorization of Linear Partial Differential Operators into Several Factors.Programming and Computer Software33(2), pp. 67-73.2007.ISSN 0361-7688.Original version in Russian "Programmirovanie".[pdf][pdf][bib]
E. Shemyakova.The Parametric Factorizations of Second-, Third- and Fourth-Order Linear Partial Differential Operators on the Plane.Mathematics in Computer Science1(2), pp. 0-0.2007.1661-8270.[bib]
Shemyakova.Symbolic-Algebraic Methods for Linear Partial Differential Operators. University of Linz, Austria. PhD Thesis.July2007.[pdf][bib]
E. Shemyakova, F. Winkler.A Full System of Invariants for Third-Order Linear Partial Differential Operators in General Form. In: Proc. 10th Workshop on Computer Algebra in Scientific Computing (CASC-2007), V. G. Ghanza, E. W. Mayr, E. V. Vorozhtov (ed.), Proceedings of CASC-2007, Bonn, Germany, LNCS 4770, pp. 360-369.2007.Springer,ISSN 0302-9743, ISBN 3-540-75186-6.[pdf][bib]
M. Zhou, F. Winkler.On Computing Groebner Bases in Rings of Differential Operators with Coefficients in a Ring.Mathematics in Computer Science1(2), pp. 211-223.2007.ISSN 1661-8270.[pdf][bib]
2006
Rebhi Baraka, Wolfgang Schreiner.Querying Registry-Published Mathematical Web Services. In: Proceedings of the IEEE 20th International Conference on Advanced Information Networking and Applications (AINA 2006), Vienna, Austria, Roland Wagner, Jianhua Ma, Arjan Durresi (ed.), pp. 767-772.April 18 - 202006.IEEE Computer Society,Los Alamitos,ISBN-13: 978-0-7695-2466-4.[pdf][bib]
Rebhi Baraka, Wolfgang Schreiner.Semantic Querying of Mathematical Web Service Descriptions. In: Proceedings of the Third International Workshop on Web Services and Formal Methods (WS-FM 2006), Vienna, Austria, M. Bravetti, M. Nunez, and Gianluigi Zavattaro (ed.), Lecture Notes in Computer ScienceLNCS/4184, pp. 73-87.September 8-92006.Springer-Verlag,Berlin Heidelberg,3-540-38862-1.[bib]
Rebhi Baraka.A Framework for Publishing and Discovering Mathematical Web Services.. RISC, Johannes Kepler University Linz. PhD Thesis.2006.[bib]
Tobias Beck.Contributions to the Parametrization of Algebraic Varieties.. RISC, Johannes Kepler University Linz. PhD Thesis.2006.[bib]
J. Robu, D. Tepeneu, T. Ida, H. Takahashi, B. Buchberger.Computational Origami Construction of a Regular Heptagon with Automated Proof of its Correctness. In: Proceedings of ADG 2004 (The Fifth International Workshop on Automated Deduction in Geometry), Hoon Hong, Dongming Wang (ed.), Lecture Notes in Computer Science3763, pp. 19-33.2006.Springer Berlin / Heidelberg,University of Florida, Gainesville, FL, USA,ISBN 978-3-540-31332-8.[bib]
W. Windsteiger, B. Buchberger, M. Rosenkranz.Theorema. In: The Seventeen Provers of the World, Freek Wiedijk (ed.), Lecture Notes in Artificial Intelligence (LNAI)3600, pp. 96-107.2006.Springer Berlin Heidelberg New York,ISBN 3-540-30704-4.[url][pdf][bib]
B. Buchberger, A. Craciun, T. Jebelean, L. Kovacs, T. Kutsia, K. Nakagawa, F. Piroi, N. Popov, J. Robu, M. Rosenkranz, W. Windsteiger.Theorema: Towards Computer-Aided Mathematical Theory Exploration.Journal of Applied Logic4(4), pp. 470-504.2006.ISSN 1570-8683.[doi][pdf][bib]
M. Hodorog, A. Craciun.Scheme-Based Systematic Exploration of Natural Numbers. In: Proc. of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC06), D. Petcu, V. Negru, D. Zaharie, T. Jebelean (ed.), pp. 23-34.26-29 September2006.Department of Computer Science, West University of Timisoara, Romania,ISBN:0-7695-2740-X.[pdf][bib]
Dominici Diego, Knessl Charles.Ray solution of a singularly perturbed elliptic PDE with applications to communications networks.SIAM J. Appl. Math.66(6), pp. 1871-1894.2006. ISSN 0036-1399.[doi][bib]
Dominici Diego.Asymptotic analysis of powers of matrices.Int. J. Math. Math. Sci., pp. Art. ID 79617, 12-A.2006. ISSN 0161-1712.[doi][bib]
Guenther Fuchs.Logic Foundation of Geometry and Didactics. RISC, Johannes Kepler University Linz. PhD Thesis.2006.[bib]
Martin Giese.Saturation up to Redundancy for Tableau and Sequent Calculi. In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th Intl. Conf., LPAR 2006, Phnom Penh, Cambodia, Miki Hermann and Andrei Voronkov (ed.), Proceedings of LPAR06, LNCS4246, pp. 182-196.2006.Springer,3540482814.[pdf][bib]
Martin Giese.Superposition-based Equality Handling for Analytic Tableaux.Journal of Automated Reasoning38(1-3), pp. 127-153.December2006.1573-0670.Appeared online 2 December 2006, in print April 2007.[doi][bib]
Gabor Guta.Towards error-free software.IT-Business (Hungary)4(38), pp. 26-27.2006.Vogel Burda Communications,ISSN 1589-3464.[bib]
E. Kartashova.A model of laminated turbulence.Letters JETP (Letters to Journal of Experimental and Theoretical Physics)83(7), pp. 341-345.April2006.Springer,ISSN: 0021-3640 (print) 1090-6487 (electronic).[doi][pdf][bib]
E. Kartashova.A Hierarchy of Generalized Invariants for Linear Partial Differential Operators.TMPh (Journal of Theoretical and Mathematical Physics)147(3), pp. 839-846.June2006.Springer,ISSN: 0040-5779 (print), 1573-9333 (electronic).[doi][pdf][bib]
E. Kartashova.Fast Computation Algorithm for Discrete Resonances among Gravity Waves.JLTP (Journal of Low Temperature Physics)145(1), pp. 287-295.2006.Springer,ISSN: 0022-2291 (print).[url][pdf][bib]
E. Kartashova.BK-factorization as a link between symbolics and numerics. In: Book of abstracts, GAMM 2006, editor (ed.), Proceedings of GAMM 2006, pp. 413-414.2006.issn.[bib]
E. Kartashova.Theory of laminated wave turbulence: open questions. In: GIFT-2006, Proceedings, J. Calmet, W.M. Seiler, R.W. Tucker (ed.), pp. 201-224.2006.Universitätsverlag Karlsruhe,ISBN: 3-86644-035-9.[url][pdf][bib]
E. Kartashova, A. Kartashov.Laminated wave turbulence: generic algorithms I.IJMPC (International Journal of Modern Physics C)17(11), pp. 1579-1596.2006.World Scientific,ISSN: 0129-1831 (print).[url][pdf][bib]
E. Kartashova, O. Rudenko.Invariant Form of BK-factorization and its Applications. In: GIFT-2006, Proceedings, J. Calmet, W.M. Seiler, R.W. Tucker (ed.), Proceedings of GIFT-2006, pp. 225-241.2006.Universitätsverlag Karlsruhe,ISBN: 3-86644-035-9.[url][pdf][bib]
Stefan Gerhold, Manuel Kauers.A Computer Proof of Turan's Inequality.Journal of Inequalities in Pure and Applied Mathematics7(2), pp. 1-4.May2006.Article 42.[ps][bib]
Manuel Kauers.SumCracker - A Package for Manipulating Symbolic Sums and Related Objects.Journal of Symbolic Computation41(9), pp. 1039-1057.2006.ISSN 0747-7171.[ps][pdf][bib]
Manuel Kauers.Shift Equivalence of P-finite Sequences.The Electronic Journal of Combinatorics13(1), pp. 1-16.2006.ISSN 1077-8926.R100.[ps][pdf][bib]
T. Jebelean, L. Kovacs, N. Popov.Experimental Program Verification in the Theorema System.Int. Journal on Software Tools for Technology Transfer (STTT), pp. _-_.2006.Springer, ISSN: 1433-2779 (Paper) 1433-2787 (Online).in press.[pdf][bib]
L. Kovacs, T. Jebelean.Finding Polynomial Invariants for Imperative Loops in the Theorema System. In: Proceedings of Verify'06 Workshop, IJCAR'06, The 2006 Federated Logic Conference, S. Autexier and H. Mantel (ed.), pp. 52-67.August 15-162006.[url][pdf][bib]
L. Kovacs, N. Popov, T. Jebelean.Combining Logic and Algebraic Techniques for Program Verification in Theorema. In: Proceedings ISOLA 2006, T. Margaria, A. Philippou, B. Steffen (ed.), Proceedings of Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISOLA 2006), pp. 59-68.November2006.IEEE,Paphos, Cyprus,ISBN 978-0-7695-3071-0.[pdf][bib]
A. Kovacs, Gh. Tigan, L. Kovacs, C. Milici.Computer Assisted Mathematics (in romanian: "Matematic Superioare Asistae de Calculator").1st edition,2006.Politechnica Publisher, Timisoara,ISBN (10) 973-625-346-5, ISBN (13) 978-973-625-346-1.[bib]
Temur Kutsia, Mircea Marin.Solving Regular Constraints for Hedges and Contexts. In: Proceedings of 20th International Workshop on Unification, UNIF'06, Jordi Levy (ed.), pp. 89-107.2006.[pdf][bib]
Temur Kutsia.Context Sequence Matching for XML..Electronic Notes on Theoretical Computer Science157(2), pp. 47-65.2006.Elsevier,ISSN: 1571-0661.[pdf][bib]
V. Levandovskyy.Intersection of Ideals with Non-commutative Subalgebras. In: Proceedings of the ISSAC 2006 Conference, Jean-Guillaume Dumas (ed.), Proceedings of ISSAC 2006, pp. 212-219.July2006.ACM Press,1-59593-095-7.[bib]
V. Levandovskyy.PLURAL, a Non-commutative Extension of SINGULAR: Past, Present and Future. In: Mathematical Software - ICMS 2006, A. Iglesias, N. Takayama (ed.), Proceedings of International Congress on Mathematical Software, LNCS4151, pp. 144-157.September2006.0302-9743.[pdf][bib]
V. Levandovskyy, E. Zerz.Algebraic systems theory and computer algebraic methods for some classes of linear control systems. In: Proc. of the International Symposium on Mathematical Theory of Networks and Systems (MTNS'06), Y. Yamamoto (ed.), Proceedings of International Symposium on Mathematical Theory of Networks and Systems (MTNS'06), pp. -.July2006.1234-8765.[pdf][bib]
Glauco Alfredo Lopez Diaz.Symbolic Methods for Factoring Linear Differential Operators. RISC. PhD Thesis.February2006.[pdf][ps][bib]
Mircea Marin, Temur Kutsia.Foundations of the Rule-Based System RhoLog. Journal of Applied Non-Classical Logics16(1-2), pp. 151-168.2006.ISBN 2-7462-1479-2.[pdf][bib]
K. Nabeshima.Reduced Groebner bases in polynomial rings over a polynomial ring. In: Internatial Conference on Mathematical Aspects of Computer and Information Sciences, Wang, D. and Zheng, Z. (ed.), pp. 15-32.2006.----.[bib]
W. A. de Graaf, M. Harrison, J. Pilnikova, J. Schicho.A Lie algebra method for rational parametrization of SeveriBrauer surfaces.Journal of Algebra303(2), pp. 514-529.2006.ISSN 0021-8693.[pdf][bib]
J. Pilnikova.Parametrizing algebraic varieties using Lie algebras. RISC, JKU Linz. PhD Thesis.2006.[pdf][bib]
A. Becirovic, P. Paule, V. Pillwein, A. Riese, C. Schneider, J. Schoeberl.Hypergeometric Summation Algorithms for High Order Finite Elements.Computing78(3), pp. 235-249.2006.ISSN 0010-485X.Preliminary version available.[doi][pdf][ps][bib]
K. Driver, H. Prodinger, C. Schneider, A. Weideman.Pad'e Approximations to the logarithm II: Identities, recurrences, and symbolic computation.Ramanujan Journal11(2), pp. 139-158.April2006.ISSN 1382-4090.Preliminary version online.[doi][pdf][ps][bib]
K. Driver, H. Prodinger, C. Schneider, A. Weideman.Pad'e approximations to the logarithm III: Alternative methods and additional results.Ramanujan Journal12(3), pp. 299-314.2006.ISSN 1382-4090.Preliminary version online.[doi][ps][pdf][ps][bib]
C. Schneider.Some notes on ``When is 0.999... equal to 1?''. In: Mathematics, Algorithms, Proofs, T. Coquand et al. (ed.), Dagstuhl Seminar Proceedings05021, pp. 1-3.2006.Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany,ISSN 1862-4405.[url][pdf][bib]
M. Kauers, C. Schneider.Indefinite summation with unspecified summands.Discrete Math.306(17), pp. 2073-2083.2006.ISSN 0012-365X.Preliminary version online.[doi][pdf][bib]
M. Kauers, C. Schneider.Application of unspecified sequences in symbolic summation. In: Proceedings of ISSAC'06, Jean-Guillaume Dumas (ed.), Proceedings of ISSAC'06, pp. 177-183.2006.ACM Press,[doi][ps][pdf][bib]
P. Paule, V. Pillwein, C. Schneider, J. Schöberl.Hypergeometric Summation Techniques for High Order Finite Elements. In: PAMM, , Proceedings of GAMM Annual Meeting 2006 - Berlin6/1, pp. 689-690.2006.Wiley InterScience,Weinheim,ISBN.[doi][bib]
Wolfgang Schreiner.Modellierung und Theorie verteilter Systeme. In: Informatik-Handbuch, Peter Rechenberg, Gustav Pomberger (ed.), Chapter A7, pp. 167-186.2006.Hanser,ISBN 3-446-40185-7.4. Auflage.[bib]
Wolfgang Schreiner.Program Verification with the RISC ProofNavigator. In: Teaching Formal Methods: Practice and Experience, David Duce and Paul Boca (ed.), Proceedings of BCS-FACS Christmas Meeting, Electronic Workshops in Computing (eWiC), pp. 1-6.2006.British Computer Society,London, UK, December 15,ISBN.[pdf][bib]
E. Shemyakova, F. Winkler.Obstacle to Factorization of LPDOs. In: Proceedings Transgressive Computing 2006 , J. G. Dumas (ed.), Proceedings of Transgressive Computing 2006, Conference in Granada Spain, pp. 435-441.2006.Universite J. Fourier,Grenoble, France,ISBN 84-689-8391-0.[pdf][bib]
E. Shemyakova.A Full System of Invariants for Third-Order Linear Partial Differential Operators.Lecture Notes in Comput. Sci.4120, pp. 360-369.2006.0302-9743.[bib]
W. Windsteiger.An Automated Prover for Zermelo-Fraenkel Set Theory in Theorema.JSC41(3-4), pp. 435-470.2006.Elsevier,ISSN 0747-7171.[url][pdf][bib]
E. M. Clarke, A. S. Gavlovski, K. Sutner, W. Windsteiger.Analytica V: Towards the Mordell-Weil Theorem. In: Proceedings of Calculemus'06, A. Bigatti, S. Ranise (ed.), Proceedings of Calculemus'06, pp. ?-?.2006.[pdf][bib]
M. Zhou, F. Winkler.Gröbner Bases in Difference-Differential Modules. In: Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC '06), J.-G. Dumas (ed.), Proceedings of ISSAC 2006, Genova, Italien, pp. 353-360.2006.ACM-Press,ISBN 1-59593-276-3.[pdf][bib]
F. Winkler.Computer Algebra and Geometry - Some Interactions. In: Proc. of Coll. on Constructive Algebra and Systems Theory (CAST), B. Hanzon and M. Hazewinkel (ed.), pp. 127-138.2006.Koninklijke Nederlandse Akademie van Wetenschappen (Königliche Niederländische Akademie der Wissenschaften),ISBN 90-6984-477-x.[pdf][bib]
M. Zhou, F. Winkler.On Computing Gröbner Bases in Rings of Differential Operators with Coefficients in a Ring. In: Proc. First International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), D. Wang and Z. Zheng (ed.), Proceedings of MACIS - First internat. Conf. on Mathematical Aspects of Computer and Information Sciences, pp. 45-56.2006.Beihang University, Beijing,Beihang University in Beijing,no.[pdf][bib]
George E. Andrews, Arnold Knopfmacher, Burkhard Zimmermann.On the number of distinct multinomial coefficients.Journal of Number Theory118(1), pp. 15-30.May2006.ISSN 0022-314X.[pdf][bib]
2005
Christian Aistleitner.A generic implementation of differential characteristic set algorithms in Aldor. Johannes Kepler University, Linz, Austria. Diploma Thesis.December2005.[pdf][bib]
Rahul Athale.Symbolic Computation in Number Theory.. RISC, Johannes Kepler University Linz. PhD Thesis.2005.[bib]
Károly Bósa, Wolfgang Schreiner.Tolerating Stop Failures in Distributed Maple.Scalable Computing: Practice and Experience(SCPE)6(2), pp. 59-70.July2005.NovaPublishers,0.Special issue on Dapsys 2002.[ps][bib]
Karoly Bosa, Wolfgang Schreiner, Michael Buchberger, Thomas Kaltofen.SEE-GRID, A Grid-Based Medical Decision Support System for Eye Muscle Surgery. In: Proceedings of 1st Austrian Grid Symposium 2005, Jens Volkert et al. (ed.), pp. 61-74.December 1-22005.Austrian Computer Society (OCG),Austrian Grid,3-85403-210-2.[ps][pdf][bib]
F. Piroi, B. Buchberger.Label Management in Theorema. In: Informal proceedings of the 4th International Conference on Mathematical Knowledge Management, M. Kohlhase (ed.), pp. -.July2005.Bremen, Germany.[bib]
Rebhi Baraka, Olga Caprotti, Wolfgang Schreiner.A Web Registry for Publishing and Discovering Mathematical Services. In: Proceedings of the IEEE Conference on e-Technology, e-Commerce, and e-Service (IEEE EEE'05), Wiliam Cheung and Jane Hsu (ed.), pp. 190-193.March 21 - April 12005.IEEE Computer Society,ISBN 0-7695-2274-2.[ps][pdf][bib]
Dominici Diego, Knessl Charles.Geometrical optics approach to Markov-modulated fluid models.Stud. Appl. Math.114(1), pp. 45-93.2005. ISSN 0022-2526.[doi][bib]
P. Flajolet, S. Gerhold, B. Salvy.On the non-holonomic character of logarithms, powers and the nth prime function.Electronic Journal of Combinatorics11(2), pp. 1-16.2005.ISSN 1077-8926.[pdf][bib]
S. Gerhold.Point Lattices and Oscillating Recurrence Sequences.Journal of Difference Equations and Applications11(6), pp. 515-533.2005.ISSN 1023-6198.[pdf][bib]
S. Gerhold.Combinatorial Sequences: Non-Holonomicity and Inequalities. RISC, J. Kepler University Linz. PhD Thesis.August2005.[pdf][bib]
Martin Giese.A Calculus for Type Predicates and Type Coercion. In: A Calculus for Type Predicates and Type Coercion, B. Beckert (ed.), LNAI3702, pp. 123-137.September2005.Springer,Koblenz, Germany,ISBN: 3540289313.[bib]
Gabor Guta.Software Measurement in Large. In: IEEE METRICS, - (ed.), Proceedings of 11th IEEE International Symposium on Software Metrics (METRICS 2005), 19-22 September 2005, Como Italy, pp. 44-44.2005.IEEE Computer Society,ISBN 0-7695-2371-4.[bib]
Joachim Apel, Ralf Hemmecke.Detecting Unnecessary Reductions in an Involutive Basis Computation.Journal of Symbolic Computation40(4-5), pp. 1131-1149.2005.ISSN 0747-7171.[url][bib]
R. Beals, E. Kartashova.Constructively factoring linear partial differential operators in two variables.TMPh (Journal of Theoretical and Mathematical Physics)145(2), pp. 1510-1523.November2005.Springer,ISSN: 0040-5779 (print), 1573-9333 (electronic).[doi][dvi][bib]
E. Kartashova.BK-factorization and Darboux-Laplace transformations. In: Proc. CSC'05 (The 2005 International Conference on Scientific Computing, June 20-23 Las Vegas), H. R. Arabnia, G.A. Gravvanis (ed.), Proceedings of The 2005 International Conference on Scientific Computing, June 20-23 Las Vegas, pp. 144-150.2005.CSREA Press, USA,ISBN: 1-932415-62-9.[dvi][bib]
Stefan Gerhold, Manuel Kauers.A Procedure for Proving Special Function Inequalities Involving a Discrete Parameter. In: Proceedings of ISSAC '05, Manuel Kauers (ed.), pp. 156-162.2005.ACM Press,ISBN 1-59593-095-705/0007.[ps][bib]
Manuel Kauers.Algorithms for Nonlinear Higher Order Difference Equations. RISC-Linz. PhD Thesis.October2005.[ps][ps][bib]
Christoph Koutschan.Regular Languages and Their Generating Functions: The Inverse Problem. Friedrich-Alexander-Universität Erlangen-Nürnberg. Diploma Thesis.August2005.[url][pdf][bib]
L. Kovacs, T. Jebelean, A. Kovacs.Practical Aspects of Algebraic Invariant Generation for Loops with Conditionals. In: Bulletins for Applied and Computer Mathematics, Pannonian Applied Mathematical Meetings, PC-147/148, F.Fazekas et al (ed.), pp. --.26-29 May2005.Technical University of Budapest, PAMM-Centre,Balatonalmadi, Hungary,-.[pdf][bib]
A. Kovacs, L. Kovacs.The Lagrange Interpolation Formula in Determining the Fluid's Velocity Potential through Profile Grids. In: Bulletins for Applied and Computer Mathematics, Pannonian Applied Mathematical Meetings, PC-147/148, F.Fazekas et al (ed.), pp. --.26-29 May2005.Technical University of Budapest, PAMM-Centre,Balatonalmadi, Hungary,-.[pdf][bib]
L. Kovacs, T. Jebelean.An Algorithm for Automated Generation of Invariants for Loops with Conditionals. In: Proceedings of the Computer-Aided Verification on Information Systems Workshop (CAVIS05), 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC05), D. Petcu et al (ed.), pp. 16-19.September 25-282005.Department of Computer Science, West University of Timisoara, Romania,-.to appear in IEEE journal.[pdf][bib]
L. Kovacs, N. Popov, T. Jebelean.Verification Environment in Theorema.Annals of Mathematics, Computing and Teleinformatics (AMCT)1(2), pp. 27-34.2005.ISSN 1109-9305.[url][pdf][bib]
B. Kronholm.On Congruence Properties of p(n, m).Proceedings of the American Mathematical Society133, pp. 2891-2895.2005.1088-6826.[url][pdf][bib]
Gabor Kusper.Solving the Resolution-Free SAT
Problem by Hyper-Unit Propagation in Linear Time.Annals of
Mathematics and Artificial Intelligence 43(1-4), pp. 129-136.2005.Kluwer Academic Publishers,Dordrecht, Netherlands,[bib]
Gabor Kusper.Solving and Simplifying the Propositional Satisfiability Problem by Sub-Model Propagation. RISC, Johannes Kepler University, Linz, Austria. PhD Thesis.2005.[bib]
Temur Kutsia.Context Sequence Matching for XML. In: Proceedings of the 1th International Workshop on Automated Specification and Verification of Web Sites (WWV'05), Maria Alpuente and Santiago Escobar and Moreno Falaschi (ed.), pp. 103-119.March 14-152005.Valencia, Spain,(Final version to appear in Elsevier ENTCS).[pdf][bib]
G. Landsmann, P.Mayr and J.Schicho.A topological criterion for polynomiality.Proc. Algorithmic Algebra and Logic, pp. 155-158.2005.Norderstedt,0.[bib]
G. Landsmann, P.Mayr and J.Schicho.A topological property of polynomial functions on GL(2, R).Aequationes, pp. -.2005.0.[bib]
V. Levandovskyy, E. Zerz.Computer algebraic methods for the structural analysis of linear control systems.Proceedings in Applied Mathematics and Mechanics (PAMM)5(1), pp. 717-718.2005.WILEY-VCH,ISSN 1617-7061.DOI: 10.1002/pamm.200510333.[pdf][bib]
Temur Kutsia, Mircea Marin.Matching with Regular Constraints. In: Logic for Programming, Artificial Intelligence, and Reasoning. Proceedings of the 12th International Conference LPAR'05, G. Sutcliffe and A. Voronkov (ed.), Lecture Notes in Artificial Intelligence3835, pp. 215-229.2005.Springer Verlag,ISSN 0302-9743, ISBN 3-540-30553-X.[url][pdf][bib]
Temur Kutsia, Mircea Marin.Can Context Sequence Matching be Used for Querying XML?. In: Proceedings of the 19th International Workshop on Unification (UNIF'05), L. Vigneron (ed.), pp. 77-92.2005.[pdf][bib]
K. Nabeshima.A computation method for ACGB-V. In: Algorithm Algebra and Logic (A3L) 2005, Dolzmann, A., Seidl, S., and Sturm, T. (ed.), Proceedings of Algorithm Algebra and Logic 2005, Conference in Honor of the 60th Birthday of Volker Weispfenning, pp. 173-180.April2005.BOD Norderstedt,ISBN 3-8334-2669-1.[url][bib]
K. Nabeshima.A Direct Products of Fields Approach to Comprehensive Gröbner Bases over Finite Fields. In: 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC05), Petcu, D. (ed.), Proceedings of 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC05), pp. 10-17.2005.to appear in IEEE Press.[bib]
K. Nabeshima.A Direct Products of Fields Approach to Comprehensive Gröbner Bases over Finite Fields. In: ACA 2005, Shirayanagi, K. (ed.), Proceedings of Conference on Applications of Computer Algebra, pp. 54-55.August2005.4-903027-02-3.[url][bib]
S.Geiss P.F.X. Müller, V. Pillwein.A remark on extrapolation of rearrangement operators on dyadic $H^s, 0 < s < 1$.Studia Math.171(2), pp. 197-205.2005.[bib]
Florina Piroi, Temur Kutsia.The Theorema Environment for Interactive Proof Development. In: Logic for Programming, Artificial Intelligence, and Reasoning. Proceedings of the 12th International Conference, LPAR'05, G. Sutcliffe, A. Voronkov (ed.), Lecture Notes in Artificial Intelligence3835, pp. 261-275.2005.Springer Verlag,ISSN 0302-9743, ISBN 3-540-30553-X.[url][pdf][bib]
G. Regensburger, O. Scherzer.Symbolic Computation for Moments and Filter Coefficients of Scaling Functions.Annals of Combinatorics9(2), pp. 223-243.July2005.ISSN 0218-0006.[doi][bib]
I. Szil\'agyi and B. J\"uttler and J. Schicho.Local Parametrization of Cubic Surfaces.Journal of Symbolic Computation, pp. 1-24.2005.ISSN 0747-7171.to appear.[bib]
M. Aigner, I. Szil\'agyi, B. J\"uttler, J. Schicho.Implicitization and Distance Bounds. In: Mathematic and Visualization, M. Elkadi (ed.), Mathematics and Visualization, pp. 1-14.2005.Springer,to appear.[bib]
J. Schicho, I. Szil\'agyi.Numerical Stability of Surface Implicitization.Journal of Symbolic Computation, pp. 1-14.2005.ISSN 0747-7171.to appear.[bib]
C. Schneider.Product Representations in $PiSigma$-Fields.Annals of Combinatorics9(1), pp. 75-99.2005.ISSN 0218-0006.Preliminary version online.[doi][ps][pdf][bib]
C. Schneider.A new Sigma approach to multi-summation.Advances in Applied Math. Special Issue Dedicated to Dr. David P. Robbins. Edited by D. Bressoud34(4), pp. 740-767.2005.ISSN 0196-8858.Preliminary version online.[doi][pdf][ps][bib]
G. E. Andrews, P. Paule, C. Schneider.Plane Partitions VI: Stembridge's TSPP Theorem.Advances in Applied Math. Special Issue Dedicated to Dr. David P. Robbins. Edited by D. Bressoud34(4), pp. 709-739.2005.ISSN 0196-8858.Preliminary version online.[doi][pdf][ps][bib]
C. Schneider.Degree Bounds To Find Polynomial Solutions of Parameterized Linear Difference Equations in $PiSigma$-Fields.Applicable Algebra in Engineering, Communication and Computing16(1), pp. 1-32.2005.ISSN 0938-1279.Preliminary version online.[doi][pdf][ps][bib]
C. Schneider.Solving Parameterized Linear Difference Equations in Terms of Indefinite Nested Sums and Products.J. Differ. Equations Appl.11(9), pp. 799-821.2005.ISSN 1023-6198.Preliminary version online.[doi][pdf][ps][bib]
C. Schneider.Finding Telescopers with Minimal Depth for Indefinite Nested Sum and Product Expressions. In: Proc. ISSAC'05, M. Kauers (ed.), pp. 285-292.2005.ACM,ISBN 1-59593-095-705/0007.[doi][ps][pdf][bib]
Wolfgang Schreiner, Michael Buchberger.Grid Computing zur Simulation von Augenmuskeloperationen.OCG Journal5, pp. 23-24.December2005.Austrian Computer Society (OCG),ISSN 1728-743X.[url][bib]
M. Semrad.Special Functions, Computer Proofs and the DLMF. RISC, J. Kepler University Linz. Diploma Thesis.2005.[bib]
Tudor Jebelean, Laura Szakacs.Functional-Based Synthesis of Systolic Online Multipliers. In: SYNASC-05 (International Symposium on Symbolic and Numeric Scientific Computing), D. Zaharie, D. Petcu, V. Negru, T. Jebelean, G. Ciobanu, A. Cicortas, A. Abraham, M. Paprzycki (ed.), Proceedings of SYNASC-05, pp. 267-275.2005.IEEE Computer Society,ISBN 0-7695-2453-2.[pdf][bib]
Ibolya Szilagyi.Symbolic-Numeric Techniques for Cubic Surfaces. RISC-Linz. PhD Thesis.July2005.PhD Thesis.[pdf][ps][bib]
C.Piazza, M.Antoniotti, V.Mysore, A.Policriti, F.Winkler, B.Mishra..Algorithmic Algebraic Model Checking I: Challenges from Systems Biology. In: Proceedings Computer Aided Verification (CAV 2005), K. Etessami and S.K.Rajamani (ed.), LNCS3576, pp. 5-19.July2005.Springer,The Univ. of Edinburgh,ISSN 0302-9743, ISBN 3-540-27231-3.[pdf][bib]
2004
Manasi Athale.Representation of sari using computer-generated patterns. RISC-Linz, Johannes Kepler University, Linz, Austria. PhD Thesis.2004.[pdf][bib]
Károly Bósa.Fault Tolerance for Distributed Maple. RISC-Linz, Johannes Kepler University, Linz, Austria. PhD Thesis.September2004.[ps][bib]
G. Bodnar.Algorithmic tests for the normal crossing property. In: Automated Deduction in Geometry-Proc. of ADG 2002, F. Winkler (ed.), LNAI2930, pp. 1-20.2004.Springer,ISBN: 3-540-20927-1.[bib]
G. Bodnar.Efficient Desingularization of Reducible Algebraic Sets. In: Proceedings of ISSAC 2004, J. Gurierrez (ed.), pp. 35-41.2004.Sheridan Printing,ISBN: 1-58113-827-X.[bib]
T. Kutsia, B. Buchberger.Predicate Logic with Sequence Variables and Sequence Function Symbols. In: Proceedings of the 3rd International Conference on Mathematical Knowledge Management, MKM'04, Andrea Asperti and Grzegorz Bancerek and Andrzej Trybulec (ed.), Lecture Notes in Computer Science3119, pp. 205-219.Sep 19-212004.Springer Verlag,Bialowieza, Poland,ISBN 3-540-23029-7.[pdf][bib]
B. Buchberger.Algorithm Supported Mathematical Theory Exploration: A Personal View and Stragegy. In: Proceedings of AISC 2004 (7 th International Conference on Artificial Intelligence and Symbolic Computation), B. Buchberger, John Campbell (ed.), Springer Lecture Notes in Artificial Intelligence3249, pp. 236-250.22-24 September2004.Copyright: Springer, Berlin-Heidelberg,RISC, Johannes Kepler University, Austria,ISSN 0302-9743, ISBN 3-540-232.[pdf][bib]
F. Piroi, B. Buchberger.An Environment for Building Mathematical Knowledge Libraries. In: Proceedings of the Workshop on Computer-Supported Mathematical Theory Development, Second International Joint Conference (IJCAR), Wolfgang Windsteiger and Christoph Benzmueller (ed.), pp. 19-29.4-8 July2004.Cork, Ireland,ISBN 3-902276-04-5.[pdf][bib]
B. Buchberger, T. Ida.Computational Origami: Interaction of Solving, Proving and Computing. In: Proceedings of World Conference on 21st Century Mathematics, , pp. -.18-20 March2004.Lahore, Pakistan,accepted.[nb][bib]
B. Buchberger.Towards the Automated Synthesis of a Groebner Bases Algorithm.RACSAM - Revista de la Real Academia de Ciencias (Review of the Spanish Royal Academy of Science), Serie A: Mathematicas98(1), pp. 65-75.2004.ISSN 1578 7303.[pdf][bib]
T. Ida, D. Tepeneu, B. Buchberger, J. Robu.Proving and Constraint Solving in Computational Origami. In: Proceedings of AISC 2004 (7 th International Conference on Artificial Intelligence and Symbolic Computation), B. Buchberger and John Campbell (ed.), Springer Lecture Notes in Artificial Intelligence3249, pp. 132-142.22-24 September2004.Copyright: Springer-Berlin,RISC, Johannes Kepler University, Austria,ISSN 0302-9743, ISBN 3-540-232.[bib]
B. Buchberger, A. Craciun.Algorithm Synthesis by Lazy Thinking: Using Problem Schemes. In: Proceedings of SYNASC 2004, 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, D.Petcu and V.Negru and D.Zaharie and T.Jebelean (ed.), pp. 90-106.26-30 September2004.Copyright: Mirton Publisher,Timisoara, Romania,ISBN 973-661-441-7.[pdf][bib]
B. Buchberger, A. Craciun.Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema. In: Electronic Notes in Theoretical Computer Science, Fairouz Kamareddine (ed.)93, pp. 24-59.18 February2004.ISBN 044451290X.Proc. of the Mathematical Knowledge Management Workshop, Edinburgh, Nov. 25, 2003.[url][pdf][bib]
Dominici Diego, Knessl Charles.Asymptotic analysis by the saddle point method of the Anick-Mitra-Sondhi model.J. Appl. Math. Stoch. Anal.(1), pp. 19-71.2004. ISSN 1048-9533.[doi][bib]
Dominici D., Knessl C..A small elliptic perturbation of a backward-forward parabolic problem with applications to stochastic models.Appl. Math. Lett.17(5), pp. 535-542.2004. ISSN 0893-9659.[doi][bib]
S. Gerhold.On Some Non-Holonomic Sequences.Electronic Journal of Combinatorics11(1), pp. 1-8.122004.RISC, J. Kepler University Linz,ISSN 1077-8926.[url][ps][pdf][tex][bib]
HONG GU, STEFAN KINDERMANN.Solution analysis of denoising equations related to the Mumford-Shah functional. In: Proceedings of The 7th International Conference of Computational Structure Technology, B. H. V. Topping and C. A. Mota Soares (ed.), pp. 242-243.2004.Civil-Comp Press,Stirling, UK,0-948749-95-4.[url][bib]
Erik Hillgarter, Ralf Hemmecke, Günter Landsmann, Franz Winkler.Symbolic Differential Elimination for Symmetry Analysis.Mathematical and Computer Modelling of Dynamical Systems10(2), pp. 123-147.2004. ISSN 1387-3954.[url][pdf][bib]
Manuel Kauers.Computer Proofs for Polynomial Identities in Arbitrary Many Variables. In: Proceedings of ISSAC 2004, Jaime Gutierrez (ed.), pp. 199-204.2004.ACM Press,ISBN 1-58113-827-X.[ps][bib]
A. Kondratyev, H.J. Stetter, F. Winkler.Numerical Computation of Gröbner Bases. In: Proc. 7th Workshop on Computer Algebra in Scientific Computing (CASC-2004), V.G. Ghanza, E.W. Mayr, E.V. Vorozhtov (ed.), Proceedings of CASC-2004, St. Petersburg, pp. 295-306.2004.Technische Univ. Muenchen,Techn. Univ. München,ISBN 3-9808546-2-0.[pdf][bib]
L. Kovacs, T. Jebelean.Automated Generation of Loop Invariants by Recurrence Solving in Theorema. In: Proc. of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC04), D. Petcu and V. Negru and D. Zaharie and T. Jebelean (ed.), pp. 451-464.26-30 September2004.Mirton Publisher,Timisoara, Romania,ISBN 973-661-441-7.[pdf][bib]
L. Kovacs, T. Jebelean.Generation of Loop Invariants in Theorema by Combinatorial and Algebraic Methods. In: Bulletins for Applied and Computer Mathematics, Pannonian Applied Mathematical Meetings, PC-144, F. Fazekas et al (ed.) vol. CVI/2172, pp. 125-134.20-23 May2004.Technical University of Budapest, PAMM-Centre,Balatonalmadi, Hungary,ISSN 0133-3526.[pdf][bib]
T. Jebelean, L. Kovacs, N. Popov.Experimental Program Verification in the Theorema System. In: Proceedings ISOLA 2004, T. Margaria, B. Steffen (ed.), Proceedings of International Symposium on Leveraging Applications of Formal Methods ISOLA 2004, pp. 92-99.November2004.Paphos, Cyprus,University of Cyprus,[pdf][ps][bib]
L. Kovacs, T. Jebelean.Automated Generation of Loop Invariants by Recurrence Solving in Theorema.Analele Universitatii din Timisoara, Seria Matematica - InformaticaXLII, pp. 151-166.2004.Mirton Publisher,Timisoara, Romania,ISSN 1224-970X.special issue on Computer Science - Proceedings of SYNASC'04.[pdf][bib]
L. Kovacs.Verification of Imperative Programs in Theorema. West University of Timisoara, Romania. Diploma Thesis.2004.[bib]
Temur Kutsia.Solving Equations Involving Sequence Variables and Sequence Functions. In: Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC'04, Bruno Buchberger and John A. Campbell (ed.), Lecture Notes in Artificial Intelligence3249, pp. 157-170.Sep 22-242004.Springer Verlag,Hagenberg, Austria,ISBN 3-540-23212-5.[pdf][bib]
G.Landsmann.The Construction of Universal Objects in Differential Algebra. In: Proceedings of the 8th World Multi-Conference in Systemics, Cybernetics and Informatics, SCI2004, Nagib Callaos (ed.), Computer Science and Engineering5, pp. 310-317.2004.980-6560-13-2.[bib]
Mircea Marin, Temur Kutsia.A Rule-based Approach to the Implementation of Evaluation Strategies. In: Proceedings of the 6th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'04), Dana Petcu and Daniela Zaharie and Viorel Negru and Tudor Jebelean (ed.), pp. 227-241.Sep 26-302004.Mirton Publishing Company,Timisoara, Romania,ISBN 973-661-441-4.[bib]
Temur Kutsia, Mircea Marin.Unification Procedure for Terms with Sequence Variables and Sequence Functions (Extended Abstract).. In: Proceedings of the 18th International Workshop on Unification (UNIF'04), Michael Kohlhase (ed.), pp. 1-13.52004.Cork, Ireland,[pdf][bib]
V. Pillwein.Interpolation von Sobolevräumen. Joh. Kepler Univ. Linz. Diploma Thesis.January2004.[pdf][bib]
Mircea Marin, Florina Piroi.Rule-Based Programming with Mathematica. In: Proceedings of the 6th International Mathematica Conference, Alberta, Canada, 2004, , pp. -.August2004.Wolfram Institute,Also as RICAM report series 2004-16.[bib]
Mircea Marin, Florina Piroi.Deduction and Presentation in $\rho$Log. In: Proceedings of the Mathematical Knowledge Management Symposium, F. Kamareddine (ed.), ENTCS93, pp. 161-182.February2004.Elsevier,Heriot-Watt University, Edinburgh,ISBN 044451290X.[bib]
Florina Piroi.User Interface Features in Theorema: A Summary. In: In Proceedings of "Mathematical User-Interfaces Workshop" At the Third Mathematical Knowledge Management Conference, Paul Libbrecht (ed.), pp. 1-16.2004.Also available as SFB Technical Report 2004-46.[url][bib]
Florina Piroi.Tools for Using Automated Provers in Mathematical Theory Exploration. Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Austria. PhD Thesis.August2004.Also available as RISC Tech Report no. 04-12.[url][bib]
N. Popov, T. Jebelean.A Practical Approach to Proving Termination of Recursive Programs in Theorema. In: Proceedings of 7th International Workshop on Termination, M. Codish, A. Middeldorp (ed.), pp. 43-46.June2004.Aachen, Germany,ISSN-0935-3232.[pdf][bib]
P.J. Larcombe, A. Riese, B. Zimmermann.Computer Proofs of Matrix Product Identities.J. Algebra Appl.3, pp. 105-109.2004.ISSN 0219-4988.[pdf][bib]
G. E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis X: Plane Partitions with Diagonals..Southeast Asian Journal Mathematics and Mathematical Sciences3, pp. 3-14.2004.ISSN 0972-7752.[pdf][bib]
Giovanna Roda.Algorithms for Change of Orderings in the Theory of Gröbner Bases.. RISC, Johannes Kepler University Linz. PhD Thesis.2004.[bib]
M. Rosenkranz.New Symbolic Method for Solving Linear Two-Point Boundary Value Problems on the Level of Operators.Journal of Symbolic Computation39(2), pp. 171-199.2004.Elsevier,ISBN 0747-7171.[bib]
M. Rosenkranz.The Algorithmization of Physics: Math Between Science and Engineering. In: Proceedings of AISC 2004, B. Buchberger, J.A. Campbell (ed.), Proceedings of Artificial Intelligence and Symbolic Computation: 7th International Conference, Linz, Austria, Lecture Notes in Artificial Intelligence (LNAI)3249, pp. 1-7.September2004.Springer,Castle of Hagenberg, Austria,ISBN 3-540-23212-5.Invited talk.[bib]
Mohamed Shalaby, Bert Jüttler, Josef Schicho.$C^1$ Spline Implicitization of Planar Curves. In: Automated Deduction in Geometry - Proceedings of the Conference Automated Deduction in Geometry (ADG'2002), Franz Winkler (ed.), Proceedings of Automated Deduction in Geometry (ADG'2002), LNAI2930, pp. -.2004.Springer-Verlag,ISBN 3540209271.[bib]
C. Schneider.Symbolic Summation with Single-Nested Sum Extensions. In: Proc. ISSAC'04, J. Gutierrez (ed.), pp. 282-289.2004.ACM Press,ISBN 1-58113-827-X.[doi][ps][pdf][bib]
C. Schneider.The summation package Sigma: Underlying principles and a rhombus tiling application.Discrete Math. Theor. Comput. Sci.6(2), pp. 365-386.2004.ISSN 1365-8050.[doi][ps][pdf][bib]
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), pp. 163-179.2004.ISSN 1224-970x.Extended version of Proc. SYNASC'04; preliminary version online.[ps][pdf][bib]
Mohamed Shalaby.Spline Implicitization of Planar Shapes and Applications. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria. PhD Thesis.2004.[txt][bib]
T. Thanatipanonda.Permutation Statistics.Mathematics Magazine, pp. 136-140.April2004.0025-570X.[pdf][bib]
F. Winkler (ed.).Automated Deduction in Geometry - Proceedings of the Conference Automated Deduction in Geometry (ADG'2002).LNAI 2930,1 edition,2004.Springer-Verlag Berlin Heidelberg New York,ISBN 3-540-20927-1; ISSN 0302-9743.[bib]
2003
G. Bodnar, B. Kaltenbacher, P. Pau, J. Schicho.Exact real computation in computer algebra. In: Symbolic and Numerical Scientific Computing - Proc. of SNSC'01, U. Langer and F. Winkler (ed.), LNCS2630, pp. 279-292.2003.Springer,ISBN: 3-540-40554-2.[bib]
G. Bodnar.Computation of blowing up centers.Journal of Pure and Applied Algebra179(3), pp. 221-233.2003.ISSN: 0022-4049.[bib]
T.Ida, B. Buchberger.Proving and Solving in Computational Origami.Analele Universitatii din Timisoara, Seria Matematica - InformaticaXLI, pp. 247-263.2003.Copyright: Mirton Publisher,Timisoara, Romania,ISSN 1224-970X.special issue on Computer Science - Proceedings of SYNASC'03.[ps][nb][pdf][bib]
B. Buchberger.Algorithm Invention and Verification by Lazy Thinking.Analele Universitatii din Timisoara, Seria Matematica - InformaticaXLI, pp. 41-70.2003.Copyright: Mirton Publisher, Timisoara, Romania,ISSN 1224-970X.special issue on Computer Science - Proceedings of SYNASC'03.[pdf][bib]
B. Buchberger.Algorithm Invention and Verification by Lazy Thinking. In: Proceedings of SYNASC 2003, 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, D. Petcu, V. Negru, D. Zaharie, T. Jebelean (ed.), pp. 2-26.1-4 October2003.Copyright: Mirton Publisher,Timisoara, Romania,ISBN: 973-661-104-3.[nb][bib]
M. Rosenkranz, B. Buchberger, H. W. Engl.Solving Linear Boundary Value Problems Via Non–commutative Groebner Bases.Applicable Analysis82(7), pp. 655-675.July2003.Copyright: Taylor & Francis Ltd.,ISSN 0003-6811, ISSN 1563-504X.[bib]
B. Buchberger.Computational Mathematics, Computational Logic and Symbolic Computation. In: Computer Science Logic - Proceedings of 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloqium, KGC 2003, M.Baaz, J. A. Makowsky (ed.), Lecture Notes in Computer ScienceVol. 2803, pp. 98-99.August 25-302003.Springer - Verlag Berlin,Vienna, Austria,ISSN 0302-9743.[nb][bib]
B. Buchberger, G. Gonnet, M. Hazewinkel.Preface on Mathematical Knowledge Management. In: Special Issue of Annals of Mathematics and Artificial Intelligence, B. Buchberger, G. Gonnet, M. Hazewinkel (ed.)38/1-3, pp. 1-2.May2003.Kluwer Academic Publishers, Dordrecht, Netherlands,ISSN 1012-2443.[doc][bib]
B. Buchberger.F 1322: Computer Algebra for Pure and Applied Functional Analysis. In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part II: Proposal, P. Paule, U. Langer (ed.), pp. 335-364.October2003.Johannes Kepler University Linz, Austria,-.[bib]
T. Jebelean, B. Buchberger.Theorema: Computation and Deduction in Natural Style. In: Computer Algebra Handbook, J. Grabmeier, E. Kaltofen, V. Weispfennig (ed.), pp. 453-454.2003.Springer - Verlag Berlin,ISBN 3-540-65466-6.[bib]
B. Buchberger, G. Gonnet, M. Hazewinkel.Preface on Mathematical Knowledge Management. In: Special Issue of Annals of Mathematics and Artificial Intelligence, 38/1-3, pp. 1-2.May2003.Kluwer Academic Publishers, Dordrecht, Netherlands,ISSN 1012-2443.[doc][bib]
B. Buchberger, T. Jebelean, W. Windsteiger, T. Kutsia, K. Nakagawa, J. Robu, F. Piroi, A. Craciun, N. Popov, G. Kusper, M. Rosenkranz, L. Kovacs, C. Kocsis.F 1302: THEOREMA: Proving, Solving, and Computing in the Theory of Hilbert Spaces. In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part II: Proposal, P. Paule, U. Langer (ed.), pp. 58-73.October2003.Johannes Kepler University Linz, Austria,-.[bib]
Dominici Diego Ernesto.Asymptotic analysis of a data-handling system and its generalization.1st edition,2003.ProQuest LLC, Ann Arbor, MI,ISBN 978-0496-45928-5.Thesis (Ph.D.)-University of Illinois at Chicago.[url][bib]
Dominici Diego.Nested derivatives: a simple method for computing series expansions of inverse functions.Int. J. Math. Math. Sci.(58), pp. 3699-3715.2003. ISSN 0161-1712.[doi][bib]
Dominici Diego E..The inverse of the cumulative standard normal probability function.Integral Transforms Spec. Funct.14(4), pp. 281-292.2003. ISSN 1065-2469.[doi][bib]
HONG GU.Generating Minimal Surfaces Subject to the Plateau Problems by the Finite Element Method. In: Proceeding of the 5th International Conference of Numerical Methods and Applications, Ivan Dimov, Ivan Lirkov, Svetozar Margenov and Zahari Zlatev (ed.), Springer Lecture Notes in Computer Science2542, pp. 471-478.2003.0302-9743.[bib]
HONG GU.Solving Parameter-dependent Elliptic Problems by Finite Element Method and Symbolic Computation (Extend abstract). In: Proceeding of the International Conference on Numerical Analysis and Computational Mathematics, G.Psihoyois (ed.), pp. 79-82.2003.Wiley-VCH Verlag GmbH & Co. KGaA,Weinheim,3-527-40462-7.[bib]
HONG GU.Graphical Solutions to the Plateau Problem. RISC-Linz, J. Kepler University. PhD Thesis.2003.[bib]
Ralf Hemmecke.Dynamical Aspects of Involutive Bases Computations. In: Symbolic and Numeric Scientific Computation, Franz Winkler and Ulrich Langer (ed.)2630, pp. 168-182.2003.Springer Verlag,ISBN 3-540-40554-2.[url][bib]
Ralf Hemmecke.Involutive Bases for Polynomial Ideals. Research Institute for Symbolic Computation. PhD Thesis.Johannes Kepler University, Linz, Austria,February2003.[url][bib]
R. Hemmecke, E. Hillgarter, G. Landsmann, F. Winkler.Symbolic Differential Elimination for Symmetry Analysis. In: Proc. 4th IMACS Symposium on Mathematical Modelling, F. Breitenecker, I. Troch (ed.), pp. 790-796.Feb.2003.Techn. Univ. Vienna,ISBN 3-901608-24-9.[pdf][bib]
R. Hemmecke, E. Hillgarter, F. Winkler.CASA. In: Handbook of Computer Algebra: Foundations, Applications, Systems, J. Grabmeier, E. Kaltofen, V. Weispfenning (ed.), pp. 356-359.2003.Springer-Verlag,ISBN 3-540-65466-6.[pdf][bib]
Erik Hillgarter.A Contribution to the Symmetry Classification Problem for 2nd Order PDEs in one Dependent and two Independent Variables. RISC, Johannes Kepler University Linz. PhD Thesis.2003.[bib]
Aleksey Kondratyev.Numerical Computation of Groebner Bases. RISC, Johannes Kepler University Linz. PhD Thesis.2003.[bib]
L. Kovacs, T. Jebelean, N. Popov.Verification of Imperative Programs in Theorema. In: Proceedings of the 1st South-East European Workshop on Formal Methods (SEEFM'03), D. Dranidis and K. Tigka (ed.), pp. 140-147.November2003.Thessaloniki, Greece,ISSN: 960-87869-1-6.[pdf][bib]
A. Kovacs, L. Kovacs.Rechnungsalgorytmus der Potentialintegralgleichung der Kompressiblen Fluidgeschwindigkeit durch Profilgitter. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, Nicolae Boja (ed.), Scientific Bulletins of the Politehnica University of Timisoara, Transactions on Mathematics and Physics, pp. 427-434.6-9 November2003.Timisoara, Romania,ISSN 1224-6069.english title: The Calculus Algorithm for the Integral Equation of the Compressible Fluid’s Speeds’ Potentials through Specialized Networks.[doc][bib]
L. Kovacs, T. Jebelean.Practical Aspects of Imperative Program Verification in Theorema.Analele Universitatii din Timisoara, Seria Matematica - InformaticaXLI, pp. 135-154.2003.Mirton Publisher,Timisoara, Romania,ISSN 1224-970X.special issue on Computer Science - Proceedings of SYNASC'03.[pdf][bib]
L. Kovacs, T. Jebelean.Practical Aspects of Imperative Program Verification in Theorema. In: Proceedings of SYNASC 2003, 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, D. Petcu, V. Negru, D. Zaharie, T. Jebelean (ed.), pp. 317-320.1-4 October2003.Mirton Publisher,Timisoara, Romania,ISBN: 973-661-104-3.[pdf][bib]
L. Kovacs, T. Jebelean.Generation of Invariants in Theorema. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, N.Boja (ed.), Scientific Bulletins of the Politehnica University Timisoara, Transactions on Mathematics and Physics, pp. 407-415.6-9 November2003.Timisoara, Romania,ISSN 1224-6069.[pdf][talk.nb][bib]
L. Kovacs, T. Jebelean.Generation of Invariants in Theorema. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, N.Boja (ed.), pp. 407-415.6-9 November2003.ISSN 1224-6069.Scientific Bulletins of the Politehnica University Timisoara, Transactions on Mathematics and Physics.[bib]
A. Kovacs, L. Kovacs Nicolae Boja.Rechnungsalgorytmus der Potentialintegralgleichung der Kompressiblen Fluidgeschwindigkeit durch Profilgitter. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, Nicolae Boja (ed.), Scientific Bulletins of the Politehnica University of Timisoara, Transactions on Mathematics and Physics, pp. 427-434.6-9 November2003.Timisoara, Romania,ISSN 1224-6069.english title: The Calculus Algorithm for the Integral Equation of the Compressible Fluids Speeds Potentials through Specialized Networks.[bib]
A. Kovacs, L. Kovacs Nicolae Boja.Rechnungsalgorytmus der Potentialintegralgleichung der Kompressiblen Fluidgeschwindigkeit durch Profilgitter. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, Nicolae Boja (ed.), Scientific Bulletins of the Politehnica University of Timisoara, Transactions on Mathematics and Physics, pp. 427-434.6-9 November2003.Timisoara, Romania,ISSN 1224-6069.english title: The Calculus Algorithm for the Integral Equation of the Compressible Fluids Speeds Potentials through Specialized Networks.[bib]
A. Kovacs, L. Kovacs.Rechnungsalgorytmus der Potentialintegralgleichung der Kompressiblen Fluidgeschwindigkeit durch Profilgitter. In: Proceedings of the 10th International Symphosium of Mathematics and its Application, N. Boja (ed.), Scientific Bulletins of the Politehnica University of Timisoara, Transactions on Mathematics and Physics, pp. 427-434.6-9 November2003.Timisoara, Romania,ISSN 1224-6069.english title: The Calculus Algorithm for the Integral Equation of the Compressible Fluids Speeds Potentials through Specialized Networks.[bib]
Temur Kutsia.Unification Modulo Flatness. In: Proceedings of the 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'03), Dana Petcu and Daniela Zaharie and Viorel Negru and Tudor Jebelean (ed.), pp. 135-148.1-42003.Mirton Publishing Company,Timisoara, Romania,ISBN 973-661-104-3.[bib]
Temur Kutsia.Matching in Flat Theories. In: Proceedings of the 17th International Workshop on Unification (UNIF'03), Jordi Levy and Michael Kohlhase and Joachim Niehren and Mateu Villaret (ed.), pp. 57-64.June 8-92003.Valencia, Spain,ISBN 84-96221-00-8.[pdf][bib]
Temur Kutsia.Equational Prover of Theorema. In: Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA'03), Robert Nieuwenhuis (ed.), Lecture Notes in Computer Science2706, pp. 367-379.June 9-112003.Springer Verlag,Valencia, Spain,ISBN 3-540-40254-3.[pdf][bib]
Mircea Marin, Temur Kutsia.Programming with Transformation Rules.Analele Universitatii de Vest din TimisoaraXVI, pp. 163-177.2003.Mirton Publishing Company,ISSN 1224-970X.[bib]
Mircea Marin, Temur Kutsia.Programming with Transformation Rules. In: Proceedings of the 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'03), Dana Petcu and Daniela Zaharie and Viorel Negru and Tudor Jebelean (ed.), pp. 157-167.Oct 1-42003.Mirton Publishing Company,Timisoara, Romania,ISBN 973-661-104-3.[bib]
Mircea Marin, Temur Kutsia.On the Implementation of a Rule-Based Programming System and some of its Applications. In: Proceedings of the 4th International Workshop on the Implementation of Logics (WIL'03), Boris Konev and Renate Schmidt (ed.), pp. 55-68.2003.Almaty, Kazakhstan,[pdf][bib]
Wolfgang Schreiner, Christian Mittermaier, Karoly Bosa.Distributed Maple: Parallel Computer Algebra in Networked Environments..Journal of Symbolic Computation35(3), pp. 305-347.2003.Academic Press,0747-7171.[url][bib]
P. Paule, H. Prodinger.Fountains, Histograms, and $q$-Identities.Discrete Math. Theor. Comput. Sci.6, pp. 101-106.2003.ISSN 1365-8050.[ps][bib]
P. Paule, O. Scherzer, A. Schoisswohl.Wavelets with Scale Dependent Properties. In: Symbolic and Numerical Scientific Computation, F. Winkler and U. Langer (ed.), Lecture Notes in Comput. Sci.2630, pp. 255-265.2003.Springer,ISBN: 0-89871-541-5.[ps][bib]
P. Paule, V. Strehl.Definite Summation and Hypergeometric Identities. In: Computer Algebra Handbook: Foundations, Applications, Systems, J. Grabmeier, E. Kaltofen, V. Weispfenning (ed.), pp. 91-93.2003.Springer,ISBN: 3-540-65466-6.[bib]
Nikolaj Popov, Tudor Jebelean.A Practical Approach to Verification of Recursive Programs in Theorema. In: Proceedings of SYNASC'03 (International Workshop on Symbolic and Numeric Algorithms for Scientific Computing Timisoara, Romania, 2003), T. Jebelean, V. Negru, A. Popovici (ed.), pp. 329-332.October2003.Mirton,ISBN 973-661-104-3.[ps][pdf][bib]
A. Riese.qMultiSum -- A Package for Proving q-Hypergeometric Multiple Summation Identities.J. Symbolic Comput.35, pp. 349-376.2003.ISSN 0747-7171.[pdf][bib]
B. Buchberger, T. Jebelean, W. Windsteiger, T. Kutsia, K. Nakagawa, J. Robu, F. Piroi, A. Craciun, N. Popov, G. Kusper, M. Rosenkranz, L. Kovacs, C. Kocsis.F 1302: THEOREMA: Proving, Solving and Computing in General Domains. In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part I: Progress Report, April 2001-September 2003, P. Paule, U. Langer (ed.), pp. 148-170.October2003.Johannes Kepler University Linz, Austria,[bib]
Markus Rosenkranz.A Symbolic Algorithm for Generating Solutions of Boundary Value Problems. RISC, Johannes Kepler University Linz. PhD Thesis.2003.[bib]
Bert Jüttler, Josef Schicho, Mohamed Shalaby.Spline Implicitization of Planar Curves. In: Curve and Surface Design: St. Malo 2002, T. Lyche, M. Mazure, L. Schumaker (ed.), Proceedings of St. Malo 2002, pp. 225-234.2003.Nashboro Press,Brentwood,ISBN 0-9728482-0-7.[bib]
P. Paule, C. Schneider.Computer proofs of a new family of harmonic number identities.Adv. in Appl. Math.31(2), pp. 359-378.2003.ISSN 0196-8858.Preliminary version online.[doi][ps][pdf][bib]
W. Windsteiger.Mathematica. In: Computer Algebra Handbook: Foundations, Applications, Systems, J. Grabmeier, E. Kaltofen, and V. Weispfenning (ed.), pp. 314-320.2003.Springer,ISBN 3-540-65466-6.[bib]
W. Windsteiger.Exploring an Algorithm for Polynomial Interpolation in the Theorema System. In: Proceedings of the Calculemus 2003 Symposium, T. Hardin and R. Rioboo (ed.), pp. 130-136.September2003.Aracne Editrice S.R.L.,Rome Italy,ISBN 88-7999-545-6.[pdf][bib]
B. Mishra, F. Winkler, et al..A Sence of Life: Computational and Experimental Investigations with Models of Biochemical and Evolutionart Processes.OMISC - A Journal of Integrative Biology7(3), pp. 253-268.2003.ISSN 1536-2310.special issue on BioCOMP (ed. S. Kumar).[pdf][bib]
F. Winkler.Parametric Curves. In: Proc. 23th Conf. on Geometry and Computer Graphics, Hojsova Straz-Brcalnik/Plzen, M. Lavicka (ed.), Proceedings of Proc. 23th Conf. on Geometry and Computer Graphics, pp. 25-26.2003.ISBN 80-7082-943-5.[pdf][bib]
F. Winkler, U. Langer (ed.).Symbolic and Numeric Scientific Computation - Proceedings of the Conference SNSC'01.LNCS 2630,1 edition,2003.Springer - Verlag Berlin Heidelberg New York,ISBN 3-540-40554-2; ISSN 0302-9743.[bib]
2002
Károly Bósa, Wolfgang Schreiner.Tolerating Stop Failures in Distributed Maple. In: Distributed and Parallel Systems - Cluster and Grid Computing, Péter Kacsuk, Dieter Kranzmüller, Zsolt Németh, Jens Volkert (ed.), Proceedings of 4th Austrian-Hungarian Workshop on Distributed and Parallel Processing, pp. 203-210.2002.Kluwer Academic Publishers Group,RISC-Linz, Johannes Kepler University, Linz, Austria,ISBN 1-4020-7209-0.[ps][bib]
A. Berkovich, A. Riese.A Computer Proof of a Polynomial Identity Implying a Partition Theorem of Göllnitz.Adv. in Appl. Math.28, pp. 1-16.2002.ISSN 0196-8858.[pdf][bib]
G. Bodnar.Unification of blowing up sequences. In: Actas del EACA-2002, Philippe Giménez (ed.), pp. 111-115.2002.University of Valladolid, Spain,X.[bib]
B. Buchberger.Groebner Bases: The Commutative Case. In: The Concise Handbook of Algebra, A. V. Mikhalev, G. F. Pilz (ed.), pp. 262-265.2002.Copyright: Kluwer Academic Publishers,Dordrecht, Netherlands,ISBN 0-7923-7072-4.[bib]
B. Buchberger.Groebner Bases: Applications. In: The Concise Handbook of Algebra, A. V. Mikhalev and G. F. Pilz (ed.), pp. 265-268.2002.Kluwer Academic Publishers, Dordrecht, Netherlands.,ISBN 0-7923-7072-4.[bib]
A. Craciun, B. Buchberger.Proving the Correctness of the Merge-Sort Algorithm with Theorema. In: Proceedings of SYNASC 2002, 4th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, D. Petcu, V. Negru, D. Zaharie, T. Jebelean (ed.), pp. 97-111.9-12 October2002.Mirton Publisher,Timisoara, Romania,ISBN 973-585-785-5.[bib]
B. Buchberger.Symbolic Computation. In: Handbuch der Informatik, G. Pomberger, P. Rechenberg (ed.), 1st edition, pp. 955-974.2002.Carl Hanser Verlag Munich,ISBN 3446401857.(3rd edition, pp. 963 - 981).[bib]
B. Buchberger.Invention by Lazy Thinking. In: "A Min Tjoa @ Work"- In honor of the 50th birthday of Univ.Prof.Dr. A Min Tjoa, R. Wagner (ed.), pp. 11-31.December2002.Austrian Computer Society,ISBN 3-85403-164-5.[bib]
F. Piroi, B. Buchberger.Focus Windows: A New Technique for Proof Presentation. In: Proceedings of the 8th Rhine Workshop on Computer Algebra, Mannheim, Germany, H. Kredel, W. Seiler (ed.), pp. 297-313.March 21-222002._.[pdf][abstract][bib]
M. Rosenkranz, B. Buchberger, H. W. Engl.Solving Linear Boundary Value Problems Via Non–commutative Groebner Bases. In: Proceedings of SYNASC 2002, 4th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, D. Petcu, V. Negru, D. Zaharie, T. Jebelean (ed.), pp. 300-313.9-12 October2002. Mirton Publisher, Timisoara, Romania,ISBN 973-585-785-5.[bib]
Mike Dewar, David Carlisle, Olga Caprotti.Description Schemes For Mathematical Web Services. In: Proceedings of EuroWeb 2002 Conference: The Web and the GRID: from e-science to e-business, , pp. -.December2002.British Computer Society Electronic Workshops in Computing (eWiC),[url][bib]
F. Caruso.Polynomial Arithmetic and Linear Systems in Symbolic Summation. RISC Linz. PhD Thesis.2002.[bib]
B. Buchberger, T. Jebelean, W. Windsteiger, T. Kutsia, K. Nakagawa, J. Robu, F. Piroi, A. Craciun, N. Popov, G. Kusper, M. Rosenkranz.F 1302: Solving and Proving in General Domains. In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Annual Report 2002, U. Langer, F. Winkler (ed.), pp. 4-5.February2002.Johannes Kepler University Linz, Austria,[bib]
S. Gerhold.Uncoupling Systems of Linear Ore Operator Equations. RISC, J. Kepler University Linz. Diploma Thesis.22002.[ps][ps][bib]
HONG GU.The Finite Element Approximation to the Minimal Surfaces Subject to the Plateau Problems. In: Proceedings of The Sixth International Conference on Computational Structure Technology, B. H. V. Topping and Z. Bittnar (ed.), pp. 19-20.2002.Civil-Comp Press,Stirling, UK,0-948749-83-0.[url][bib]
Ralf Hemmecke.Continuously Parameterized Symmetries and Buchberger's Algorithm.Journal of Symbolic Computation33(1), pp. 43-55.January2002.0747-7171.[bib]
Tudor Jebelean.Nonconventional Algorithms for Multiprecision Arithmetic. In: Proceeding of SYNASC'02, Negru at al (ed.), pp. 3-7.October2002.Mirton,Timisoara, Romania,ISBN: 973-585-785-5.[bib]
E. Kartashova, A. Samoilov.Online Regelung eines Kaltwalz- bzw. Dressierprozesses.Austrian Patent, pp. 1-25.2002.B21B 37/16 (37/18), A 302/2002. Issued February 27, 2002.[bib]
Manuel Kauers.Solving Parametric Linear Systems: an Experiment with Constraint Algebraic Programming. In: Proceedings of the 8th Rhine Workshop of Computer Algebra, Heinz Kredel and Wolfgang K. Seiler (ed.), Proceedings of 8th Rhine Workshop on Computer Algebra, pp. 101-114.2002.[ps][bib]
L. Kovacs.Optical Music Recognition. In: Proceedings of the 4th Conference of Informatics in Higher Education, Symphosium of Mathematics and its Applications, - (ed.), pp. -.28-30 August2002.Debrecen, Hungary,ISSN 1224-6069.[bib]
Gabor Kusper.Integrating Temporal Assertions into a Parallel Debugger. In: Proceedings of the 8th International Euro-Par Conference, B. Monien and R. Feldmann (ed.), pp. 113-120.2002.Springer-Verlag,Paderborn, Germany,ISBN:3-540-44049-6.[bib]
Temur Kutsia.Theorem Proving with Sequence Variables and Flexible Arity Symbols. In: Logic for Programming, Artificial Intelligence, and Reasoning. Proceedings of the 9th International Conference, LPAR'02, Matthias Baaz and Andrei Voronkov (ed.), Lecture Notes in Artificial Intelligence2514, pp. 278-291.Oct14-182002.Springer Verlag,Tbilisi, Georgia,ISBN 3-540-00010-0.[pdf][bib]
Temur Kutsia.Pattern Unification with Sequence Variables and Flexible Arity Symbols.Electronic Notes on Theoretical Computer Science66(5), pp. 1-18.2002.ISSN 1571-0661.[pdf][bib]
Temur Kutsia.Unification with Sequence Variables and Flexible Arity Symbols and its Extension with Pattern-Terms. In: Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AISC'2002 - Calculemus'2002 conference, Jacques Calmet and Belaid Benhamou and Olga Caprotti and Laurent Henocque and Volker Sorge (ed.), Lecture Notes in Artificial Intelligence2385, pp. 290-304.July 1-52002.Springer Verlag,Marseille, France,ISBN 3-540-43865-3.[pdf][bib]
Temur Kutsia.Solving and Proving in Equational Theories with Sequence Variables and Flexible Arity Symbols. RISC, Johannes Kepler University of Linz. PhD Thesis.2002.[ps][bib]
G.Landsmann.Implicitization of Algebraic Varieties. In: Proceedings of the 6th World Multiconference on Systemics, Cybernetics and Informatics, SCI2002, Nagib Callaos (ed.), Computer Science 211, pp. 290-296.July2002.Orlando, Florida, USA,980-07-8150-1.[bib]
Koji Nakagawa.Variable Shape Logicographic Symbols. In: Logic, Mathematics and Computer Science: Interactions (LMCS 2002), K. Nakagawa (ed.), Proceedings of Symposium in Honor of Bruno Buchberger's 60th Birthday, Appears in RISC-report Series Nr. 02-60, pp. 202-216.October2002.RISC, Schloss Hagenberg, Austria,ISBN 3-902276-03-7.[bib]
Koji Nakagawa.Supporting User-Friendliness in the Mathematical Software System Theorema. RISC, Johannes Kepler University Linz. PhD Thesis.2002.[bib]
I. Gutman, P. Paule.The Variance of the Vertex Degrees of Randomly Generated Graphs.Publ. Fac. Electr. Engrg. Ser. Mat.13, pp. 30-35.2002.ISSN 0354-124X.[bib]
P. Paule.Finite Actions of Groups. In: The Concise Handbook of Algebra, A.V. Mikhalev, G.F. Pilz (ed.), pp. 119-123.2002.Kluwer,ISBN 0-7923-7072-4.[bib]
R. Lyons, P. Paule, A. Riese.A Computer Proof of a Series Evaluation in Terms of Harmonic Numbers.Appl. Algebra Engrg. Comm. Comput.13, pp. 327-333.2002.ISSN 0938-1279.[pdf][bib]
Judit Robu.Automated Geometric Theorem Proving in the Frame of the Theorema Project. RISC, Johannes Kepler University Linz. PhD Thesis.2002.[bib]
C. Schneider.How one can play with sums. In: Proceedings of the 8th Rhine Workshop on Computer Algebra, H. Kredel, W. Seiler (ed.), pp. 73-83.2002.Mannheim, Germany,-.Preliminary version online.[pdf][ps][bib]
W. Windsteiger.An Automated Prover for Set Theory in Theorema. In: Calculemus 2002, 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning: Work in Progress Papers, O. Caprotti, V. Sorge (ed.), pp. 56-67.June2002.Marseille, France,ISSN 14274447.Appears in Seki-Report Series Nr. SR-02-04, Universitaet des Saarlandes.[ps][bib]
W. Windsteiger.An Automated Prover for Zermelo-Fraenkel Set Theory in Theorema. In: Logic, Mathematics and Computer Science: Interactions (LMCS 2002), K. Nakagawa (ed.), pp. 266-280.October2002.RISC, Schloss Hagenberg, Austria,ISBN 3-902276-03-7.Symposium in Honor of Bruno Buchberger's 60th Birthday, Appears in RISC-report Series Nr. 02-60.[pdf][bib]
F. Winkler.Computational Ring Theory. In: The Concise Handbook of Algebra, A.V. Mikhalev, G.F. Pilz (ed.), section C54, pp. 347-350.2002.Kluwer Acad. Publishers,ISBN 0-7923-7072-4.[pdf][bib]
F. Winkler.Advances in Algebraic Geometric Computation. In: Proc. Internat. Conf. on Algebra and its Applications (ICAA 2002), Y. Kemprasit (ed.), Proceedings of ICAA 2002, Bangkok, Thailand, pp. 107-120.2002.ISBN 970-13-2182-1.[pdf][bib]
2001
Piet Bikker.The Bézout Construction of the Resultant. RISC, Johannes Kepler University Linz. PhD Thesis.2001.[bib]
A. Berkovich, P. Paule.Lattice Paths, $q$-Multinomials and Two Variants of the Andrews-Gordon Identities.Ramanujan J.5, pp. 409-424.2001.ISSN 1382-4090.[pdf][bib]
A. Berkovich, P. Paule.Variants of the Andrews-Gordon Identities.Ramanujan J.5, pp. 391-404.2001.ISSN 1382-4090.[pdf][bib]
G. Bodnar, J. Schicho.Two computational techniques for singularity resolution.Journal of Symbolic Computation32(1-2), pp. 39-54.2001.ISSN: 0747-7171.[bib]
M.Borges Quintana, M.A. Borges Trenard, F. Winkler.An Application of the FGLM Techniques to Linear Codes. In: 4th Italien-Latin American Conference on Applied and Industrial Mathematics (Havanna 2001), D. Martinez Morera, L. Alvarez Diaz, L. Lera Marques (ed.), Proceedings of Proc. 4th Italien-Latin American Conference on Applied and Industrial Mathematics, pp. 280-286.2001.Inst. Cybern. Math. Phys., Havanna, Cuba,ISBN 959-7056-13-5.[pdf][bib]
B. Buchberger.Groebner Rings and Modules. In: Proceedings of SYNASC 2001 (The 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing), S. Maruster, B. Buchberger, V. Negru, T. Jebelean (ed.), pp. 22-25.2-5 October2001.University of the West Timisoara, Romania,RISC-Linz Report Series No. 01-20.[abstract][pdf][ps][bib]
B. Buchberger.Computers and Mathematical Research. In: Mathematical Glimpses into the 21st Century, Round Table at the Third European Congress of Mathematics, Barcelona, C.Casacuberta, R. M. Miro-Roig, J. M. Ortega and S. Xambo-Descamps (ed.), pp. 140-147.2001.Copyright: Centro Internacional de Metodos Numericos en Ingenieria, Gran Capitan,Barcelona, Espana,Artes Graficas Torres S.A,ISBN: 84-89925-85-2.[bib]
B. Buchberger.Groebner Bases and Systems Theory.Multidimensional Systems and Signal Processing, Special Issue on "Applications of Groebner Bases in Multidimensional Systems and Signal Processing"12(3/4), pp. 223-253.October2001. Kluwer Academic Publishers, Boston,ISSN 0923-6082.Z. Lin, L. Xu (eds.).[bib]
B. Buchberger.Logicographic Symbols: A New Feature in Theorema. In: Symbolic Computation - New Horizons (Proceedings of the 4th International Mathematica Symposium), Y. Tazawa (ed.), pp. 23-30.25-27 June2001.Copyright: Tokyo Denki University Press,Tokyo Denki University, Chiba New Town Campus, Japan,ISBN 4-501-73020-X C3041.[pdf][abstract][ps][bib]
K. Nakagawa, B. Buchberger.Presenting Proofs Using Logicographic Symbols. In: Proceedings of the Workshop on Proof Transformation and Presentation at the IJAR-2001, A. Fiedler, H. Horacek (ed.), pp. -.18 June2001.Siena,[abstract][ps][pdf][bib]
B. Buchberger.Theorema: A Proving System Based on Mathematica.The Mathematica Journal8(2), pp. 247-252.2001.Copyright: Wolfram Research,ISSN: 1047-5974.[bib]
B. Buchberger.The PCS Prover in Theorema. In: Proceedings of EUROCAST 2001 (8th International Conference on Computer Aided Systems Theory - Formal Methods and Tools for Computer Science), R. Moreno-Diaz, B. Buchberger, J.L. Freire (ed.), Lecture Notes in Computer Science 2178, pp. 469-478.19-23 February2001.Copyright: Springer - Verlag Berlin,Las Palmas de Gran Canaria,ISSN 0302-9743, ISBN 3-540-429.[ps][pdf][abstract][bib]
B. Buchberger.Groebner Bases: A Short Introduction for Systems Theorists. In: Proceedings of EUROCAST 2001 (8th International Conference on Computer Aided Systems Theory - Formal Methods and Tools for Computer Science), R. Moreno-Diaz, B. Buchberger, J.L. Freire (ed.), Lecture Notes in Computer Science 2178, pp. 1-19.19-23 February2001.Copyright: Springer - Verlag Berlin,Las Palmas de Gran Canaria,ISSN 0302-9743, ISBN 3-540-429.[abstract][pdf][bib]
B. Buchberger.Mathematical Knowledge Management using THEOREMA. In: First International Workshop on Mathematical Knowledge Management (MKM 2001), B.Buchberger, O. Caprotti (ed.), pp. --.2001.RISC-Linz, A-4232 Schloss Hagenberg, September 24-26, 2001, 17 pages.,-.[ps][bib]
B. Buchberger, K. Nakagawa.The Role of Logicographic Symbols for Mathematical Knowledge Management. In: Proceedings of the First International Workshop on Mathematical Knowledge Management (MKM), B. Buchberger, O. Caprotti (ed.), pp. -.September 24-262001.RISC-Linz, A-4232 Schloss Hagenberg,[bib]
B. Buchberger.Mathematical Knowledge Management in THEOREMA. In: First International Workshop on Mathematical Knowledge Management (MKM 2001), B. Buchberger, O. Caprotti (ed.), pp. -.September 24-262001.RISC-Linz, A-4232 Schloss Hagenberg,[bib]
Tudor Jebelean.Non-conventional Algorithms for Multiple Precision Arithmetic. RISC, University of Linz. PhD Thesis.December2001.Habilitation thesis.[bib]
Boris Konev, Tudor Jebelean.Solution Lifting Method for Handling Meta-variables in Theorema. In: Proceedings of SYNASC01, S. Maruster, B. Buchberger, V. Negru, T. Jebelean (ed.), Proceedings of 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, pp. 15-23.October2001.Mirton,Timisoara, Romania,ISSN: 973-661-441-7.[bib]
A. Kovacs, L. Kovacs.Rechnungsalgorytmus der hodographischen Annanherungsmethode, die in dem Aerodynamik der Profillgittern verwendet ist. In: Proceedings of the 9th International Symphosium of Mathematics and its Applications, N.Boja (ed.), Scientific Bulletins of the Politehnica University of Timisoara, Transactions on Mathematics and Physics, pp. -.21 November2001.Timisoara, Romania,ISSN 1224-6069.[bib]
A. Kovacs, L. Kovacs.Hodographysche Annaherungsmethode im studium der Bewegung mit Umlauf um die Profilgittern. In: Pannonian Applied Mathematical Meeting (PAMM), - (ed.), Bulletins for Applied and Computer Mathematics, T.U. Budapest, pp. -.May2001.Balatonalmadi, Hungary,-.[bib]
Wolfgang Schreiner, Gabor Kusper, Karoly Bosa.Fault Tolerance for Cluster Computing Based on Functional Tasks. In: Euro-Par 2001 Parallel Processing, Rizo Sakellariou, John Keane, John Gurd and Len Freeman (eds) (ed.), Proceedings of 7th International Euro-Par Conference, Manchester, UK, August 28 - 31, 2001, Lecture Notes in Computer Science2150, pp. 712-716.August2001.Springer, Berlin,3-540-42495-4.[ps][bib]
Temur Kutsia.Unification in the Empty and Flat Theories with Sequence Variables and Flexible Arity Symbols. In: Proceedings of the 17th International Workshop on Unification (UNIF'03), Franz Baader and Volker Diekert and Cesare Tinelli and Ralf Treinen (ed.), pp. 20-23.June 18-192001.Siena, Italy,[bib]
G. Landsmann, J. Schicho, F. Winkler.The Parametrization of Canal Surfaces and the Decomposition of Polynomials into a Sum of Two Squares.Journal of Symbolic Computation32(1&2), pp. 119-132.2001.ISSN 0747-7171.[ps][pdf][bib]
Temur Kutsia, Koji Nakagawa.An Interface between Theorema and External Automated Deduction Systems. In: Proceedings of 9th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus'01), Steve Linton and Roberto Sebastiani (ed.), pp. 178-182.Jun 21-232001.Siena, Italy,[bib]
G.E. Andrews, A. Knopfmacher, P. Paule, H. Prodinger.$q$-Engel Series Expansions and Slater's Identities.Quaestiones Math.24, pp. 403-416.2001.ISSN 0379-9468.[pdf][bib]
Florina Piroi, Tudor Jebelean.Advanced Proof Presentation in Theorema.Special Issue of the Annals of the University of the West, Timisoara.XXXIX, pp. 181-199.September2001.ISSN 1224-970X.Proceedings of SYNASC 01, 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, October 2-5, 2001.[bib]
G.E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis III: The Omega Package.European J. Combin.22, pp. 887-904.2001.ISSN 0195-6698.[pdf][bib]
G.E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis VI: A New Reduction Algorithm.Ann. Comb.5, pp. 251-270.2001.ISSN 0218-0006.[pdf][bib]
G.E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis VII: Constrained Compositions. In: q-Series with Applications to Combinatorics, Number Theory, and Physics, B.C. Berndt and K. Ono (ed.), Contemp. Math.291, pp. 11-27.2001.Amer. Math. Soc.,ISBN 0-8218-2746-4.[pdf][bib]
G.E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis VIII: Plane Partition Diamonds.Adv. in Appl. Math.27, pp. 231-242.2001.ISSN 0196-8858.[pdf][bib]
G.E. Andrews, P. Paule, A. Riese.MacMahon's Partition Analysis IX: k-Gon Partitions.Bull. Austral. Math. Soc.64, pp. 321-329.2001.ISSN 0004-9727.[pdf][bib]
G.E. Andrews, P. Paule, A. Riese, V. Strehl.MacMahon's Partition Analysis V: Bijections, Recursions, and Magic Squares. In: Algebraic Combinatorics and Applications, A. Betten and others (ed.), pp. 1-39.2001.Springer,ISBN 3-5404-1110-0.[pdf][bib]
A. Riese.Fine-Tuning Zeilberger's Algorithm - The Methods of Automatic Filtering and Creative Substituting. In: Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, F.G. Garvan and M.E.H. Ismail (ed.), Developments in Mathematics4, pp. 243-254.2001.Kluwer,ISBN 1-4020-0101-0.[pdf][bib]
C. Schneider.Symbolic Summation in Difference Fields. RISC, J. Kepler University Linz. PhD Thesis.May2001.(published as Technical report no. 01-17 in RISC Report Series.).[ps][pdf][bib]
J.R. Sendra, F. Winkler.Computation of the Degree of a Rational Map between Curves. In: International Symposium on Symbolic and Algebraic Computation (ISSAC'01), B. Morrain (ed.), Proceedings of ISSAC'01, London, Ontario, Canada, pp. 317-322.2001.ACM-Press,ISBN 1-58113-417-7.[pdf][ps][bib]
J.R. Sendra, F. Winkler.Tracing Index of Rational Curve Parametrizations.Computer Aided Geometric Design 18, pp. 771-795.2001.ISSN 0167-8396.[pdf][bib]
C. Weixlbaumer.Solutions of Difference Equations With Polynomial Coefficients. RISC, J. Kepler University Linz. Diploma Thesis.2001.[pdf][bib]
W. Windsteiger.A Set Theory Prover in Theorema. In: Computer Aided Systems Theory, R. Moreno-Diaz and B. Buchberger and J.L. Freire (ed.), LNCS2178, pp. 525-539.2001.Springer,ISSN 0302-9743, ISBN 3-540-429.Proceedings of EUROCAST 2001 (8th International Conference on Computer Aided Systems Theory - Formal Methods and Tools for Computer Science), extended version available as RISC report 01-07.[bib]
W. Windsteiger.On a Solution of the Mutilated Checkerboard Problem using the Theorema Set Theory Prover. In: Proceedings of the Calculemus 2001 Symposium, S. Linton and R. Sebastiani (ed.), pp. 28-47.2001.[pdf][bib]
Wolfgang Windsteiger.A Set Theory Prover in Theorema: Implementation and Practical Applications. RISC Institute. PhD Thesis.May2001.[tar.gz][bib]
G.E. Andrews, A. Knopfmacher, P. Paule, B. Zimmermann.Engel Expansions of $q$-Series by Computer Algebra. In: Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, F.G. Garvan and M.E.H. Ismail (ed.), Developments in Mathematics4, pp. 33-57.2001.Kluwer,ISBN: 1402001010.[pdf][bib]
F. Chyzak, P. Paule, O. Scherzer, A. Schoisswohl, B. Zimmermann.The construction of orthonormal wavelets using symbolic methods and a matrix analytical approach for wavelets on the interval.Experiment. Math.10, pp. 67-86.2001.ISSN 1058-6458.[pdf][bib]
2000
Petru Pau.Anchored Sweep – A Paradigm. RISC, Johannes Kepler University Linz. PhD Thesis.2000.[bib]
G. Bodnar, J. Schicho.A Computer Program for the Resolution of Singularities. In: Resolution of Singularities, A research textbook in tribute to Oscar Zariski, H. Hauser and J. Lipman and F. Oort and A. Quir'os (ed.), Progress in Mathematics181, pp. 231-238.2000.Birkhäuser,Basel,ISBN 3-7643-6178-6.[bib]
G. Bodnar, J. Schicho.Automated Resolution of Singularities for Hypersurfaces.Journal of Symbolic Computation30(4), pp. 401-428.2000.London,ISSN: 0747-7171.[bib]
G. Bodnar, J. Schicho.An Improved Algorithm for the Resolution of Singularities. In: Proceedings of ISSAC 2000, C. Traverso (ed.), pp. 30-37.2000.New York,ISBN: 1-58113-218-2.[bib]
G. Bodnar.Algorithmic Resolution of Singularities. Research Institute for Symbolic Computation, Johannes Kepler University. PhD Thesis.A-4040 Linz,2000.[bib]
M. Borges Quintana, F. Winkler, M.A. Borges Trenard.An FGLM Method for Decoding Linear Codes. In: Encuentro de Algebra Computational y Aplicaciones (EACA-2000), A. Montes (ed.), Proceedings of EACA-2000, Barcelone, Spanien, pp. 117-128.2000.Univ. Politecnica de Catalunya,ISBN 84-699-3037-0.[pdf][bib]
B. Buchberger.Computer-assisted Proving by the PCS Method. In: Proceedings of the Workshop on Constructive Algebra, - (ed.), pp. -.1-3 November2000.Amsterdam,-.Springer Lecture Notes in Computer Science, submitted.[pdf][abstract][pdf][bib]
B. Buchberger.Mathematics and Computer Science: A Personal View.Analele Universitatii din Timisoara, Seria Matematica - Informatica38(1), pp. 3-15.2000.ISSN 1224-970X.[bib]
B. Buchberger.Theory Exploration with Theorema.Analele Universitatii Din Timisoara, Seria Matematica-InformaticaXXXVIII(2), pp. 9-32.2000.ISSN 1124-970X.Selected papers of the 2nd International Workshop on Symbolic and Numeric Algorithms in Scientific Computing, Oct. 4-6, 2000, Timisoara, Romania (T. Jebelean, V. Negru, A. Popovici eds.).[abstract][ps][pdf][bib]
B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, W. Windsteiger.The Theorema Project: A Progress Report. In: Symbolic Computation and Automated Reasoning (Proceedings of CALCULEMUS 2000, Symposium on the Integration of Symbolic Computation and Mechanized Reasoning), M. Kerber, M. Kohlhase (ed.), pp. 98-113.6-7 August2000.Copyright: A.K. Peters, Natick, Massachusetts,St. Andrews, Scotland,ISBN 1-56881-145-4.[ps][pdf][abstract][bib]
B. Buchberger.Theorem Proving For and With Gröbner Bases Theory. In: 2nd International Workshop on Multidimensional (nD) Systems, June 27-30, 2000, Csocha Castle, Lower Silesia, Poland., K. Galkowski (ed.), pp. 15-22.2000.Copyright: Technical University Press, Zielona Gora, Poland,ISBN: 83-85911-71-5.[bib]
B. Buchberger.Computer-Algebra: Das Ende der Mathematik? (Computer Algebra: The End of Mathematics?). In: Mitteilungen der Deutschen Mathematiker-Vereinigung, 2, pp. 16-19.2000.Copyright: Birkhaeuser Verlag AG, Basel, Switzerland,ISSN 0947-4471, ISSN 1399-590.(English Translation in: ACM SIGSAM Bulletin, March 2002. Danish Translation in: Matilde, Nr. 8, February 2000, pp. 4-7, Univ. of Kobenhavn).[pdf][ps][abstract][bib]
B. Buchberger.Mathematik am Computer: Die naechste Ueberforderung? (Mathematics on the Computer: The Next Overtaxation?). In: Didaktik-Reihe der Oesterreichischen Mathematischen Gesellschaft (Proceedings of a Symposium for High-school Teachers, September 24, 1999, Graz, Austria), Vol.131, pp. 37-56.March2000.[bib]
B. Buchberger, J. Schicho.F 1303: Proving and Solving Over the Reals. In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part I: Progress Report, April 1998-September 2000, B. Buchberger and U.Langer (ed.), pp. 126-142.October2000.Johannes Kepler University Linz, Austria,[bib]
B. Buchberger.Symbolisches Rechnen: Eliminieren sich die Mathematiker selbst? (Symbolic Computation: Are the Mathematicians Eliminating Their Own Jobs). In: Exhibition Catalogue "Mathematische Machinen: Von der Rechenmaschine zum Computer", F. Pichler (ed.), pp. 1-13.2000.Strom-Museum, Ybbs, Austria,[bib]
B. Buchberger et al.F1302: Proving, Solving, and Computing in the Theory of Hilbert Spaces (Research Proposal). In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part II: Proposal, , pp. 54-85.October 62000.Johannes Kepler University Linz, Austria,[bib]
B. Buchberger, J. Schicho.F 1303: Proving and Solving Over the Reals (Progress Report). In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part I: Progress Report, April 1998-September 2000, B. Buchberger and U.Langer (ed.), pp. 126-142.October2000.Johannes Kepler University Linz, Austria,[bib]
B. Buchberger et al.F 1302: THEOREMA: Proving, Solving, and Computing in General Domains (Progress Report). In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part I: Progress Report, April 1998-September 2000, B. Buchberger, U. Langer (ed.), pp. 101-125.October2000.Johannes Kepler University Linz, Austria,-.[bib]
B. Buchberger et al.F 1301: Coordination and Service Project (Progress Report). In: Special Research Program (SFB) F 013, Numerical and Symbolic Scientific Computing, Proposal for Continuation, Part I: Progress Report, April 1998-September 2000, B. Buchberger, U. Langer (ed.), pp. 88-100.October2000.Johannes Kepler University Linz, Austria,-.[bib]
G. Landsmann, J. Schicho, F. Winkler, E. Hillgarter.Symbolic Parametrization of pipe and Canal Surfaces. In: International Symposium on Symbolic and Algebraic Computation (ISSAC'00), C. Traverso (ed.), Proceedings of ISSAC'00, St. Andrews, Scotland, pp. 202-208.2000.ACM-Press,ISBN 1-58113-218-2.[pdf][ps][bib]
Mircea Marin.Functional Logic Programming with Distributed Constraint Solving. RISC, Johannes Kepler University Linz. PhD Thesis.2000.[bib]
C. Mittermaier, W. Schreiner, F. Winkler.A Parallel Symbolic-Numerical Approach to Algebraic Curve Plotting. In: 3rd Workshop on Computer Algebra in Scientific Computing (CASC-2000), V.G. Ghanza, E.W. Mayr, E.V. Vorozhtsov (ed.), Proceedings of CASC-2000, pp. 301-314.2000.Springer-Verlag,ISBN 3-540-41040-6.[ps][pdf][bib]
W. Schreiner, C. Mittermaier, F. Winkler.On Solving Problem in Algebraic Geometry by Cluster Computing. In: Proceedings EURO-PAR 2000, A. Bode, T. Ludwig, W. Karl, R. Wismueller (ed.), Proceedings of Proc. EURO-PAR 2000, München, Germany, Aug./Sept. 2000, pp. 1196-1200.2000.Springer-Verlag Berlin, Lecture Notes in Computer Science,ISBN 3-540-67956-1.[22_europar2000][bib]
W. Schreiner, C. Mittermaier, F. Winkler.Analyzing Algebraic Curves by Cluster Computing. In: Distributed and Parallel Systems - From Instruction Parallelism to Cluster Computing, P. Kacsuk and G. Kotsis (ed.), Proceedings of Proc. of DAPSYS'2000 (Austrian-Hungarian Workshop on Distributed and Parallel Systems), pp. 49-58.September2000.Kluwer Acad. Publishers, Boston,ISBN 0-79237-892-X.[24_dapsys2000][bib]
W. Schreiner, C. Mittermaier, F. Winkler.Plotting Algebraic Space Curves by Cluster Computing. In: Computer Mathematics (ASCM 2000), X.-S. Gao and D. Wang (ed.), Proceedings of Proc. of ASCM 2000, pp. 49-58.2000.World Scientific Publishers, Singapore/River Edge,ISBN 9-81024-498-3.[25_paper][bib]
G.E. Andrews, A. Knopfmacher, P. Paule.An infinite family of Engel expansions of Rogers-Ramanujan type.Adv. in Appl. Math.25, pp. 2-11.2000.ISSN 0196-8858.[pdf][bib]
P. Paule.Algorithmic Problem Solving. In: Encyclopedia of Computer Science, A. Ralston, E.D. Reilly, D. Hemmendinger (ed.), pp. 38-40.2000.Nature Publishing Group, London,ISBN: 1850328005.[bib]
Peter Paule.A Mathematica Package for Extended Engel Expansions of q-series., pp. 0-0.2000.editor: K. Alladi,0.[bib]
C. Schneider.An Implementation of {K}arr's Summation Algorithm in Mathematica.Sem. Lothar. Combin.S43b, pp. 1-10.2000.ISSN 1286-4889.[url][pdf][ps][bib]
Peter Stadelmeyer.On the Computational Complexity of Resolving Curve Singularities and Related Problems. RISC, Johannes Kepler University Linz. PhD Thesis.2000.[bib]
Q.-N. Tran, F. Winkler (ed.).Applications of the Gröbner Basis Method.special issue of the journal "Journal of Symbolic Computation"30/4,1 edition,October2000.Academic Press, Inc.,ISSN 0747-7171.[bib]
Daniela Vasaru Dupre.Automated Theorem Proving by Integrating Proving, Solving and Computing. RISC, Johannes Kepler University of Linz. PhD Thesis.2000.[zip][bib]
F. Winkler.Advances and Problems in Algebraic Computation. In: Contributions to General Algebra 12, D. Dorninger (ed.), Proceedings of Proc. AAA'58, Vienna, pp. 51-70.2000.Verlag Johannes Heyn, Klagenfurt,ISBN 3-85366-951-4.[pdf][ps][bib]
1999
B. Buchberger, T. Jebelean.Teaching of Mathematics Using Theorema. The International Journal of Computer Algebra in Mathematical Education6(1), pp. 25-50.1999.Copyright: Research Information Ltd., UK.,ISSN 1362-7368.[bib]
B. Buchberger, T. Jebelean.Distance Teaching of Mathematics Using Theorema. In: Proceedings of the 3rd Technion Symposium on Software for Communication, H. Gutmann (ed.), pp. -.April 1-31999.Hagenberg, Austria,[bib]
B. Buchberger.Theory Exploration Versus Theorem Proving. In: Proceedings of the Calculemus '99 Workshop, A. Armando, T. Jebelean (ed.), Electronic Notes in Theoretical Computer Science23/3, pp. 386-386.1999.Elsevier,-.[bib]
F. Caruso.A Macsyma Implementation of Zeilberger's Fast Algorithm. In: Sém. Lothar. Combin. S43c, V. Strehl (ed.), pp. 1-8.1999.ISSN 1286-4889.[ps][ps][pdf][bib]
F. Chyzak, I. Gutman, P. Paule.Predicting the number of hexagonal systems with 24 and 25 hexagons.Communications in Mathematical and Computer Chemistry40, pp. 139-151.1999.ISSN: 0340-6253.[pdf][bib]
G.E. Andrews, P. Paule.MacMahon's Partition Analysis IV: Hypergeometric Multisums.Sém. Lothar. Combin.B42i, pp. 1-24.1999.electronic journal.[pdf][bib]
J.R. Sendra, F. Winkler.Algorithms for Rational Real Algebraic Curves.Symbolic Computation and Artificial Intelligence39(1-2), pp. 211-228.1999.Fundamenta Informaticae,ISSN 0169-2968.Fukndamenta Informaticae.[ps][pdf][bib]
Windsteiger W..Building Up Hierarchical Mathematical Domains Using Functors in THEOREMA. In: Electronic Notes in Theoretical Computer Science, A. Armando and T. Jebelean (ed.), Proceedings of Calculemus'99, Trento, Italy, ENTCS23/3, pp. 401-419.1999.Elsevier,ISSN: 1571-0661.[url][pdf][bib]
1998
B. Buchberger, T. Jebelean, D.Vasaru.Theorema: A System for Formal Scientific Training in Natural Language Presentation. In: Proceedings of Ed-Media 1998 (International Conference on Educational Multimedia), - (ed.), pp. 174-179.June 20-231998.Freiburg, Germany,[bib]
B. Buchberger.Introduction to Groebner Bases. In: Groebner Bases and Applications, B. Buchberger, F. Winkler (ed.), London Mathematical Society Lecture Notes Series 251, pp. 3-31.1998.Cambridge University Press,ISBN 0-521-63298-6.[pdf][bib]
B. Buchberger, W.Windsteiger.The Theorema Language: Implemening Object- and Meta-Level Usage of Symbols. In: Proceedings of the Second International Theorema Workshop, B. Buchberger, T. Jebelean (ed.), pp. -.June 29-301998.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 98-10.[bib]
B. Buchberger, T. Jebelean.Theorema: Using the Predicate Logic Prover for Proof Training. In: Proceedings of the Second International Theorema Workshop, B. Buchberger, T. Jebelean (ed.), pp. -.June 29-301998.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 98-10.[bib]
B. Buchberger.Theorema: The Current Status. In: Proceedings of the Second International Theorema Workshop, B. Buchberger, T. Jebelean (ed.), pp. -.June 29-301998.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 98-10.[bib]
B. Buchberger.An Algorithmic Criterion for the Solvability of a System of Algebraic Equations. In: Gröbner Bases and Applications, B. Buchberger, F. Winkler (ed.), London Mathematical Society Lecture Notes Series 251, pp. 535-545.1998.Cambridge University Press,ISBN 0-521-63298-6.[pdf][bib]
B. Buchberger, F. Winkler (ed.).Gröbner Bases and Applications - Proceedings of 33 Years of Gröbner Bases.London Mathematical Society Lecture Note Series 251,1 edition,March1998.Cambridge University Press,ISBN-10: 0521632986; ISBN-13: 978-0521632980.[bib]
E. Hillgarter, F. Winkler.Points on Algebraic Curves and the Parametrization Problem. In: Automated Deduction in Geometry, D. Wang (ed.), LNAI 1360, pp. 189-207.1998.Springer-Verlag Berlin Heidelberg,ISSN 0302-9743; ISBN 3-540-64297-8.[pdf][bib]
Elena Kartashova.Wave resonances in systems with discrete spectra. In: Nonlinear Waves and Weak Turbulence, V.E. Zakharov (ed.), AMS Translations 2182, pp. 95-130.1998.American Mathematical Society,0821841130.[url][bib]
P. Hjorth, P. Lisonek, S. Markvorsen, C. Thomassen.Finite metric spaces of strictly negative type.Linear Algebra Appl.270, pp. 255-273.1998.ISSN 0024-3795.[bib]
J.M. Borwein, D.M. Bradley, D.J. Broadhurst, P. Lisonek.Combinatorial aspects of multiple zeta values.Electron. J. Combin.5, pp. 1-12.1998.ISSN 1077-8926.[bib]
S.A. Abramov, P. Paule, M. Petkovsek.$q$-Hypergeometric solutions of $q$-difference equations.Discrete Math.180, pp. 3-22.1998.ISSN 0012-365X.[pdf][bib]
Nikolaj Popov.Periodic Interactions. Department of Mathematical Logic and Applications, Faculty of Mathematics and Computer Science, Sofia University, Bulgaria. Diploma Thesis.November1998.[bib]
J.R. Sendra, F. Winkler.Real Parametrization of Algebraic Curves. In: Artificial Intelligence and Symbolic Computation, J. Calmet and J. Plaza (ed.), Proceedings of Proc. Internat. Conf. AISC'98, LNAI 1476, pp. 284-295.1998.Springer-Verlag,ISBN 3-540-64960.[pdf][bib]
Elena Tomuta.An Architecture for Combining Provers and its Applications in the Theorema System.. RISC, Johannes Kepler University of Linz. PhD Thesis.1998.[ps][bib]
F. Winkler.Geometric Algorithms Based on Computer Algebra. In: Mathematical Theory of Networks and Systems, A. Beghi, L. Finesso, G. Picci (ed.), Proceedings of Proc. MTNS-98 Symposium (II. Poligrafo, Padova, italy, 1998), pp. 681-684.1998.Poligrafo, Padova, Italy,ISBN 88-7115-117-8.[pdf][bib]
1997
B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, E. Tomuta, D. Vasaru.A Survey of the Theorema project. In: Proceedings of ISSAC'97 (International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, July 21-23, 1997), W. Kuechlin (ed.), pp. 384-391.1997.ACM Press, ISBN 0-89791-875-4.[bib]
B. Buchberger.Introduction to Groebner Bases. In: Logic of Computation, H.Schwichtenberg (ed.), Proceedings of NATO Advanced Study Institute on Logic of Computation, Marktoberdorf, Germany, July 25-August 6, 1995, NATO ASI Series, Series F: Computer and Systems SciencesVol. 157, pp. 35-66.1997.Springer - Verlag Berlin,ISBN 3-540-62963-7.[bib]
B. Buchberger.Groebner Bases.Encyclopaedia of Mathematics SupplementVolume I, pp. 275-275.1997.Kluwer Acad. Publ.,ISBN 0-7923-4709-9.(Editor-in-Chief: M. Hazewinkel).[bib]
B. Buchberger.Mathematica: Doing Mathematics by Computer?. In: Advances in the Design of Symbolic Computation Systems, A. Miola, M. Temperini (ed.), pp. 2-20.1997.Springer Vienna,ISSN 0943-853X, ISBN 3-211-82-844-3.RISC Book Series on Symbolic Computation.[bib]
B. Buchberger, M. Marin.Proving by Simplification. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger.A Note on Computing Times in Different Programming Styles in Mathematica. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger, D. Vasaru.Theorema: The Induction Prover over Lists. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger, T. Jebelean.Theorema: The Predicate Logic Prover. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger.The Theorema Prover for Equalities over the Natural Numbers. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger.Theorema: Natural Language and Nested Cells Representation of Proofs. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger, F. Kriftner.Theorema: The Language. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
B. Buchberger.Theorema: An Overview on the Project and the Proceedings. In: First International Theorema Workshop, B. Buchberger, T. Ida, D. Vasaru (ed.), pp. -.June 9-101997.RISC, Hagenberg, Austria,-.RISC-Linz Report Series No. 97-20.[bib]
Olga Caprotti.Symbolic Pattern Solving in Algebraic Structures. RISC, Johannes Kepler University Linz. PhD Thesis.1997.[bib]
P. Lisonek.New maximal two-distance sets.J. Combin. Theory Ser. A77, pp. 318-338.1997.ISSN 0097-3165.[bib]
M. van Eupen, P. Lisonek.Classification of some optimal ternary linear codes of small length,.Des. Codes Cryptogr.10, pp. 63-84.1997.ISSN 0925-1022.[bib]
J.M. Borwein, P. Lisonek, J.A. Macdonald.Arithmetic-geometric means revisited.The Maple Technical Newsletter4, pp. 20-27.1997.ISSN 1061-5733.[bib]
I. Nemes, P. Paule.A Canonical Form Guide to Symbolic Summation. In: Advances in the Design of Symbolic Computation Systems, A. Miola, M. Temperini (ed.), Texts Monogr. Symbol. Comput., pp. 84-110.1997.Springer, Wien-New York,ISBN 3211828443.[bib]
Andreas Neubacher.Parametric Robust Stability by Quantifier Elimination. RISC, Johannes Kepler University Linz. PhD Thesis.1997.[bib]
P. Paule, A. Riese.A Mathematica q-Analogue of Zeilberger's Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping. In: Special Functions, q-Series and Related Topics, M.E.H. Ismail and M. Rahman (ed.), Fields Inst. Commun.14, pp. 179-210.1997.Amer. Math. Soc.,ISBN 0-8218-0524-X.[pdf][bib]
A. Riese.Contributions to Symbolic q-Hypergeometric Summation. RISC, J. Kepler University Linz. PhD Thesis.1997.[pdf][bib]
M. Rosenkranz.Lagrange Inversion. RISC, J. Kepler University Linz. Diploma Thesis.1997.[ps][ps][pdf][bib]
C. Schneider.Implementierung von Automaten-Algorithmen mit Hilfe von binären Entscheidungsdiagrammen. Lehrstuhl für Künstliche Intelligenz (Informatik VIII), Friedrich Alexander Universität Erlangen-Nürnberg. Diploma Thesis.1997.(Engl. translation: Implementation of Algorithms for Automatons with Binary Decision Diagrams - BDD).Diploma Thesis.[ps][pdf][bib]
J.R. Sendra, F. Winkler.Parametrization of Algebraic Curves over Optimal Field Extentions.Journal of Symbolic Computation23(2&3), pp. 191-207.1997.ISSN 0747-7171.[pdf][ps][bib]
V. Sofronie-Stokkermans.Fibered Structures and Applications to Automated Proving in Certain Classes of Finitely-Valued Logics. RISC, Johannes Kepler University Linz. PhD Thesis.1997.[bib]
Tran Q.-N., F. Winkler.An Overview of CASA - A System for Computational Algebra and Constructive Algebraic Geometry.SAC Newletter2, pp. 63-72.1997.ISSN 1386-2634.[pdf][bib]
K. Wegschaider.Computer Generated Proofs of Binomial Multi-Sum Identities. RISC, J. Kepler University. Diploma Thesis.May1997.[ps][bib]
C.M. Hoffmann, J.R.Sendra, F. Winkler (ed.).Parametric Algebraic Curves and Applications.special issue of the journal "Journal of Symbolic Computation"23/2&3,1 edition,Feb./March1997.Academic Press Inc.,ISSN 0747-7171.[bib]
1996
B. Buchberger.Using Mathematica for Doing Simple Mathematical Proofs. In: Proceedings of the 4th Mathematica Users' Conference, Tokyo, November 2, 1996., - (ed.), pp. 80-96.1996.Copyright: Wolfram Media Publishing,-.[bib]
B. Buchberger.Mathematica as a Rewrite Language. In: Functional and Logic Programming (Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming, November 1-4, 1996, Shonan Village Center), T. Ida, A. Ohori, M. Takeichi (ed.), pp. 1-13.1996.Copyright: World Scientific, Singapore - New Jersey - London - Hong Kong,ISBN 981-02-2923-2.[ps][pdf][abstract][bib]
B. Buchberger.Symbolic Computation: Computer Algebra and Logic. In: Frontiers of Combining Systems, Proceedings of FROCOS 1996 (1st International Workshop on Frontiers of Combining Systems), March 26-28, 1996, Munich, F. Bader, K.U. Schulz (ed.), Applied Logic SeriesVol.3, pp. 193-220.1996.Kluwer Academic Publisher, Dordrecht - Boston - London, The Netherlands,-.[ps][pdf][abstract][bib]
B. Buchberger.Mathematische Software-Systeme: Die Zukunft (Mathematical Software Systems: The Future).Informatik-Spektrum19(2), pp. 100-101.1996.Springer, Heidelberg,ISSN 0170-6012.[bib]
W. Jacak, B. Buchberger, S. Stifter.Intelligent Systems Combining Reactive and Learning Capabilities. In: Proceedings of the 13th European Meeting on Cybernetics and Systems Research, Vienna, Austria, R. Trappl (ed.), pp. 77-82.1996.Austrian Society for Cybernetic Studies, Vienna,ISBN 3 85206 133 4.[bib]
W. Jacak, B. Buchberger, S. Dreiseitl, T. Kubik.Intelligent Robotic Arm Based on Reactive Control. In: Proceeding of the 5th International Workshop on Robotics in Alpe-Adria-Danube Region (RAAD'96), Budapest, Hungary, June 10-13, I. J. Rudas (ed.), pp. 297-302.1996.Hungarian Robotics Association, Budapest,ISBN 963 420 482 1.[bib]
B. Buchberger.Mathematiksoftware und Mathematikunterricht: Ein Vorwort (Mathematical Software and Mathematics Teaching: A Preface). In: Matheamatikunterricht mit Computeralgebra-Systemen, H.Heugl, W. Klinger, J. Lechner (ed.), pp. 9-13.1996.Addison-Wesley, Bonn - Reading,ISBN 3-8273-1082-2.[bib]
Ziming Li.A Subresultant Theory for Linear Differential, Linear Difference and Ore Polynomials. RISC, Johannes Kepler University Linz. PhD Thesis.1996.[pdf][bib]
C. Mallinger.Algorithmic Manipulations and Transformations of Univariate Holonomic Functions and Sequences. RISC, J. Kepler University. Diploma Thesis.August1996.[ps][pdf][bib]
M. Mnuk, F. Sendra, F. Winkler.On the Complexity of parametrizing Curves.Beiträge zur Algebra und Geometrie37(2), pp. 309-328.1996.Heldermann Verlag,ISSN 0138-4821.[32_paper][bib]
M. Mnuk, F. Winkler.CASA - A System for Computer Aided Constructive Algebraic Geometry. In: International Symposium on Design and Implementation of Symbolic Computation Systems (DISCO'96), J. Calmet, C. Limongelli (ed.), Proceedings of DISCO'96 (Karlsruhe, Germany, September 1996), LNCS 1128, pp. 297-307.October1996.Springer-Verlag,ISBN-10: 3540616977; ISBN-13: 978-3540616979.[pdf][bib]
P. Paule.A Classical Hypergeometric Proof of an Important Transformation Formula Found by J.-B. Baillon and R.E. Bruck. In: Theory and Applications of Nonlinear Operators of Accretive and Monotype Type, A. G. Kartsatos (ed.), Lecture Notes in Pure and Appl. Math.178, pp. 241-242.1996.Marcel Dekker,ISBN 0824797213.[pdf][bib]
P. Paule.A Proof of a Conjecture of Knuth.Experiment. Math.5, pp. 83-89.1996.ISSN 1058-6458.[pdf][bib]
R. Pirastu.On Combinatorial Identities: Symbolic Summation and Umbral Calculus. RISC, J. Kepler University Linz. PhD Thesis.1996.[pdf][ps][bib]
A. Riese.A Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation.Electron. J. Combin.3(#R19), pp. 1-16.1996.ISSN 1077-8926.[pdf][bib]
Quoc-Nam Tran.A Hybrid Symbolic-Numerical Approach in Computer Aided Geometric Design (CAGD) and Visualization. RISC, Johannes Kepler University Linz. PhD Thesis.1996.[bib]
Carl van Geem.Fast Planning of a Good Path for a Manipulator Using Potential Fields on a Non-Uniform Grid in C-space. RISC, Johannes Kepler University Linz. PhD Thesis.1996.[bib]
F. Winkler.Parametrized Solutions of Algebraic Equations.J. of Mathematics and Computers in Simulation42(4-6), pp. 333-338.1996.ISSN 0378-4754.[pdf][bib]
F. Winkler.Algebraic Computation in Geometry.J. of Mathematics and Computers in Simulation42(4-6), pp. 529-537.1996.ISSN 0378-4754.[pdf][bib]
F. Winkler.Polynomial Algorithms in Computer Algebra.Texts and Monographs in Symbolic Computation,1 edition,1996.Springer-Verlag Wien New York,ISBN 3-211-82759-5.[bib]
1995
Eugen Ardeleanu.Invariant Theory of Finite Groups and Applications. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
Klaus Kusche.Castle – Design and Implementation of a Symbolic Computation Language with Emphasis on Polymorphism and Efficiency. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
I. Duleba, W. Jacak, R. Muszynski, B. Buchberger.Symbolic Computation-Based Synthesis of Neural Network Dynamics and Controllers for Robots. In: Proceedings of the 1995 IEEE International Conference on Neural Networks (ICNN'95), Perth, Australia, - (ed.), pp. 2720-2725.1995.-.[bib]
B. Buchberger.Symbolic Computation Software Systems: The Current State of Technology. In: Proceedings of the EUROSIM 95 Conference, F. Breitenecker, I. Husinsky (ed.), pp. 85-94.September 5-71995.Elsevier,Technical University, Vienna,ISBN 0-444-82241-0.[bib]
Mark Encarnacion.Faster Algorithms for Reconstructing Rationals, Computing Polynomial GCDs, and Factoring Polynomials. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
Wolfgang Gehrke.Decidability Results for Categorical Notions Related to Monads by Rewriting Techniques. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
H. Hong, D. Wang, F. Winkler (ed.).Algebraic Approaches to Geometric Reasoning.special issue of the journal "Annals of Mathematics and Artificial Intelligence"13/1&2,1 edition,March1995.editor-in-chief M.C. Golumbic, publisher J.C. Baltzer AG,ISSN 1012-2443.[bib]
Elena Kartashova.On large-scale dynamics of weakly nonlinear wave systems. In: Advanced Series in Nonlinear Dynamics 7, Mielke A., Kirchgässner K. (ed.), pp. 282-290.1995.World Scientific,981022124X.[bib]
P. Lisonek.Denumerants and their approximations.J. Combin. Math. Combin. Comput.18, pp. 225-232.1995.ISSN 0835-3026.[bib]
P. Lisonek.Local and global majorities revisited.Discrete Math.146, pp. 153-158.1995.ISSN 0012-365X.[bib]
P. Lisonek.Closed forms for the number of polygon dissections.J. Symbolic Comput.20, pp. 595-601.1995.ISSN 0747-7171.[bib]
Ana Maria Mandache.Gröbner Bases Computation and Gaussian Elimination. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
Michal Mnuk.Algebraic and Geometric Approach to Parametrization of Rational Curves. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
I. Nemes, M. Petkovsek.RComp: A Mathematica Package for Computing with Recursive Sequences.J. Symbolic Comput.20, pp. 745-753.1995.ISSN 0747-7171.[bib]
P. Paule, V. Strehl.Symbolic Summation - Some Recent Developments. In: Computer Algebra in Science and Engineering - Algorithms, Systems, and Applications, J. Fleischer et al. (ed.), pp. 138-162.1995.World Scientific, Singapore,ISBN 981-02-2319-6.[pdf][bib]
P. Paule.Greatest Factorial Factorization and Symbolic Summation.J. Symbolic Comput.20, pp. 235-268.1995.ISSN 0747-7171.[pdf][bib]
R. Pirastu, K. Siegl.Parallel Computation and Indefinite Summation: A MAPLE Application for the Rational Case.J. Symbolic Comput.20, pp. 603-616.1995.ISSN 0747-7171.[pdf][ps][bib]
R. Pirastu, V. Strehl.Rational Summation and Gosper-Petkovsek Representation.J. Symbolic Comput.20, pp. 617-635.1995.ISSN 0747-7171.[pdf][ps][bib]
R. Pirastu.Algorithms for Indefinite Summation of Rational Functions in Maple.The Maple Technical Newsletter2(1), pp. 1-12.1995.ISSN 1061-5733.[pdf][ps][bib]
A. Riese.A Mathematica q-Analogue of Zeilberger's Algorithm for Proving q-Hypergeometric Identities. RISC, J. Kepler University Linz. Diploma Thesis.1995.[pdf][bib]
Josef Schicho.Rational Parametrization of Algebraic Surfaces. Symbolic Solution of an Equation in three Variables. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
P. Paule, M. Schorn.A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities.J. Symbolic Comput.20, pp. 673-698.1995.ISSN 0747-7171.[pdf][bib]
M. Schorn.Contributions to Symbolic Summation. RISC, J. Kepler University. Diploma Thesis.December1995.[pdf][ps][bib]
Wolfgang Schreiner.Parallel Functional Programming for Computer Algebra. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
Volker Stahl.Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
Karel Stokkermans.A Categorical Framework and Calculus for Critical-Pair Completion. RISC, Johannes Kepler University Linz. PhD Thesis.1995.[bib]
F. Winkler.Computer Algebra - Problems and Developments. In: Computer Algebra in Industry 2 (SCAFI'92), S. M. Verduyn Lunel (ed.), Proceedings of SCAFI'92, pp. 1-17.March1995.J. Wiley & Sons,ISBN-10: 0471955299; ISBN-13: 978-0471955290.[pdf][bib]
1994
Tudor Jebelean.Systolic Multiprecision Arithmetics. RISC, Johannes Kepler University Linz. PhD Thesis.1994.[bib]
R. Folk, A. Kartashov, E. Kartashova.A neural network capable of invariant recognition of recurrent patterns in data time series.J. Neural Network World6, pp. 689-698.1994.isbn.[bib]
Elena Kartashova.Towards H-mode discharge explanation?. In: Current Topics in Astrophysical and Fusion Plasma, Heyn M.F., Kernbichler W., and Biernat K. (ed.), pp. 179-184.1994.Verlag für die Technische Universität Graz,isbn.[bib]
Elena Kartashova.Weakly nonlinear theory of finite-size effects in resonators.Physical Review Letters72, pp. 2013-2016.1994.American Physical Society,ISSN 1079-7114 (online), 0031-9007 (print).[url][bib]
Elena Kartashova.Clipping - a new investigation method for PDEs in compact domains.Theoretical and Mathematical Physics99, pp. 675-680.1994.Springer,ISSN: 0040-5779 (print), 1573-9333 (electronic)..[url][bib]
C. Limongelli, R. Pirastu.Exact Solution of Linear Equation Systems over Rational Numbers by Parallel p-Adic Arithmetic. In: Procs. CONPAR94-VAPP VI Linz, B. Buchberger, J. Volkert (ed.), Lecture Notes in Comput. Sci.854, pp. 313-323.1994.ISBN: 3-540-58430-7.[pdf][ps][bib]
P. Lisonek.Computer-assisted Studies in Algebraic Combinatorics. RISC, J. Kepler University Linz. PhD Thesis.1994.[ps][pdf][bib]
P. J. Grabner, R. F. Tichy, I. Nemes, A. Petho.Generalized Zeckendorf Expansions.Appl. Math. Lett.7, pp. 25-28.1994.ISSN 0893-9659.[bib]
P. Paule.Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type.Electron. J. Combin.1, pp. 1-9.1994.ISSN 1077-8926.[pdf][bib]
Stefan Ratschan.RISC-CLP(Tree) A Constraint Logic Programming System with Parametric Domain. RISC, Johannes Kepler University Linz. PhD Thesis.1994.[bib]
F. Winkler.On Symbolic Parametrization of Algebraic Curves. In: 14th IMACS World Congress, W.F. Ames (ed.), Proceedings of 14th IMACS World Congress, Atlanta, Georgia3, pp. 1542-1544.1994.ISSN 1542-1544.[pdf][bib]
1993
B. Buchberger, T. Jebelean.Systolic Multiprecision Arithmetic. In: Proceedings of Impact TEMPUS JEP and Hungarian Transputer Users Group Workshop "Parallel Processing in Education", - (ed.), pp. -.March1993.Miskolc, Hungary,-.[bib]
G.M. Reznik, L.I.Piterbarg, E.A. Kartashova.Nonlinear interactions of spherical Rossby waves.Dynamics of Atmosphere and Oceans18, pp. 235-252.1993.Elsevier,ISSN: 0377-0265.[bib]
P. Lisonek, P. Paule, V. Strehl.Improvement of the Degree Setting in Gosper's Algorithm.J. Symbolic Comput.16, pp. 243-258.1993.ISSN 0747-7171.[pdf][bib]
R. Folk, A. Kartashov, P. Lisonek, P. Paule.Symmetries in Neural Networks: A Linear Group Approach.J. Phys. A26, pp. 3159-3164.1993.ISSN 0305-4470.[bib]
G. E. Andrews, P. Paule.Some Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity.J. Symbolic Comput.16, pp. 147-153.1993.ISSN 0747-7171.[pdf][bib]
J. Hornegger, R. Pirastu.Die Speziestheorie und die Implementation ihrer Zykelindexreihen in Scratchpad II.Bayreuth. Math. Schr.43, pp. 11-34.1993.ISSN 0172-1062.[pdf][ps][bib]
R. Pirastu.A note on the minimality problem in indefinite summation of rational functions.Sém. Lothar. Combin.31, pp. 1-7.1993.ISSN 1286-4889.[ps][pdf][bib]
Bernhard Wall.Symbolic Computation with Algebraic Sets. RISC, Johannes Kepler University Linz. PhD Thesis.1993.[bib]
F. Winkler.Computer Algebra: Principles. In: Encyclopedia of Computer Science, Concise Encyclopedia of Computer Science, A. Ralston, E.D. Reilly (ed.), pp. 227-231.1993.Van Nostrand Reinhold, Wiley,ISBN-10: 0-333-77879-0, ISBN-13: 0-470-09095-2.[pdf][bib]
1992
B. Buchberger, J. Elias.Using Groebner Bases for Detecting Polynomial Identities. A Case Study on Fermat's Ideal.Journal of Number Theory41(3), pp. 272-279.July1992.Academic Press, New York,0022-314X/92.[pdf][bib]
E. A. Kartashova, G.M. Reznik.Interactions between Rossby waves in bounded regions.Oceanology31, pp. 385-389.1992.American Geophysical Union,issn.[bib]
Elena Kartashova.Resonant interactions of water waves with discrete spectra. In: Proc. NWWW, D.H. Peregrine (ed.), Proceedings of Nonlinear Water Waves Workshop (NWWW), pp. 43-53.1992.Bristol University, UK,ISBN: 0862923905.[bib]
B. Kutzler, B. Wall, F. Winkler.Mathematische Expertensysteme - Praktisches Arbeiten mit den Computer-Algebra-Systemen MACSYMA, Mathematica und DERIVE.1 edition,1992.Expert Verlag,Ehningen bei Böblingen,ISBN 3-8169-0908-6.[bib]
R. Pirastu.Algorithmen zur Summation rationaler Funktionen. University of Erlangen-Nürnberg. Diploma Thesis.1992.[pdf][ps][bib]
Windsteiger W..Gröbner Bases: A Characterization by Syzygy Completeness and an Implementation. University of Linz, RISC Institute. Diploma Thesis.January1992.[ps][bib]
F. Winkler.Computer Algebra. In: Encyclopedia of Physical Science and Technology Vol. 4, R.A. Meyers (ed.), pp. 0-0.1992.Academic Press,no.[pdf][bib]
F. Winkler.Automated Theorem Proving in Nonlinear Geomatry. In: Issues in Robotics and Nolinear Geometry, C. Hoffmann (ed.), Chapter Advances in Computing Research6, pp. 183-197.December1992.JAI Press,ISBN-13: 9781559383424; ISBN: 1559383429.[pdf][bib]
1991
B. Buchberger.Groebner Bases in Mathematica: Enthusiasm and Frustration. In: Proceedings of the IFIP Working Conference on Programming Environments for High-Level Symbolic Computation, September 23-27, Karlsruhe, Germany, P. W. Gaffney, E. N. Houstis (ed.), pp. 80-91.1991.Copyright: IBM, Bergen Scientific Center Publishing,-.[pdf][bib]
B. Buchberger, T. Jebelean.Systolic Algorithms in Computer Algebra. In: Proceedings of the NATO ASI on Parallel Processing on Distributed Memory Multiprocessors, - (ed.), pp. -.July1991.Ankara,-.[bib]
Michael Kalkbrener.Three Contributions to Elimination Theory. RISC, Johannes Kepler University Linz. PhD Thesis.1991.[bib]
Elena Kartashova.On properties of weakly nonlinear wave interactions in resonators.Physica D54, pp. 125-134.1991.Elsevier,ISSN: 0167-2789.[url][bib]
E. A. Kartashova, G.M. Reznik.Rossby waves interactions in rectangular basins [in Russian].OkeanologiaXXXI(4), pp. 533-539.1991.ISSN PRINT: 0030-1574.[bib]
J. Bajer, P. Lisonek.Symbolic computation approach to nonlinear dynamics.J. Modern Opt.38, pp. 719-729.1991.ISSN 0950-0340.[bib]
Herwig Mayr.Real-Time Dynamic Collision Checking Integrated into Graphic Manufacturing Simulation. RISC, Johannes Kepler University Linz. PhD Thesis.1991.[bib]
I. Nemes.On the solution of a diophantine equation with sieve algorithm. In: Proceedings of the Colloquium on Computational Number Theory held at Kossuth Lajos University, Debrecen (Hungary), September 4-9, 1989, A. Pethö, M. E. Pohst, H. C. Williams, H. G. Zimmer (ed.), pp. 302-319.1991.Walter de Gruyter,ISBN 3-11-012394-0.[bib]
J.R. Sendra, F. Winkler.Symbolic Parametrization of Curves.Journal of Symbolic Computation12(6), pp. 607-631.1991.ISSN 0747-7171.[ps][pdf][bib]
F. Winkler.Representation of Algebraic Curves. In: IV International Conference on Computer Algebra in Physical Research, V.P. Gerdt (ed.), pp. 185-189.1991.World Scientific,ISBN-10: 9810206879; ISBN-13: 978-9810206871.[pdf][bib]
R. Gebauer, M. Kalkbrener, B. Wall, F. Winkler.CASA: A Computer Algebra Package for Constructive Algebraic Geometry. In: International Symposium on Symbolic and Algebraic Computation (ISSAC'91), S. M. Watt (ed.), pp. 403-410.July1991.ACM Press,ISBN:0-89791-437-6.[pdf][bib]
1990
B. Buchberger.Should Students Learn Integration Rules?.ACM SIGSAM Bulletin24(1), pp. 10-17.January1990.-.[pdf][bib]
E. Kaltofen, B. Buchberger.Editorial for Special Issue Computational Algebraic Complexity. In: Journal of Symbolic Computation, E. Kaltofen, B. Buchberger (ed.)Vol.9, pp. 225-228.1990.Academic Press Limited,0747-7171/90.[pdf][bib]
Elena Kartashova.Partitionig of ensembles of weakly interacting dispersing waves in resonators into disjoint classes.Physica D46, pp. 43-56.1990.Elsevier,ISSN:0167-2789.[url][bib]
E. A. Kartashova, L.I. Piterbarg, G.M. Reznik.Weakly nonlineaar interactions between Rossby waves on a sphere.Oceanology29, pp. 405-411.1990.American Geophysical Union,issn.[bib]
Elena Kartashova.Resonant Interactions of Rossby waves in Bounded Domains [in Russian]. P.P.Shirshov Institute for Oceanology, USSR Academy of Sciences, Moscow. PhD Thesis.December1990.[bib]
B. Kutzler, F. Lichtenberger, F. Winkler.Softwaresysteme zur Formelmanipulation - Praktisches Arbeiten mit den Computer-Algebra-Systemen REDUCE, MACSYMA und DERIVE.1 edition,1990.Expert Verlag,Ehningen bei Böblingen,ISBN 3-8169-0445-9.[bib]
F. Winkler.Solution of Equations I: Polynomial Ideals and Groebner Bases. In: Computers and Mathematics, R.D. Jenks, D. Chudnovsky (ed.)125, pp. 383-407.1990.Marcel Dekker,ISBN-10: 0824783417; ISBN-13: 978-0824783419.[pdf][bib]
F. Winkler.Groebner Bases in Geometry Theorem Proving and Simplest Degeneracy Conditions.Mathematica Pannonica1(1), pp. 15-32.1990.no.[pdf][bib]
1989
Peter M. Hintenaus.Decomposing and Parametrizing the Solution Set of an Algebraic System. RISC, Johannes Kepler University Linz. PhD Thesis.1989.[bib]
Gerhard Funk.A Verification System for Total Correctness of the Parallel L-Language. RISC, Johannes Kepler University Linz. PhD Thesis.1989.[bib]
R. Michelic Birgmayer.Algorithmic Problems: Primary Decompostion and Beyond. RISC, Johannes Kepler University Linz. PhD Thesis.1989.[bib]
Kartashov A.P., Kartashova E.A..Construction of netwroks of neuron-like elements with acyclic activity and exponential delay time.Automation and Remote Control2, pp. 147-157.1989.Springer,ISSN PRINT: 0005-1179, ISSN ONLINE: 1608-3032.[bib]
Kartashova E.A., Piterbarg L.I., Reznik G.I..Resonant inteeractions of spherical Rossby waves [in Russian].OkeanologiaXXIX(4), pp. 533-542.1989.USSR Academy of Sciences,ISSN PRINT: 0030-1574.[bib]
F. Winkler.A Geometrical Decision Algorithm Based on the Groebner Bases Algorithm. In: International Symposium on Symbolic and Algebraic Computation (ISSAC'88), P. Gianni (ed.)358, pp. 356-363.September1989.Springer-Verlag Lecture Notes in Computer Science,ISBN-10: 3540510842; ISBN-13: 978-3540510840.[pdf][bib]
F. Winkler.Equational Theorem Proving and Rewrite Rule Systems. In: 5. Österreichische Artificial-Intelligence-Tagung, J. Retti and K. Leidlmair (ed.), Informatik Fachberichte 208, pp. 26-39.1989.Springer-Verlag,ISBN:3-540-51039-7.[pdf][bib]
A. Kandri-Rody, D. Kapur, F. Winkler.Knuth-Bendix Procedure and Buchberger Algorithm - A Synthesis. In: International Symposium on Symbolic and Algebraic Computation (ISSAC'89), G. H. Gonnet (ed.), pp. 55-67.July1989.ACM Press,ISBN 0-89791-325-6.[pdf][bib]
1988
B. Buchberger, G. E. Collins, B. Kutzler.Algebraic Methods for Geometric Reasoning. In: Annual Reviews in Computer Science, J. F. Traub (ed.)Vol. 3, pp. 85-119.1988.Copyright: Annual Reviews Inc.,ISSN 8756-7016/88.[pdf][bib]
Kartashova E.A..Weakly nonlinear interactions of spherical Rossby waves and transition to beta-plane [in Russian]. In: Proceedings, ed (ed.), Proceedings of Conference of Young Scientists, P.P.Shirshov Institute for Oceanology, pp. 21-25.1988.Institute of Oceanology, USSR Academy of Sciences,issn.[bib]
Bernhard Kutzler.Algebraic Approaches to Automated Geometry Theorem Proving. RISC, Johannes Kepler University Linz. PhD Thesis.1988.[bib]
Martin Rudalics.Multiprocessor List Memory Management. RISC, Johannes Kepler University Linz. PhD Thesis.1988.[bib]
Sabine Stifter.A Medley of Solutions to the Robot Collision Problem in two and three Dimensions. RISC, Johannes Kepler University Linz. PhD Thesis.1988.[bib]
F. Winkler.A p-adic Approach to the Computation of Gröbner Bases.Journal of Symbolic Computation6(2&3), pp. 287-304.1988.Elsevier,ISSN 0747-7171.[pdf][bib]
1987
B. Buchberger.History and Basic Features of the Critical-Pair/Completion Procedure.Journal of Symbolic Computation3(1/2), pp. 3-38.1987.Copyright: Academic Press Inc., Harcourt Brace Jovanovich Publishers, London,ISSN 0747-7171.(Earlier version appeared in: Proceedings of the Conference on Rewrite Technique and Applications, Dijon, May 1985, Lecture Notes in Computer Science, Vol. 202, Springer, 1985, pp. 1-45).[pdf][bib]
B. Buchberger.Applications of Groebner Bases in Non-Linear Computational Geometry. In: IMA Volumes in Mathematics and its Applications, Vol. 14, J. R. Rice (ed.), Proceedings of Workshop on Scientific Software, Minneapolis, USA, March 23-26, 1987, pp. 59-88.1987.Copyright: Springer, New York,-.[pdf][pdf][pdf][bib]
B. Buchberger.The Parallelization of Critical-Pair/Completion Procedures on the L-Machine. In: Proceedings of the Japanese Symposium on Functional Programming, RIKEN Institute, - (ed.), pp. 54-61.February1987.-.[bib]
P. Paule.The Concept of Bailey Chains.Sém. Lothar. Combin.B18f, pp. 1-24.1987.electronic journal.[pdf][bib]
P. Paule.A Remark on a Lemma of Ingleton and Piff and the Construction of Bijections.Bayreuth. Math. Schr.25, pp. 123-127.1987.ISSN 0172-1062.[pdf][bib]
P. Paule.A Note on Bailey's Lemma.J. Combin. Theory Ser. A44, pp. 164-167.1987.ISSN 0097-3165.[pdf][bib]
F. Winkler.Computer Algebra.The Encyclopedia of Physical Science and Technology, pp. 0-0.1987.R. A. Meyers, Academic Press,ISBN-10: 0122274105 ; ISBN-13: 978-0122274107.Updated version in "The Encyclopedia of Physical Science and Technology Vol. 4", 1992.[bib]
1986
F. Winkler, B. Buchberger.A Criterion for Eliminating Unnecessary Reductions in the Knuth-Bendix Algorithm. In: Proceedings of Algebra and Logic in Computer Science, Gyor, Hungary, J. Demetrovics, G. Katona, A. Salomaa (ed.), Colloquia Mathematica Societatis Janos Bolyai42, pp. 849-869.September1986.North Holland,ISBN-10: 0444986952; ISBN-13: 978-0444986955.[pdf][bib]
B. Buchberger, B. Kutzler.Computer-Algebra fuer den Ingenieur (Computer Algebra for the Engineer). In: Rechnerorientierte Verfahren, B. Buchberger and B. Kutzler and M. Feilmeier and M. Kratz and U. Kulisch and S. Rump (ed.), pp. 11-68.1986.Teubner Verlag, Stuttgart,ISBN 3-519-02617-1.[pdf][pdf][pdf][bib]
I. Nemes, A. Petho. Polynomial Values in Linear Recurrences, II.J. Number Theory24, pp. 47-53.1986.ISSN 0022-314X.[bib]
P. Paule.Über das Involutionsprinzip von Garsia und Milne.Bayreuth. Math. Schr.21, pp. 295-319.1986.ISSN 0172-1062.[pdf][bib]
1985
F. Winkler, B. Buchberger, F. Lichtenberger, H. Rolletschek.Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals.ACM Transactions on Mathematical Software11(1), pp. 66-78.March1985.ACM,no.[pdf][bib]
B. Buchberger.Mathematik fuer Informatiker: Ein algorithmenorientierte Ansatz an der Universitaet Linz (Mathematics for Computer Scientists: An Algorithm Oriented Approach at the University of Linz). In: Proceedings of the Mathematica Didactics Conference, Kassel, Oct. 4-6, 1984, R. Schaper (ed.), pp. 156-172.1985.Copyright: Leuchtturm Verlag,-.[bib]
B. Buchberger, P. Hintenaus.The L-Language for the Parallel L-Machine (A Parallel Architecture for AI Applications). In: Proceedings of the Conference of the Austrian Society for Aritificial Intelligence, Vienna, H. Trost, J. Retti (ed.), Informatik-Fachberichte106, pp. 120-131.September1985.Copyright: Springer - Verlag Berlin,ISBN 3-540-15695-X.[pdf][bib]
B. Buchberger.The L-Machine: An Attempt at Parallel Hardware for Symbolic Computation. In: Proceedings of the AAECC Conference, Grenoble, J. Calmet (ed.), Springer Lecture Notes in Computer Science229, pp. 333-347.July1985.ISBN 978-3-540-16776-1.[pdf][bib]
B. Buchberger.History and Basic Features of the Critical-Pair/Completion Approach. In: Proceedings of the Conference on Rewriting Techniques and Applications, Dijon, J.-P. Jouannaud (ed.), Lecture Notes in Computer Science202, pp. 1-45.May1985.Springer,ISBN 978-3-540-15976-6.[bib]
B. Buchberger.The Parallel L-Machine for Symbolic Computation. In: Proceedings of EUROCAL '85 (European Conference on Computer Algebra), Linz, Austria, April 1-3, 1985, Proceedings Vol.2: Research Contributions, B.F. Caviness (ed.), Lectures Notes in Computer Science204, pp. 541-542.1985.Copyright: Springer - Verlag Berlin,ISBN 3-540-15984-3.[pdf][bib]
F. Lichtenberger, B. Buchberger.Mathematik fuer Informatiker: Ein algorithmenorienter Ansatz an der Universitaet Linz (Mathematics for Computer Scientists: An Algorithm Oriented Approach at the University of Linz). In: Special issue: Proceedings of the Symposium "Lehr- und Lernprozesse in der Ingenieurausbildung", Technische Universitaet Graz, Austria, October 8-9, 1985, - (ed.), Zeitschrift fuer Hochschuldidaktik9/10, pp. 103-110.1985.ISBN 3-900386-10-2.[pdf][bib]
B. Buchberger.Groebner-Bases: An Algorithmic Method in Polynomial Ideal Theory. In: Multidimensional Systems Theory - Progress, Directions and Open Problems in Multidimensional Systems, N.K. Bose (ed.), Chapter 6, pp. 184-232.1985.Copyright: Reidel Publishing Company, Dordrecht - Boston - Lancaster, The Netherlands, ISBN 90-277-1764-8, ISBN 1-4020-1623-9.(Second editioin: N.K.Bose (ed.): Multidimensional Systems Theory and Application, Kluwer Academic Publisher, 2003, pp.89-128.).[pdf][pdf][bib]
B. Buchberger et al..Symbolic Computation (An Editorial). In: Journal of Symbolic Computation, B. Buchberger (ed.)Vol. 1/1, pp. 1-6.1985.Academic Press Inc., Harcourt Brace Jovanovich Publishers, London,ISSN 0747-7171.[pdf][bib]
B. Buchberger, E.V. Krishnamurthy, F. Winkler.Gröbner Bases, Polynomial Remainder Sequences and Decoding of Multivariate Codes (Problem #7).Recent Trends in Multidimensional Systems Theory, pp. 252-256.1985.D. Reidel Publ. Comp.,ISBN-10: 90-277-1764-8; ISBN-13: 1-4020-1623-9.[pdf][bib]
P. Paule.Über die Inversionsstatistiken von MacMahon und Goulden-Jackson.Sém. Lothar. Combin.B13b, pp. 1-3.1985.electronic journal.[pdf][bib]
P. Paule.Ein neuer Weg zur q-Lagrangeinversion.Bayreuth. Math. Schr.18, pp. 1-37.1985.ISSN 0172-1062.[pdf][bib]
P. Paule.On Identities of the Rogers-Ramanujan Type.J. Math. Anal. Appl.107, pp. 255-284.1985.ISSN 0022-247X.[bib]
F. Winkler.Reducing the Complexity of the Knuth-Bendix Completion Algorithm: A "Unification" of Different Approaches. In: European Conference on Computer Algebra (EUROCAL'85), B. Buchberger (ed.), pp. 378-389.October1985.Springer Berlin,ISBN 978-3-540-15983-4.[pdf][bib]
1984
W. Bibel, B. Buchberger.Towards a Connection Machine for Logical Inference. In: Fifth Generation and Supercomputer Conference, Rotterdam, - (ed.), pp. 177-188.December1984.-.( Appeared in Future Generation Computer Systems 1/3).[pdf][bib]
B. Buchberger.The Present State of the L-Networks Project. In: Proceedings MIMI 84 (Conference on Mini- and Microcomputers and Their Applications), Bari, Juni 5-8, 1984, G. Mastronardi (ed.), pp. 178-181.1984.Copyright: Acta Press, Anaheim - Calgary - Zurich,ISBN 0-88986-058-0.[pdf][bib]
B. Buchberger.A Critical-Pair/Completion Algorithm for Finitely Generated Ideals in Rings. In: Logic and Machines: Decision Problems and Complexity (Proceedings of the Symposium "Rekursive Kombinatorik", Muenster, May 23-28, 1983), E. Boerger, G. Hasenjaeger, D. Roedding (ed.), Lecture Notes in Computer Science171, pp. 137-161.1984.Copyright: Springer - Verlag, Berlin - Heidelberg - New York -Tokyo, ISBN 3-540-13331-3, ISBN 0-387-13331-3.[pdf][bib]
B. Buchberger.Automatisches Programmieren (Automated Programming). In: Artificial Intelligence - Eine Einfuehrung, J. Retti et al. (ed.), pp. 169-198.1984.Teubner, Stuttgart, ISBN 3-519-02473-X.[pdf][pdf][pdf][pdf][bib]
F. Winkler.The Church-Rosser Property in Computer Algebra and Special Theorem Proving: An Investigation of Critical-Pair/Completion Algorithms.1 edition,1984.Verband der Wissenschaftlichen Gesellschaften Österreichs,ISBN 3-85369-584-1.Ph.D. dissertation.[bib]
F. Winkler.On the Complexity of the Gröbner-Bases Algorithm over K[x, y, z]. In: International Symposium on Symbolic and Algebraic Computation (EUROSAM'84), J. Fitch (ed.), pp. 184-194.June1984.Springer-Verlag,Cambridge, England,ISBN 978-3-540-13350-6.[pdf][bib]
Franz Winkler.The Church-Rosser Property in Computer Algebra and Special Theorem Proving. RISC, Johannes Kepler University Linz. PhD Thesis.1984.[bib]
1983
B. Buchberger.Components for Restructurable Multi-Microprocessor Systems of Arbitrary Topology. In: Proceedings of the 21st Symposium on Mini- and Microcomputers, MIMI 83, Lugano, - (ed.), pp. 67-71.June1983.-.[bib]
B. Buchberger.A Note on the Complexity of Constructing Groebner-Bases. In: Computer Algebra (Proceedings of EUROCAL 83, European Computer Algebra Conference, London, March 28-30, 1983), J.A. van Hulzen (ed.), Lecture Notes in Computer Science162, pp. 137-145.1983.Copyright: Springer- Verlag Berlin - Heidelberg - New York - Tokyo,ISBN 3-540-12868-9.[pdf][bib]
B. Buchberger.Groebner Bases: A Method in Symbolic Mathematics. In: Proceedings of "Les Journées de Saint-Etienne: Algorithmique, Calcul Formel, Arithmetique", - (ed.), pp. II.1-II.10.October 3-81983.Université de Saint-Etienne, U.E.R de Sciences,CAMP Punl.Nr. 83-24.0.[bib]
F. Winkler.An Algorithm for Constructing Detaching Bases in the Ring of Polynomials over a Field. In: European Computer Algebra Conference (EUROCAL'83), J. A. van Hulzen (ed.), LNCS 162, pp. 168-179.March1983.Sringer-Verlag,ISBN-10: 3540128689; ISBN-13: 978-3540128687.[pdf][pdf][bib]
1982
H. Moeller, B. Buchberger.The Construction of Multivariate Polynomials with Pre-assigned Zeros. In: Computer Algebra (Proceedings of EUROCAM '82, European Computer Algebra Conference), Marseille, April 5-7, 1982, J. Calmet (ed.), Lecture Notes in Computer Science144, pp. 24-31.1982.Copyright: Springer - Verlag Berlin - Heidelberg - New York,ISBN 3-540-11607-9.[pdf][bib]
B. Buchberger.Computer-unterstuetzter Algorithmenentwurf (Computer-Aided Algorithm Design). In: Proceedings of the Fruehjahrsschule Kuenstliche Intelligenz, Teisendorf, March 15-24, 1982, W. Bibel, J. H. Siekmann (ed.), Informatik-Fachberichte59, pp. 141-202.1982.Copyright: Springer -Verlag Berlin - Heidelberg - New York,ISBN 3-540-11974-4.[pdf][bib]
B. Buchberger, R. Loos.Algebraic Simplification. In: Computer Algebra - Symbolic and Algebraic Computation, B. Buchberger, G. E. Collins, R. Loos (ed.), pp. 11-43.1982.Copyrigth: Springer Verlag, Vienna - New York,-.[pdf][bib]
G.E. Collins, M. Mignotte, F. Winkler.Arithmetic in Basic Algebraic Domains. In: Computer Algebra - Symbolic and Algebraic Computation, B. Buchberger, G.E. Collins, R. Loos (ed.), pp. 189-220.1982.Springer-Verlag,ISSN 0163-5824.[pdf][bib]
Peter Paule.Zwei neue Transformationen als elementare Anwendungen der q-Vandermonde Formel. University of Vienna. PhD Thesis.1982.[bib]
1981
B. Buchberger, F. Lichtenberger.Mathematik für Informatik I – Die Methode der Mathematik (Mathematics for Computer Science I – The Method of Mathematics).Second edition,1981.Springer-Verlag, Berlin - Heidelberg - New York,ISBN 3-540-11150-6.[pdf][bib]
1980
Gilg Seeber.Kreativität und Universalität. RISC, Johannes Kepler University Linz. PhD Thesis.1980.[bib]
B. Buchberger, K. Aspetsberger.A Universal Variable-Topology Multi-Microcomputer-System. In: Proc. of the 6th International Symphosium on Mini- and Microcomputers, MIMI '80, Budapest, Hungary, - (ed.), pp. 136-140.September1980.-.[pdf][bib]
L. Bachmair, B. Buchberger.A Simplified Proof of the Characterization Theorem for Groebner-Bases.ACM SIGSAM Bull.14(4), pp. 29-34.November1980.Copyright: ACM, New York.,no.[pdf][bib]
Franz Lichtenberger.PL/ADT: Ein System zur Verwendung algebraisch spezifizierter abstrakter Datentypen in PL/I. RISC, Johannes Kepler University Linz. PhD Thesis.1980.[bib]
Heinrich Rolletschek.Contributions to the Systematics of Creativity Concepts. RISC, Johannes Kepler University Linz. PhD Thesis.1980.[bib]
1979
B. Buchberger.A Criterion for Detecting Unnecessary Reductions in the Construction of Groebner Bases. In: Proceedings of the EUROSAM 79 Symposium on Symbolic and Algebraic Manipulation, Marseille, June 26-28, 1979, E. W. Ng (ed.), Lecture Notes in Computer Science72, pp. 3-21.1979.Copyright: Springer, Berlin - Heidelberg - New York,ISBN 3-540-09519-5.[pdf][bib]
B. Buchberger, J. Fegerl, F. Lichtenberger.Computer Trees: A Concept for Parallel Processing.Microprocessing and Microsystems3(6), pp. 244-248.1979.-.[pdf][bib]
1978
Josef Falkinger.Universalitaet und Reduzierbarkeit von partiell rekursiven Funktionen, Automaten und deren Numerierungen. RISC, Johannes Kepler University Linz. PhD Thesis.1978.[bib]
B. Buchberger, B. Quatember.Systems with Universal Subsystems: Realization and Application. In: Proceedings of the Fourth European Meeting on Cybernetics and Systems Research, Linz, - (ed.), Progress in Cybernetics and Systems ResearchVol. VII, pp. 25-32.April1978.Hemisphere Publ. Corp.,-.[pdf][bib]
C. Kollreider, B. Buchberger.An Improved Algorithmic Construction of Groebner Bases for Polynomial Ideals.ACM SIGSAM Bull.12(2), pp. 27-36.May1978.-.[pdf][bib]
B. Buchberger.Computer-Trees and Their Programming. In: Proceedings of the 4th Coll. "Les arbres en algebre et en programmation", February16-18, 1978, University of Lille, Dept. of Computer Science, - (ed.), pp. 1-18.1978.-.[pdf][bib]
B. Buchberger, B. Roider.Input/Output Codings and Transition Functions in Effective Systems.Internat. Journal on General Systems4(3), pp. 201-209.1978.-.[pdf][bib]
1977
B. Buchberger, W. Menzel.Simulation-Universal Automata. In: Proceedings of the Internat. Workshop on Semantics of Programming Languages, - (ed.)41, pp. 30-34.March 21-251977.Bad Honnef,Universitaet Dortmund, Abteilung Informatik,-.[bib]
1976
Kurt Plasser.Ueber die Vernetzung berechnbarer Funktionen. RISC, Johannes Kepler University Linz. PhD Thesis.1976.[bib]
Peter Sutter.Implementierung einer Metasprache zur Definition von auf symbolischen Daten operierenden Interpretern und ihr Einsatz in der Programmverifikation. RISC, Johannes Kepler University Linz. PhD Thesis.1976.[bib]
B. Buchberger.Das Problem der Programmverifikation (The Problem of Program Verification). In: Jahrbuch Ueberblicke Mathematik 1976, Bibliographischs Institut, Mannheim, - (ed.), pp. 163-188.1976.Copyright: Bibliographisches Institut AG Zuerich,ISBN 3-411-01505-5.[pdf][bib]
B. Buchberger.Some Properties of Groebner Bases for Polynomial Ideals.ACM SIGSAM Bull.10(4), pp. 19-24.1976.Copyright: ACM, New York,-.[pdf][bib]
B. Buchberger.A Theoretical Basis for the Reduction of Polynomials to Canonical Forms.ACM SIGSAM Bull.10(3), pp. 19-29.1976.Copyright: ACM, New York,-.[pdf][bib]
1975
Hubert Ploner.Ein Algol 60 Interpreter. RISC, Johannes Kepler University Linz. PhD Thesis.1975.[bib]
1974
Klaus Schindler.Blum'sche Komplexitätsmasse in der verallgemeinerten Rekursionstheorie von Moschovakis. RISC, Johannes Kepler University Linz. PhD Thesis.1974.[bib]
Franz Jenewein.Eine Metasprache zur Definition von Programmiersprachen und ihre Implementierung. RISC, Johannes Kepler University Linz. PhD Thesis.1974.[bib]
B. Buchberger.Certain Decompositions of Goedel Numberings and the Semantics of Programming Languages. In: Proceedings of the International Symposium on Theoretical Programming, August 7-11, 1972, Novosibirsk, A. Ershov, V. A. Nepomniaschy (ed.), Lecture Notes in Computer Science5, pp. 152-171.1974.Copyright: Springer - Verlag Berlin - Heidelberg - New York,ISBN 3-540-067200-5.(Appeared earlier in Russian in: Teoriya Programmirovaniya, part I., Trudy Simposiuma, Novosibirsk, 7-11 August, 1972, Ak. Nauk SSSR, Sibirian Division, Computing Center, pp. 250-266).[pdf][bib]
B. Buchberger.On Certain Decompositions of Goedel Numberings.Archiv fuer Math. Logik und Grundlagenforschung16(1-2), pp. 85-96.1974.-.[pdf][bib]
1973
B. Buchberger, G.A. Yemel`yananko.Metody obratscheniya trechdiagonal'nyx matrits (Methods for the Inversion of Tridiagonal Matrices).Zhurnal vych. mat. i mat. fiziki13(3), pp. 546-554.1973.-.(English translation: USSR Computational Mathematics and Mathematical Physics, Vol. 13/3, 1973, pp. 10-20.).[pdf][bib]
1972
B. Buchberger.Bemerkung zu den Reduzierbarkeitskriterien von R.Albrecht fuer das Optimum-Mix-Problem (A Comment on the Reducibility Criteria of R. Albrecht for the Optimum-Mix-Problem).Zeitschrift fuer Operations Research16, pp. 137-143.1972.Physica-Verlag, Wuerzburg,-.[pdf][bib]
1971
B. Buchberger, G.A. Emelyanenko.Metody obrashteniya trehdiagonal'nih matrits (Methods of Inverting Tridiagonal Matrices).Communications of the Joint Institute for Nuclear Research (JINR), DubnaNo. P11-5686, pp. 1-16.1971.-.[pdf][bib]
B. Buchberger.O Velichinah S(i) Opredelennih Rekursiej S(i+1)= u(i) . S(i) + v(i) . S(i-1). (On the Values S(i) Determined by the Recursion S(i+1)= u(i) . S(i) + v(i) . S(i-1)).Communications of the Joint Institute for Nuclear Research (JINR), DubnaNo. P5-5789, pp. 1-12.1971.-.[abstract][pdf][ps][bib]
B. Buchberger.Associiruyushtshije Funksii i Operator Obyslovlennoj Iteratsii (Associating Functions and the Operator of Conditioned Iteration).Communications of the Joint Institute for Nuclear Research (JINR), DubnaNo. P5-5788, pp. 1-18.1971.no.(English Translation: Bericht Nr. 71-1, June 1971, 16 pages, Universitaet Innsbruck, Institut fuer Informatik.).[pdf][pdf][abstract][bib]
B. Buchberger.An Extension of ALGOL 60.Communications of the Joint Institute for Nuclear Research (JINR), DubnaNo. E5-5787, pp. 1-14.1971.-.[abstract][pdf][bib]
1970
R. Albrecht, B. Buchberger.Algorithm 13: Loesung eines Optimum-Mix Problemes (Solution of an Optimum-Mix-Problem).Computing5, pp. 324-331.1970.Copyright: Springer Verlag,-.[pdf][bib]
B. Buchberger.Ein algorithmisches Kriterium fuer die Loesbarkeit eines algebraischen Gleichungssystems (An Algorithmic Criterion for the Solvability of Algebraic Systems of Equations).Aequationes mathematicae3, pp. 374-383.1970.Copyright: Birkhaeuser Verlag AG, Basel, Switzerland,-.(english transl.: B. Buchberger, F. Winkler: Groebner Bases and Applications, Proc. of the International Conference "33 Years of Groebner Bases", 1998, RISC, Austria, London Math. Society Lecture Note Series 251, Cambridge Univ. Press, 1998, pp.535 -545).[pdf][bib]
1965
B. Buchberger.Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal (An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal). Mathematical Institute, University of Innsbruck, Austria. PhD Thesis.1965.English translation in J. of Symbolic Computation, Special Issue on Logic, Mathematics, and Computer Science: Interactions. Vol. 41, Number 3-4, Pages 475-511, 2006.[pdf][bib]