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

▪▪▪ 2004 ▪ 2003 ▪ 2002 ▪ 2001 ▪ 2000 ▪▪▪

• Erhard Aichinger. 2-affine complete algebras need not be affine complete. Algebra Univers. 47(4):425-434 .
• Erhard Aichinger. 2-affine complete algebras need not be affine complete. Algebra Univers. 47(4):425-434.
• Wilfried Meidl, Arne Winterhof. A polynomial representation of the Diffie-Hellman mapping. Appl. Algebra Eng. Commun. Comput. 13(4):313-318.
• Wilfried Meidl, Arne Winterhof. A polynomial representation of the Diffie-Hellman mapping. Appl. Algebra Eng. Commun. Comput. 13(4):313-318 .
• Anatolij Dvurečenskij, Thomas Vetterlein. Algebras in the positive cone of po-groups. Order 19(2):127-146 .
• Anatolij Dvurečenskij, Thomas Vetterlein. Algebras in the positive cone of po-groups. Order 19(2):127-146.
• Wilfried Meidl, Harald Niederreiter. Counting functions and expected values for the $k$-error linear complexity. Finite Fields Appl. 8(2):142-154.
• Wilfried Meidl, Harald Niederreiter. Counting functions and expected values for the \(k\)-error linear complexity. Finite Fields Appl. 8(2):142-154 .
• Wilfried Meidl, Harald Niederreiter. Linear complexity, $k$-error linear complexity, and the discrete Fourier transform. J. Complexity 18(1):87-103.
• Wilfried Meidl, Harald Niederreiter. Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform. J. Complexity 18(1):87-103 .
• Armin Biere, Cyrille Artho, Viktor Schuppan. Liveness Checking as Safety Checking. Electr. Notes Theor. Comput. Sci. 66(2):160-177.
• Wilfried Meindl, Harald Niederreiter. On the expected value of the linear complexity and the $k$-error linear complexity of periodic sequences. IEEE Trans. Inf. Theory 48(11):2817-2825.
• Wilfried Meindl, Harald Niederreiter. On the expected value of the linear complexity and the \(k\)-error linear complexity of periodic sequences. IEEE Trans. Inf. Theory 48(11):2817-2825 .
• Temur Kutsia. Pattern Unification with Sequence Variables, Flexible Arity Symbols. Electr. Notes Theor. Comput. Sci. 66(5):52-69.
• W. Meindl. Roll flattening under consideration of the contact shear stresses. (Walzenabplattung unter Berücksichtigung der Kontaktschubspannungen.) PAMM, Proc. Appl. Math. Mech. 1, 159-160 .
• Armin Biere, Wolfgang Kunz. SAT and ATPG: Boolean engines for formal hardware verification. Proc. ICCAD 2002, pp. 782-785.
• 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 (2005); translation from Zap. Nauch. Semin. POMI 293, 94-117.
• Temur Kutsia. Theorem Proving with Sequence Variables and Flexible Arity Symbols. Proc. LPAR 2002, pp. 278-291.
• Temur Kutsia. Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms. Proc. AISC 2002, pp. 290-304.
• Sergey Berezin, Edmund Clarke, Armin Biere, Yunshan Zhu. Verification of out-of-order processor designs using model Checking and a light-weight completion function. Form. Methods Syst. Des. 20(2):159-186 .
• Sergey Berezin, Edmund Clarke, Armin Biere, Yunshan Zhu. Verification of out-of-order processor designs using model Checking and a light-weight completion function. Form. Methods Syst. Des. 20(2):159-186.
• Viktor Schuppan, Armin Biere. Verifying the IEEE 1394 fireWire tree identify protocol with SMV. Formal Asp. Comput. 14(3):267-280 .
• Viktor Schuppan, Armin Biere. Verifying the IEEE 1394 fireWire tree identify protocol with SMV. Formal Asp. Comput. 14(3):267-280.
• W. Meindl. Walzenabplattung unter Berücksichtigung der Kontaktschubspannungen. PAMM, Proc. Appl. Math. Mech. 1(1):159-160, electronic only.