default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens Jägersküpper
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c16]Axel Probst, Tobias Knopp, Cornelia Grabe, Jens Jägersküpper:
HPC Requirements of High-Fidelity Flow Simulations for Aerodynamic Applications. Euro-Par Workshops 2019: 375-387- 2012
- [c15]Thomas Alrutz, Jan Backhaus, Thomas Brandes, Vanessa End, Thomas Gerhold, Alfred Geiger, Daniel Grünewald, Vincent Heuveline, Jens Jägersküpper, Andreas Knüpfer, Olaf Krzikalla, Edmund Kügeler, Carsten Lojewski, Guy Lonsdale, Ralph Müller-Pfefferkorn
, Wolfgang E. Nagel, Lena Oden, Franz-Josef Pfreundt, Mirko Rahn, Michael Sattler, Mareike Schmidtobreick, Annika Schiller, Christian Simmendinger, Thomas Soddemann, Godehard Sutmann, Henning Weber, Jan-Philipp Weiss:
GASPI - A Partitioned Global Address Space Programming Interface. Facing the Multicore-Challenge 2012: 135-136 - 2011
- [j4]Jens Jägersküpper:
Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded. Algorithmica 59(3): 409-424 (2011) - [c14]Jens Jägersküpper, Christian Simmendinger:
A Novel Shared-Memory Thread-Pool Implementation for Hybrid Parallel CFD Solvers. Euro-Par (2) 2011: 182-193 - 2010
- [c13]Achim Basermann, Hans-Peter Kersken, Andreas Schreiber, Thomas Gerhold, Jens Jägersküpper, Norbert Kroll, Jan Backhaus, Edmund Kügeler, Thomas Alrutz, Christian Simmendinger, Kim Feldhoff, Olaf Krzikalla, Ralph Müller-Pfefferkorn, Mathias Puetz, Petra Aumann, Olaf Knobloch, Jörg Hunger, Carsten Zscherp:
HICFD: Highly Efficient Implementation of CFD Codes for HPC Many-Core Architectures. CHPC 2010: 1-13
2000 – 2009
- 2008
- [j3]Jens Jägersküpper:
Lower bounds for randomized direct search with isotropic sampling. Oper. Res. Lett. 36(3): 327-332 (2008) - [c12]Jens Jägersküpper:
Oblivious Randomized Direct Search for Real-Parameter Optimization. ESA 2008: 553-564 - [c11]Jens Jägersküpper, Mike Preuss:
Aiming for a theoretically tractable CSA variant by means of empirical investigations. GECCO 2008: 503-510 - [c10]Jens Jägersküpper:
A Blend of Markov-Chain and Drift Analysis. PPSN 2008: 41-51 - [c9]Jens Jägersküpper, Mike Preuss:
Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory. WEA 2008: 263-274 - 2007
- [b1]Jens Jägersküpper:
Probabilistic analysis of evolution strategies using isotropic mutations. Dortmund University, Germany, 2007 - [j2]Jens Jägersküpper:
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci. 379(3): 329-347 (2007) - [c8]Jens Jägersküpper, Tobias Storch:
When the Plus Strategy Outperforms the Comma Strategyand When Not. FOCI 2007: 25-32 - [c7]Jens Jägersküpper:
Lower Bounds for Hit-and-Run Direct Search. SAGA 2007: 118-129 - 2006
- [j1]Jens Jägersküpper:
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. Theor. Comput. Sci. 361(1): 38-56 (2006) - [c6]Jens Jägersküpper:
Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations. GECCO 2006: 461-468 - [c5]Jens Jägersküpper, Tobias Storch:
How Comma Selection Helps with the Escape from Local Optima. PPSN 2006: 52-61 - 2005
- [c4]Jens Jägersküpper:
On the complexity of overcoming gaps with isotropic mutations and elitist selection. Congress on Evolutionary Computation 2005: 206-213 - [c3]Jens Jägersküpper:
Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes. FOGA 2005: 260-281 - [c2]Jens Jägersküpper, Carsten Witt:
Rigorous runtime analysis of a (µ+1)ES for the sphere function. GECCO 2005: 849-856 - 2003
- [c1]Jens Jägersküpper:
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces. ICALP 2003: 1068-1079
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-10-07 21:23 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:
