default search action
Natalia Kalinnik
Person information
- affiliation: University of Bayreuth, Department of Computer Science, Germany
- affiliation: Albert Ludwigs University of Freiburg, Faculty of Engineering, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j4]Natalia Kalinnik, Robert Kiesel, Thomas Rauber, Marcel Richter, Gudula Rünger:
A performance- and energy-oriented extended tuning process for time-step-based scientific applications. J. Supercomput. 77(4): 3484-3515 (2021)
2010 – 2019
- 2018
- [c9]Natalia Kalinnik, Robert Kiesel, Thomas Rauber, Marcel Richter, Gudula Rünger:
On the Autotuning Potential of Time-stepping methods from Scientific Computing. FedCSIS 2018: 329-338 - [c8]Natalia Kalinnik, Thomas Rauber:
Execution Behavior Analysis of Parallel Schemes for Implicit Solution Methods for ODEs. ISPDC 2018: 1-8 - [c7]Natalia Kalinnik, Robert Kiesel, Thomas Rauber, Marcel Richter, Gudula Rünger:
Exploring Self-Adaptivity Towards Performance and Energy for Time-Stepping Methods. SBAC-PAD 2018: 115-123 - 2015
- [b1]Natalia Kalinnik:
Effizientes Lösen von Anfangswertproblemen gewöhnlicher Differentialgleichungssysteme mithilfe von Autotuning-Techniken. University of Bayreuth, 2015 - 2014
- [j3]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Online auto-tuning for the time-step-based parallel solution of ODEs on shared-memory systems. J. Parallel Distributed Comput. 74(8): 2722-2744 (2014) - 2013
- [c6]Marvin Ferber, Natalia Kalinnik, Matthias Korch, Andreas Prell, Thomas Rauber, Matthias Witzgall:
MAP: Mobile Assistance Platform with a VM Type Selection Ability. ICPADS 2013: 448-449 - 2011
- [j2]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type. J. Comput. Appl. Math. 236(3): 394-410 (2011) - [j1]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Dynamic selection of implementation variants of sequential iterated runge-kutta methods with tile size sampling (abstracts only). SIGMETRICS Perform. Evaluation Rev. 39(3): 15 (2011) - [c5]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Dynamic selection of implementation variants of sequential iterated runge-kutta methods with tile size sampling. ICPE 2011: 189-200 - 2010
- [c4]Natalia Kalinnik, Erika Ábrahám, Tobias Schubert, Ralf Wimmer, Bernd Becker:
Exploiting Different Strategies for the Parallelization of an SMT Solver. MBMV 2010: 97-106
2000 – 2009
- 2009
- [c3]Natalia Kalinnik, Tobias Schubert, Erika Ábrahám, Ralf Wimmer, Bernd Becker:
Picoso - A Parallel Interval Constraint Solver. PDPTA 2009: 473-479 - 2008
- [c2]Andreas Eggers, Natalia Kalinnik, Stefan Kupferschmid, Tino Teige:
Challenges in Constraint-Based Analysis of Hybrid Systems. CSCLP 2008: 51-65 - [c1]Bernd Becker, Marc Herbstritt, Natalia Kalinnik, Matthew Lewis, Juri Lichtner, Tobias Nopper, Ralf Wimmer:
Propositional approximations for bounded model checking of partial circuit designs. ICCD 2008: 52-59
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