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

▪▪▪ 2011 ▪ 2010 ▪ 2009 ▪ 2008 ▪ 2007 ▪▪▪

• Nina Brandstätter, Arne Winterhof. $k$-error linear complexity over $\Bbb F_p$ of subsequences of Sidelnikov sequences of period $(p^{r} - 1)/3$. J. Math. Cryptol. 3(3):215-225.
• Madalina Erascu, Tudor Jebelean. A Calculus for Imperative Programs: Formalization and Implementation. Proc. SYNASC 2009, pp. 77-84.
• Florian Lonsing, Armin Biere. A Compact Representation for Syntactic Dependencies in QBFs. Proc. SAT 2009, pp. 398-411.
• Manuel Kauers, Christoph Koutschan. A Mathematica package for $q$-holonomic sequences and power series. Ramanujan J. 19(2):137-150.
• Frédéric Chyzak, Manuel Kauers, Bruno Salvy. A non-holonomic systems approach to special function identities. Proc. ISSAC 2009, pp. 111-118.
• Georg Regensburger, Markus Rosenkranz, Johannes Middeke. A skew polynomial approach to integro-differential operators. Proc. ISSAC 2009, pp. 287-294.
• Uwe Egly, Martina Seidl, Stefan Woltran. A solver for QBFs in negation normal form. Constraints 14(1):38-79.
• Kerstin Altmanninger, Martina Seidl, Manuel Wimmer. A survey on model versioning approaches. IJWIS 5(3):271-304.
• Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger. A Symbolic Framework for Operations on Linear Boundary Problems. Proc. CASC 2009, pp. 269-283.
• Carsten Schneider. A Symbolic Summation Approach to Find Optimal Nested Sum Representations. ArXiv 0904.2323v1.
• Christoph Koutschan. Advanced applications of the holonomic systems approach. (Abstract of thesis). ACM Commun. Comput. Algebra 43(3-4):119.
• Christoph Koutschan. Advanced applications of the holonomic systems approach. (Abstract of thesis). ACM Commun. Comput. Algebra 43(4):119 .
• Georg Regensburger, Markus Rosenkranz. An algebraic foundation for factoring linear boundary problems. Ann. Mat. Pura Appl. (4) 188(1):123-151 .
• Georg Regensburger, Markus Rosenkranz. An algebraic foundation for factoring linear boundary problems. Ann. Mat. Pura Appl. (4) 188(1):123-151.
• Sanka Balasuriya, Igor E. Shparlinski, Arne Winterhof. An average bound for character sums with some counter-dependent recurrence sequences. Rocky Mt. J. Math. 39(5):1403-1409 .
• Sanka Balasuriya, Igor E. Shparlinski, Arne Winterhof. An average bound for character sums with some counter-dependent recurrence sequences. Rocky Mt. J. Math. 39(5):1403-1409.
• Petra Brosch, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer, Gerti Kappel, Werner Retschitzegger, Wieland Schwinger. An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example. MoDELS, pp. 271-285.
• Robert Brummayer, Armin Biere. Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. Proc. TACAS 2009, pp. 174-177.
• Armin Biere. Bounded Model Checking. Handbook of Satisfiability, pp. 457-481.
• Petra Brosch, Martina Seidl, Konrad Wieland, Manuel Wimmer, Philip Langer. By-example adaptation of the generic model versioning system AMOR: how to include language-specific features for improving the check-in process. OOPSLA Companion, pp. 739-740.
• Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran. ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. Proc. LPNMR 2009, pp. 382-395.
• Erkko Lehtonen. Characterization of preclones by matrix collections. ArXiv 0910.5607v1.
• Erkko Lehtonen, Ágnes Szendrei. Clones with finitely many relative R-classes. ArXiv 0905.1611v3.
• Jorge Coelho, Mário Florido, Temur Kutsia. Collaborative Schema Construction using Regular Sequence Types. Proc. IRI 2009, pp. 290-295.
• Robert Vajda, Tudor Jebelean, Bruno Buchberger. Combining logical and algebraic techniques for natural style proving in elementary analysis. Math. Comput. Simul. 79(8):2310-2316 .
• Robert Vajda, Tudor Jebelean, Bruno Buchberger. Combining logical and algebraic techniques for natural style proving in elementary analysis. Math. Comput. Simul. 79(8):2310-2316.
• J. Blümlein, M. Kauers, S. Klein, C. Schneider. Determining the closed forms of the $O(a_s^3)$ anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra. ArXiv 0902.4091v1.
• Johannes Blümlein, Manuel Kauers, Sebastian Klein, Carsten Schneider. Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra. Comput. Phys. Commun. 180(11):2143-2165.
• Robert Brummayer, Armin Biere. Effective Bit-Width and Under-Approximation. Proc. EUROCAST 2009, pp. 304-311.
• Florian Lonsing, Armin Biere. Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. Electr. Notes Theor. Comput. Sci. 251:83-95.
• Christoph Koutschan. Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem. ArXiv 0906.1018v1.
• J. Blümlein, M. Kauers, S. Klein, C. Schneider. From Moments to Functions in Quantum Chromodynamics. ArXiv 0902.4095v1.
• Miguel Couceiro, Erkko Lehtonen. Galois connection for sets of operations closed under permutation, cylindrification and composition. ArXiv 0910.5409v3.
• Robert Osburn, Carsten Schneider. Gaussian hypergeometric series and supercongruences. Math. Comput. 78(265):275-292.
• Robert Osburn, Carsten Schneider. Gaussian hypergeometric series and supercongruences. Math. Comput. 78(265):275-292 .
• Wilfried Meidl. How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring sequences. Cryptogr. Commun. 1(1):117-133.
• Wilfried Meidl. How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences. Cryptogr. Commun. 1(1):117-133 .
• Wilfried Meidl, Ferruh Özbudak. Linear complexity over $\Bbb F_q$ and over $\Bbb F_{q^m}$ for linear recurring sequences. Finite Fields Appl. 15(1):110-124.
• Wilfried Meidl, Ferruh Özbudak. Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences. Finite Fields Appl. 15(1):110-124 .
• Zhixiong Chen, Arne Winterhof. Linear complexity profile of $m$-ary pseudorandom sequences with small correlation measure. Indag. Math., New Ser. 20(4):631-640.
• Zhixiong Chen, Arne Winterhof. Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure. Indag. Math., New Ser. 20(4):631-640 .
• Mircea Marin, Temur Kutsia. Linear Systems for Regular Hedge Languages. ADBIS (Workshops), pp. 104-112.
• András Sárközy, Arne Winterhof. Measures of pseudorandomness for binary sequences constructed using finite fields. Discrete Math. 309(6):1327-1333 .
• András Sárközy, Arne Winterhof. Measures of pseudorandomness for binary sequences constructed using finite fields. Discrete Math. 309(6):1327-1333.
• Niklas Sörensson, Armin Biere. Minimizing Learned Clauses. Proc. SAT 2009, pp. 237-243.
• Manuel Wimmer, Martina Seidl, Petra Brosch, Horst Kargl, Gerti Kappel. On Realizing a Framework for Self-tuning Mappings. TOOLS (47), pp. 1-16.
• Esen Aksoy, Ayça Çeşmelioğlu, Wilfried Meidl, Alev Topuzoğlu. On the Carlitz rank of permutation polynomials. Finite Fields Appl. 15(4):428-440.
• Esen Aksoy, Ayça Çeşmelioğlu, Wilfried Meidl, Alev Topuzoğlu. On the Carlitz rank of permutation polynomials. Finite Fields Appl. 15(4):428-440 .
• Leonard Kwuida, Erkko Lehtonen. On the homomorphism order of labeled posets. ArXiv 0911.0200v1.
• Manuel Kauers, Christoph Koutschan, Doron Zeilberger. Proof of Ira Gessel’s lattice path conjecture. Proc. Natl. Acad. Sci. USA 106(28):11502-11505.
• Wilfried Meidl. Remarks on a cyclotomic sequence. Des. Codes Cryptography 51(1):33-43 .
• Armin Biere. SAT, SMT and Applications. Proc. LPNMR 2009, pp. 1.
• Miguel Couceiro, Erkko Lehtonen. Self-commuting lattice polynomial functions. ArXiv 0912.0478v1.
• Besik Dundua, Temur Kutsia, Mircea Marin. Strategies in PRholog. Proc. WRS 2009, pp. 32-43.
• Miguel Couceiro, Erkko Lehtonen. The arity gap of polynomial functions over bounded distributive lattices. ArXiv 0910.5131v1.
• Alin Bostan, Manuel Kauers. The complete Generating Function for Gessel Walks is Algebraic. ArXiv 0909.1965v1.
• Petra Brosch, Martina Seidl, Konrad Wieland, Manuel Wimmer, Philip Langer. The operation recorder: specifying model refactorings by-example. OOPSLA Companion, pp. 791-792.
• Erkko Lehtonen, Agnes Szendrei. The submaximal clones on the three-element set with finitely many relative R-classes. ArXiv 0905.1614v1.
• Erhard Aichinger, Nebojša Mudrinski. Types of polynomial completeness of expanded groups. Algebra Univers. 60(3):309-343 .
• Erhard Aichinger, Nebojša Mudrinski. Types of polynomial completeness of expanded groups. Algebra Univers. 60(3):309-343.
• Nikolaj Popov, Tudor Jebelean. Using computer algebra techniques for the specification, verification and synthesis of recursive programs. Math. Comput. Simul. 79(8):2302-2309 .
• Nikolaj Popov, Tudor Jebelean. Using computer algebra techniques for the specification, verification and synthesis of recursive programs. Math. Comput. Simul. 79(8):2302-2309.
• Nina Brandstätter, Arne Winterhof. \(k\)-error linear complexity over \(\mathbb F_p\) of subsequences of Sidelnikov sequences of period \((p^{r} - 1)/3\). J. Math. Cryptol. 3(3):215-225 .