


default search action
Klaus Gärtner
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j8]Cosmin G. Petra, Olaf Schenk
, Miles Lubin, Klaus Gärtner:
An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization. SIAM J. Sci. Comput. 36(2) (2014) - 2011
- [r1]Olaf Schenk, Klaus Gärtner:
PARDISO. Encyclopedia of Parallel Computing 2011: 1458-1464
2000 – 2009
- 2009
- [j7]Annegret Glitzky, Klaus Gärtner:
Existence of Bounded Steady State Solutions to Spin-Polarized Drift-Diffusion Systems. SIAM J. Math. Anal. 41(6): 2489-2513 (2009) - 2006
- [j6]Robert Eymard, Jürgen Fuhrmann
, Klaus Gärtner:
A finite volume scheme for nonlinear parabolic equations derived from one-dimensional local dirichlet problems. Numerische Mathematik 102(3): 463-495 (2006) - 2005
- [c7]Hang Si, Klaus Gärtner:
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations. IMR 2005: 147-163 - 2004
- [j5]Olaf Schenk
, Klaus Gärtner:
Solving unsymmetric sparse systems of linear equations with PARDISO. Future Gener. Comput. Syst. 20(3): 475-487 (2004) - 2002
- [j4]Olaf Schenk
, Klaus Gärtner:
Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems . Parallel Comput. 28(2): 187-197 (2002) - [c6]Klaus Gärtner, Christoph Giese, Frank Sonntag, Uwe Marx:
Verfahren zur qualitativen Bewertung der Syntheseleistung von Vitalzellkulturen. Bildverarbeitung für die Medizin 2002: 7-10 - [c5]Olaf Schenk, Klaus Gärtner:
Solving Unsymmetric Sparse Systems of Linear Equations with PARDISO. International Conference on Computational Science (2) 2002: 355-363 - 2001
- [j3]Olaf Schenk
, Klaus Gärtner, Wolfgang Fichtner, Andreas Stricker:
PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation. Future Gener. Comput. Syst. 18(1): 69-78 (2001) - [c4]Herbert Gajewski, Klaus Gärtner:
A constructive, analytic approach to balanced, minimal separators on grids and undirected graphs. PP 2001 - [c3]Olaf Schenk, Klaus Gärtner:
Sparse Factorization with Two Level Scheduling in PARDISO. PP 2001
1990 – 1999
- 1999
- [c2]Olaf Schenk, Klaus Gärtner, Wolfgang Fichtner:
Scalable Parallel Sparse Factorization with Left-Right Looking Strategy on Shared Memory Multoprocessors. HPCN Europe 1999: 221-230 - [c1]Olaf Schenk
, Klaus Gärtner, Wolfgang Fichtner:
Application of Parallel Sparse Direct Methods in Semiconductor Device and Process Simulation. ISHPC 1999: 206-219 - 1998
- [j2]P. Douglas Yoder, Ulrich Krumbein, Klaus Gärtner, Nobuo Sasaki, Wolfgang Fichtner:
Statistical Enhancement of Terminal Current Estimation for Monte Carlo Device Simulation. VLSI Design 6(1-4): 303-306 (1998) - 1997
- [j1]P. Douglas Yoder, Klaus Gärtner, Ulrich Krumbein, Wolfgang Fichtner:
Optimized terminal current calculation for Monte Carlo device simulation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10): 1082-1087 (1997)
1980 – 1989
- 1984
- [b1]Klaus Gärtner:
Problemlösung für die Regelung der maschinellen Beatmung auf Intensivstationen unter Nutzung der rechnergestützten Entscheidungsfindung. Dresden University of Technology, Germany, 1984
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 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint