HPC Requirements of High-Fidelity Flow Simulations for Aerodynamic Applications. - Probst, Axel; Knopp, Tobias; Grabe, Cornelia; Jägersküpper, Jens (2019)

GASPI - A Partitioned Global Address Space Programming Interface. - Alrutz, Thomas; Backhaus, Jan; Brandes, Thomas; End, Vanessa; Gerhold, Thomas; Geiger, Alfred; Grünewald, Daniel; Heuveline, Vincent; Jägersküpper, Jens; Knüpfer, Andreas; Krzikalla, Olaf; Kügeler, Edmund; et al. (2012)

Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded. - Jägersküpper, Jens (Algorithmica, 2011)

A Novel Shared-Memory Thread-Pool Implementation for Hybrid Parallel CFD Solvers. - Jägersküpper, Jens; Simmendinger, Christian (2011)

HICFD: Highly Efficient Implementation of CFD Codes for HPC Many-Core Architectures. - Basermann, Achim; Kersken, Hans-Peter; Schreiber, Andreas; Gerhold, Thomas; Jägersküpper, Jens; Kroll, Norbert; Backhaus, Jan; Kügeler, Edmund; Alrutz, Thomas; Simmendinger, Christian; Feldhoff, Kim; Krzikalla, Olaf; et al. (2010)

Lower bounds for randomized direct search with isotropic sampling. - Jägersküpper, Jens (Oper. Res. Lett., 2008)

Oblivious Randomized Direct Search for Real-Parameter Optimization. - Jägersküpper, Jens (2008)

Aiming for a theoretically tractable CSA variant by means of empirical investigations. - Jägersküpper, Jens; Preuss, Mike (2008)

A Blend of Markov-Chain and Drift Analysis. - Jägersküpper, Jens (2008)

Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory. - Jägersküpper, Jens; Preuss, Mike (2008)

Probabilistic analysis of evolution strategies using isotropic mutations - Jägersküpper, Jens (2007)

Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. - Jägersküpper, Jens (Theor. Comput. Sci., 2007)

When the Plus Strategy Outperforms the Comma Strategyand When Not. - Jägersküpper, Jens; Storch, Tobias (2007)

Lower Bounds for Hit-and-Run Direct Search. - Jägersküpper, Jens (2007)

How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. - Jägersküpper, Jens (Theor. Comput. Sci., 2006)

Probabilistic runtime analysis of (1 +<over>, lambda), ES using isotropic mutations. - Jägersküpper, Jens (2006)

How Comma Selection Helps with the Escape from Local Optima. - Jägersküpper, Jens; Storch, Tobias (2006)

On the complexity of overcoming gaps with isotropic mutations and elitist selection. - Jägersküpper, Jens (2005)

Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes. - Jägersküpper, Jens (2005)

Rigorous runtime analysis of a (µ+1)ES for the sphere function. - Jägersküpper, Jens; Witt, Carsten (2005)

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces. - Jägersküpper, Jens (2003)