Members of the Forum Algebra produce more than a hundred publications every year. The list below is automatically generated and may not be complete.

▪▪▪ 2009 ▪ 2008 ▪ 2007 ▪ 2006 ▪ 2005 ▪▪▪

• Manuel Kauers, Peter Paule. A computer proof of Moll’s log-concavity conjecture. Proc. Am. Math. Soc. 135(12):3847-3856.
• Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger. A First Step Towards a Unified Proof Checker for QBF. Proc. SAT 2007, pp. 201-214.
• Manuel Kauers. An algorithm for deciding zero equivalence of nested polynomially recurrent sequences. ACM Trans. Algorithms 3(2):Article No. 18, 14 p..
• Robert Brummayer, Armin Biere. C32SAT: Checking C Expressions. Proc. CAV 2007, pp. 294-297.
• Toni Jussila, Armin Biere. Compressing BMC Encodings with QBF. Electr. Notes Theor. Comput. Sci. 174(3):45-56.
• I. Bierenbaum, J. Blümlein, S. Klein, C. Schneider. Difference Equations in Massive Higher Order Calculations. ArXiv 0707.4659v1.
• Cyrille Artho, Boris Zweimüller, Armin Biere, Etsuya Shibayama, Shinichi Honiden. Efficient Model Checking of Applications with Input/Output. Proc. EUROCAST 2007, pp. 515-522.
• Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu. Error linear complexity measures for multisequences. J. Complexity 23(2):169-192.
• Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu. Error linear complexity measures for multisequences. J. Complexity 23(2):169-192 .
• Manuel Kauers, Doron Zeilberger. Experiments with a Positivity Preserving Operator. ArXiv 0708.3286v1.
• S. Moch, C. Schneider. Feynman integrals and difference equations. ArXiv 0709.1769v1.
• Meng Zhou, Franz Winkler. On computing Gröbner bases in rings of differential operators with coefficients in a ring. Math. Comput. Sci. 1(2):211-223 .
• Hassan Aly, Wilfried Meidl, Arne Winterhof. On the $k$-error linear complexity of cyclotomic sequences. J. Math. Cryptol. 1(3):283-296.
• Hassan Aly, Wilfried Meidl. On the linear complexity and $k$-error linear complexity over $\Bbb F_p$ of the $d$-ary Sidel’nikov sequence. IEEE Trans. Inf. Theory 53(12):4755-4761.
• Hassan Aly, Wilfried Meidl. On the linear complexity and \(k\)-error linear complexity over \(\mathbb F_p\) of the \(d\)-ary Sidel’nikov sequence. IEEE Trans. Inf. Theory 53(12):4755-4761 .
• Wilfried Meidl, Arne Winterhof. On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions. Finite Fields Appl. 13(3):628-634 .
• Wilfried Meidl, Arne Winterhof. On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions. Finite Fields Appl. 13(3):628-634.
• Hassan Aly, Wilfried Meidl, Arne Winterhof. On the \(k\)-error linear complexity of cyclotomic sequences. J. Math. Cryptol. 1(3):283-296 .
• Horst Alzer, Stefan Gerhold, Manuel Kauers, Alexandru Lupaş. On Turán’s inequality for Legendre polynomials. Expo. Math. 25(2):181-186.
• Tim Boykett. Orderly algorithm to enumerate central groupoids and their graphs. Acta Math. Sin., Engl. Ser. 23(2):249-264 .
• Tim Boykett. Orderly algorithm to enumerate central groupoids and their graphs. Acta Math. Sin., Engl. Ser. 23(2):249-264.
• Georg Regensburger. Parametrizing compactly supported orthonormal wavelets by discrete moments. Appl. Algebra Eng. Commun. Comput. 18(6):583-601 .
• Georg Regensburger. Parametrizing compactly supported orthonormal wavelets by discrete moments. Appl. Algebra Eng. Commun. Comput. 18(6):583-601.
• E. Aichinger, P. Mayr. Polynomial clones on groups of order $pq$. Acta Math. Hung. 114(3):267-285.
• E. Aichinger, P. Mayr. Polynomial clones on groups of order \(pq\). Acta Math. Hung. 114(3):267-285 .
• Ofer Strichman, Armin Biere. Preface. Electr. Notes Theor. Comput. Sci. 174(3):1-2.
• Gerhard Wendt. Primitive near-rings – some structure theorems. Algebra Colloq. 14(3):417-424 .
• Gerhard Wendt. Primitive near-rings -- some structure theorems. Algebra Colloq. 14(3):417-424.
• Igor E. Shparlinski, Arne Winterhof. Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6):211-215 .
• Igor E. Shparlinski, Arne Winterhof. Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6):211-215.
• Wilfried Meidl. Reducing the calculation of the linear complexity of $u_2^v$-periodic binary sequences to Games-Chan algorithm. Des. Codes Cryptography 46(1):57-65.
• Wilfried Meidl, Ayineedi Venkateswarlu. Remarks on the $k$-error linear complexity of $p^n$-periodic sequences. Des. Codes Cryptography 42(2):181-193.
• Wilfried Meidl, Ayineedi Venkateswarlu. Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences. Des. Codes Cryptography 42(2):181-193 .
• Jorge Coelho, Mário Florido, Temur Kutsia. Sequence Disunification and Its Application in Collaborative Schema Construction. WISE Workshops, pp. 91-102.
• Temur Kutsia, Jordi Levy, Mateu Villaret. Sequence Unification Through Currying. Proc. RTA 2007, pp. 288-302.
• Carsten Schneider. Simplifying sums in $\Pi \Sigma^{*}$-extensions. J. Algebra Appl. 6(3):415-441.
• Carsten Schneider. Simplifying sums in \(\Pi \Sigma^{*}\)-extensions. J. Algebra Appl. 6(3):415-441 .
• Temur Kutsia. Solving equations with sequence variables and sequence functions. J. Symb. Comput. 42(3):352-388.
• Manuel Kauers. Summation algorithms for Stirling number identities. J. Symb. Comput. 42(10):948-970.
• Manuel Kauers, Carsten Schneider. Symbolic summation with radical expressions. Proc. ISSAC 2007, pp. 219-226.
• Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran. Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. Proc. INAP/WLP 2007, pp. 241-246.
• Robin Pemantle, Carsten Schneider. When is \(0.999\dots\) equal to 1. Am. Math. Mon. 114(4):344-350 .