default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVeronika Pillwein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Antonio Jiménez-Pastor, Philipp Nuspl, Veronika Pillwein:
An extension of holonomic sequences: C2-finite sequences. J. Symb. Comput. 116: 400-424 (2023)- [c10]Manuel Kauers
, Philipp Nuspl, Veronika Pillwein:
Order bounds for C2-finite sequences. ISSAC 2023: 389-397 - [i4]Manuel Kauers, Philipp Nuspl, Veronika Pillwein:
Order bounds for C2-finite sequences. CoRR abs/2302.04070 (2023) - 2022
- [j16]Veronika Pillwein, Diego Dominici:
Difference equation satisfied by the Stieltjes transform of a sequence. Maple Trans. 2(1) (2022) - [j15]Sven Beuchler, Tim Haubold, Veronika Pillwein:
Recurrences for Quadrilateral High-Order Finite Elements. Math. Comput. Sci. 16(4): 32 (2022) - [c9]Philipp Nuspl, Veronika Pillwein:
A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences. CASC 2022: 268-287 - [c8]Philipp Nuspl, Veronika Pillwein:
Simple C2-finite Sequences: a Computable Generalization of C-finite Sequences. ISSAC 2022: 45-53 - 2021
- [c7]Antonio Jiménez-Pastor, Philipp Nuspl, Veronika Pillwein:
On C2-finite Sequences. ISSAC 2021: 217-224 - [i3]Sven Beuchler, Tim Haubold, Veronika Pillwein:
Recursion formulas for integrated products of Jacobi polynomials. CoRR abs/2105.08989 (2021) - 2020
- [j14]Antonio Jiménez-Pastor, Veronika Pillwein, Michael F. Singer:
Some structural results on Dn-finite functions. Adv. Appl. Math. 117: 102027 (2020)
2010 – 2019
- 2019
- [j13]Veronika Pillwein:
On the positivity of the Gillis-Reznick-Zeilberger rational function. Adv. Appl. Math. 104: 75-84 (2019) - [j12]Antonio Jiménez-Pastor, Veronika Pillwein:
A computable extension for D-finite functions: DD-finite functions. J. Symb. Comput. 94: 90-104 (2019) - 2018
- [c6]Antonio Jiménez-Pastor, Veronika Pillwein:
Algorithmic Arithmetics with DD-Finite Functions. ISSAC 2018: 231-237 - 2015
- [j11]Veronika Pillwein, Miriam Schussler:
An efficient procedure deciding positivity for a class of holonomic functions. ACM Commun. Comput. Algebra 49(3): 90-93 (2015) - [c5]Veronika Pillwein:
Symbolic Computation and Finite Element Methods - (Invited Talk). CASC 2015: 376-390 - [c4]Veronika Pillwein:
An Introduction to Finite Element Methods. ISSAC 2015: 19-20 - 2014
- [j10]Veronika Pillwein, Stefan Takacs:
A local Fourier convergence analysis of a multigrid method using symbolic computation. J. Symb. Comput. 63: 1-20 (2014) - [j9]Ionela Moale, Veronika Pillwein:
A note on uniform approximation of functions having a double pole. LMS J. Comput. Math. 17(1): 233-244 (2014) - 2013
- [j8]Sven Beuchler, Veronika Pillwein, Sabine Zaglmayr:
Sparsity optimized high order finite element functions for H(curl) on tetrahedra. Adv. Appl. Math. 50(5): 749-769 (2013) - [c3]Veronika Pillwein:
Termination conditions for positivity proving procedures. ISSAC 2013: 315-322 - [p1]Sven Beuchler, Veronika Pillwein, Sabine Zaglmayr:
Fast Summation Techniques for Sparse Shape Functions in Tetrahedral hp-FEM. Domain Decomposition Methods in Science and Engineering XX 2013: 511-518 - 2012
- [j7]Yongjae Cha, Veronika Pillwein:
Closed form solutions of linear difference equations in terms of symmetric products. ACM Commun. Comput. Algebra 46(3/4): 80-81 (2012) - [j6]Sven Beuchler, Veronika Pillwein, Sabine Zaglmayr:
Sparsity optimized high order finite element functions for H(div) on simplices. Numerische Mathematik 122(2): 197-225 (2012) - 2011
- [j5]Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz:
Dominance in the family of Sugeno-Weber t-norms. Fuzzy Sets Syst. 181(1): 74-87 (2011) - [j4]Christos Koukouvinos, Veronika Pillwein, Dimitris E. Simos, Zafeirakis Zafeirakopoulos:
On the average complexity for the verification of compatible sequences. Inf. Process. Lett. 111(17): 825-830 (2011) - 2010
- [c2]Manuel Kauers, Veronika Pillwein:
When can we detect that a P-finite sequence is positive? ISSAC 2010: 195-201 - [c1]Peter Paule, Veronika Pillwein:
Automatic Improvements of Wallis' Inequality. SYNASC 2010: 12-16 - [i2]Manuel Kauers, Veronika Pillwein:
When can we decide that a P-finite sequence is positive? CoRR abs/1005.0600 (2010) - [i1]Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz:
Dominance in the family of Sugeno-Weber t-norms. CoRR abs/1007.5442 (2010)
2000 – 2009
- 2008
- [j3]Veronika Pillwein:
Positivity of certain sums over Jacobi kernel polynomials. Adv. Appl. Math. 41(3): 365-377 (2008) - 2007
- [j2]Sven Beuchler, Veronika Pillwein:
Sparse shape functions for tetrahedral p -FEM using integrated Jacobi polynomials. Computing 80(4): 345-375 (2007) - 2006
- [j1]A. Becirovic, Peter Paule, Veronika Pillwein, Axel Riese, Carsten Schneider, Joachim Schöberl:
Hypergeometric Summation Algorithms for High-order Finite Elements. Computing 78(3): 235-249 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
