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

▪▪▪ 2007 ▪ 2006 ▪ 2005 ▪ 2004 ▪ 2003 ▪▪▪

• Erhard Aichinger. A bound on the number of unary polynomial functions and a decidability result for near-rings. Int. J. Algebra Comput. 15(2):279-289 .
• Erhard Aichinger. A bound on the number of unary polynomial functions and a decidability result for near-rings. Int. J. Algebra Comput. 15(2):279-289.
• Igor Shparlinski, Arne Winterhof. A hidden number problem in small subgroups. Math. Comput. 74(252):2073-2080.
• Carsten Schneider. A new Sigma approach to multi-summation. Adv. Appl. Math. 34(4):740-767.
• Carsten Schneider. A new Sigma approach to multi-summation. Adv. Appl. Math. 34(4):740-767 .
• Stefan Gerhold, Manuel Kauers. A procedure for proving special function inequalities involving a discrete parameter. Proc. ISSAC 2005, pp. 156-162.
• Mukul R. Prasad, Armin Biere, Aarti Gupta. A survey of recent advances in SAT-based formal verification. STTT 7(2):156-173.
• Laura Ildikó Kovács, Tudor Jebelean. An Algorithm for Automated Generation of Invariants for Loops with Conditionals. Proc. SYNASC 2005, pp. 245-249.
• T. Vetterlein. BL-algebras and effect algebras. Soft Comput. 9(8):557-564 .
• T. Vetterlein. BL-algebras and effect algebras. Soft Comput. 9(8):557-564.
• Cyrille Artho, Armin Biere. Combined Static and Dynamic Analysis. Electr. Notes Theor. Comput. Sci. 131:3-14.
• Harald Niederreiter, Arne Winterhof. Cyclotomic $\cal R$-orthomorphisms of finite fields. Discrete Math. 295(1-3):161-171.
• Carsten Schneider. Degree bounds to find polynomial solutions of parameterized linear difference equations in $\Pi\Sigma$-fields. Appl. Algebra Eng. Commun. Comput. 16(1):1-32.
• Carsten Schneider. Degree bounds to find polynomial solutions of parameterized linear difference equations in \(\Pi\Sigma\)-fields. Appl. Algebra Eng. Commun. Comput. 16(1):1-32 .
• Niklas Eén, Armin Biere. Effective Preprocessing in SAT Through Variable and Clause Elimination. Proc. SAT 2005, pp. 61-75.
• Harald Niederreiter, Arne Winterhof. Exponential sums and the distribution of inversive congruential pseudorandom numbers with power of two modulus. Int. J. Number Theory 1(3):431-438.
• Carsten Schneider. Finding telescopers with minimal depth for indefinite nested sum and product expressions. Proc. ISSAC 2005, pp. 285-292.
• Tudor Jebelean, Laura Szakacs. Functional-Based Synthesis of Systolic Online Multipliers. Proc. SYNASC 2005, pp. 267-275.
• Armin Biere, Ofer Strichman. Introductory paper. STTT 7(2):87-88.
• Viktor Schuppan, Marcel Baur, Armin Biere. JVM Independent Replay in Java. Electr. Notes Theor. Comput. Sci. 113:85-104.
• Temur Kutsia, Mircea Marin. Matching with Regular Constraints. Proc. LPAR 2005, pp. 215-229.
• Igor Shparlinski, Arne Winterhof. Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5):307-317.
• Andreas Klappenecker, Martin Rötteler, Igor E. Shparlinski, Arne Winterhof. On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states. J. Math. Phys. 46(8):082104, 17 p..
• Wilfried Meidl, Arne Winterhof. On the joint linear complexity profile of explicit inversive multisequences. J. Complexity 21(3):324-336 .
• Wilfried Meidl, Arne Winterhof. On the joint linear complexity profile of explicit inversive multisequences. J. Complexity 21(3):324-336.
• Igor E. Shparlinski, Arne Winterhof. On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5):175-177.
• Alev Topuzoğlu, Arne Winterhof. On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders. Appl. Algebra Eng. Commun. Comput. 16(4):219-228.
• Wilfried Meidl. On the stability of $2^n$-periodic binary sequences. IEEE Trans. Inf. Theory 51(3):1151-1155.
• Wilfried Meidl. On the stability of \(2^n\)-periodic binary sequences. IEEE Trans. Inf. Theory 51(3):1151-1155 .
• Thomas Vetterlein. Partial algebras for Łukasiewicz logics and its extensions. Arch. Math. Logic 44(7):913-933 .
• Thomas Vetterlein. Partial algebras for Łukasiewicz logics and its extensions. Arch. Math. Logic 44(7):913-933.
• George E. Andrews, Peter Paule, Carsten Schneider. Plane partitions. VI: Stembridge’s TSPP theorem. Adv. Appl. Math. 34(4):709-739.
• George E. Andrews, Peter Paule, Carsten Schneider. Plane partitions. VI: Stembridge’s TSPP theorem. Adv. Appl. Math. 34(4):709-739 .
• Armin Biere, Ofer Strichman. Preface. Electr. Notes Theor. Comput. Sci. 119(2):1-.
• Carsten Schneider. Product representations in $\Pi\Sigma$-fields. Ann. Comb. 9(1):75-99.
• Carsten Schneider. Product representations in \(\Pi\Sigma\)-fields. Ann. Comb. 9(1):75-99 .
• Malek Haroud, Armin Biere. SDL Versus C Equivalence Checking. SDL Forum, pp. 323-338.
• Viktor Schuppan, Armin Biere. Shortest Counterexamples for Symbolic Model Checking of LTL with Past. Proc. TACAS 2005, pp. 493-509.
• Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila. Simple Is Better: Efficient Bounded Model Checking for Past LTL. Proc. VMCAI 2005, pp. 380-395.
• B. Konev, T. Jebelean. Solution lifting method for handling meta-variables in TH\(\exists\)OREM\(\forall\). J. Math. Sci., New York 126(3):1182-1194 .
• Carsten Schneider. Solving parameterized linear difference equations in terms of indefinite nested sums and products. J. Difference Equ. Appl. 11(9):799-821.
• Carsten Schneider. Solving parameterized linear difference equations in terms of indefinite nested sums and products. J. Difference Equ. Appl. 11(9):799-821 .
• Nina Brandstätter, Arne Winterhof. Some notes on the two-prime generator of order 2. IEEE Trans. Inf. Theory 51(10):3654-3657.
• Cyrille Artho, Armin Biere. Subroutine Inlining and Bytecode Abstraction to Simplify Static and Dynamic Analysis. Electr. Notes Theor. Comput. Sci. 141(1):109-128.
• Georg Regensburger, Otmar Scherzer. Symbolic computation for moments and filter coefficients of scaling functions. Ann. Comb. 9(2):223-243 .
• Georg Regensburger, Otmar Scherzer. Symbolic computation for moments and filter coefficients of scaling functions. Ann. Comb. 9(2):223-243.
• Florina Piroi, Temur Kutsia. The Theorema Environment for Interactive Proof Development. Proc. LPAR 2005, pp. 261-275.
• R. Pemantle, C. Schneider. When is 0.999... equal to 1?. ArXiv math/0511574v1.