default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünter Mayer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Martine Ceberio, Vladik Kreinovich, Olga Kosheleva, Günter Mayer:
Complex-Valued Interval Computations are NP-Hard Even for Single Use Expressions. NAFIPS 2023: 246-257
2010 – 2019
- 2012
- [j23]Günter Mayer:
On an Expression for the Midpoint and the Radius of the Product of Two Intervals. Reliab. Comput. 16: 210-224 (2012) - [j22]Günter Mayer:
An Oettli-Prager-Like Theorem for the Symmetric Solution Set and for Related Solution Sets. SIAM J. Matrix Anal. Appl. 33(3): 979-999 (2012)
2000 – 2009
- 2008
- [j21]Götz Alefeld, Günter Mayer:
New Criteria for the Feasibility of the Cholesky Method with Interval Data. SIAM J. Matrix Anal. Appl. 30(4): 1392-1405 (2008) - 2006
- [j20]Günter Mayer:
A Contribution to the Feasibility of the Interval Gaussian Algorithm. Reliab. Comput. 12(2): 79-98 (2006) - 2005
- [j19]Hans-Robert Arndt, Günter Mayer:
On the Solutions of the Interval System [x] = [A][x] + [b]. Reliab. Comput. 11(2): 87-103 (2005) - [j18]Götz Alefeld, Günter Mayer:
Enclosing Solutions of Singular Interval Systems Iteratively. Reliab. Comput. 11(3): 165-190 (2005) - [j17]Hans-Robert Arndt, Günter Mayer:
New Criteria for the Semiconvergence of Interval Matrices. SIAM J. Matrix Anal. Appl. 27(3): 689-711 (2005) - [c2]Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen:
Computing the cube of an interval matrix is NP-Hard. SAC 2005: 1449-1453 - 2003
- [c1]Götz Alefeld, Günter Mayer:
On Singular Interval Systems. Numerical Software with Result Verification 2003: 191-197 - 2001
- [j16]Götz Alefeld, Vladik Kreinovich, Günter Mayer, Michael Huth:
A Comment on the Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients. Reliab. Comput. 7(3): 275-277 (2001) - [p3]Günter Mayer, Ingo Warnke:
On the Limit of the Total Step Method in Interval Analysis. Perspectives on Enclosure Methods 2001: 157-171 - [p2]Götz Alefeld, Vladik Kreinovich, Günter Mayer:
Modifications of the Oettli-Prager Theorem with Application to the Eigenvalue Problem. Symbolic Algebraic Methods and Verification Methods 2001: 11-20 - [p1]Günter Mayer, Ingo Warnke:
On the Shape of the Fixed Points of [f]([c])=[A][x]+[b]. Symbolic Algebraic Methods and Verification Methods 2001: 153-162
1990 – 1999
- 1998
- [j15]Günter Mayer, Jiri Rohn:
On the Applicability of the Interval Gaussian Algorithm. Reliab. Comput. 4(3): 205-222 (1998) - 1997
- [j14]Vladik Kreinovich, Scott A. Starks, Günter Mayer:
On a Theoretical Justification of the Choice of Epsilon-Inflation in PASCAL-XSC. Reliab. Comput. 3(4): 437-445 (1997) - [j13]Götz Alefeld, Vladik Kreinovich, Günter Mayer:
On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set. SIAM J. Matrix Anal. Appl. 18(3): 693-705 (1997) - 1996
- [j12]Vladik Kreinovich, Günter Mayer:
Best student paper award. Reliab. Comput. 2(1): 81 (1996) - [j11]Günter Mayer, Vladik Kreinovich:
Preface. Reliab. Comput. 2(3): i (1996) - 1995
- [j10]Vladik Kreinovich, Günter Mayer:
Towards the future of interval computations - Editors' Introduction to the student issue. Reliab. Comput. 1(3): 209-214 (1995) - [j9]Götz Alefeld, Günter Mayer:
On the Symmetric and Unsymmetric Solution Set of Interval Systems. SIAM J. Matrix Anal. Appl. 16(4): 1223-1240 (1995) - 1994
- [j8]Götz Alefeld, A. Gienger, Günter Mayer:
Numerical validation for an inverse matrix eigenvalue problem. Computing 53(3-4): 311-322 (1994) - 1993
- [j7]Andreas Frommer, Günter Mayer:
A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm. SIAM J. Matrix Anal. Appl. 14(2): 408-419 (1993) - 1992
- [j6]Günter Mayer:
Some remarks on two interval-arithmetic modifications of the newton method. Computing 48(1): 125-128 (1992) - [j5]Andreas Frommer, Günter Mayer:
On the theory and practice of multisplitting methods in parallel computation. Computing 49(1): 63-74 (1992) - 1990
- [j4]Andreas Frommer, Günter Mayer:
Efficient methods for enclosing solutions of systems of nonlinear equations. Computing 44(3): 221-235 (1990) - [j3]Uwe Block, Andreas Frommer, Günter Mayer:
Block colouring schemes for the SOR method on local memory parallel computers. Parallel Comput. 14(1): 61-75 (1990)
1980 – 1989
- 1989
- [j2]Andreas Frommer, Günter Mayer:
Safe bounds for the solutions of nonlinear problems using a parallel multisplitting method. Computing 42(2-3): 171-186 (1989) - 1985
- [j1]Günter Mayer:
Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositions. Computing 35(2): 189-206 (1985)
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-25 05:53 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:
