RISC-Linz RISC-Linz Research Institute for Symbolic Computation  
description  |  subgroups  |  members  |  seminar  |  publications  |  software  |  events  |  links

Algorithmic Combinatorics Publications

Type: [any] [Papers] [Theses] [Technical Reports] [Other
Author: [any] [Ablinger] [Paule] [Kauers] [Koutschan] [Pillwein] [Radu] [Schneider
Year: [any] [2017] [2016] [2015] [2014] [2013] [2012] [earlier

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]
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]
Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz. Dominance in the Family of Sugeno-Weber t-norms. Fuzzy Sets and Systems 181(1), pp. 74-87. October 2011. ISSN 0165-0114. [ps] [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]
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]
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. [pdf] [ps] [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]
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]
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 Engineering 60, 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]
S. Beuchler, V. Pillwein. Sparse shape functions for tetrahedral $p$-FEM using integrated Jacobi polynomials. Computing 80(4), pp. 345-375. 2007. [ps] [pdf] [bib]
A. Becirovic, P. Paule, V. Pillwein, A. Riese, C. Schneider, J. Schoeberl. Hypergeometric Summation Algorithms for High Order Finite Elements. Computing 78(3), pp. 235-249. 2006. ISSN 0010-485X. Preliminary version available. [pdf] [ps] [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: 10.1002/pamm.200610325. [bib]