The following pages link to Bernd Gärtner (Q223957):
Displayed 50 items.
- Item:Q223957 (redirect page) (← links)
- On two continuum armed bandit problems in high dimensions (Q260274) (← links)
- Variable metric random pursuit (Q263217) (← links)
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- Understanding and using linear programming (Q852298) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Randomized simplex algorithms on Klee-Minty cubes (Q1307309) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- Exact arithmetic at low cost. -- A case study in linear programming (Q1807651) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- Threshold behavior of democratic opinion dynamics (Q1986099) (← links)
- Random sampling with removal (Q2207595) (← links)
- Majority rule cellular automata (Q2232605) (← links)
- Majority model on random regular graphs (Q2294715) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- Counting unique-sink orientations (Q2434730) (← links)
- Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines (Q2572593) (← links)
- (Q2753922) (← links)
- (Q2754153) (← links)
- Optimization of Convex Functions with Random Pursuit (Q2848195) (← links)
- Optimal lower bounds for projective list update algorithms (Q2933662) (← links)
- (Q2955007) (← links)
- AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS (Q2968091) (← links)
- Sampling with removal in LP-type problems (Q2970437) (← links)
- Approximation Algorithms and Semidefinite Programming (Q3094772) (← links)
- (Q3132874) (← links)
- (Q3143860) (← links)
- Continuum Armed Bandit Problem of Few Variables in High Dimensions (Q3188870) (← links)
- Linear programming and unique sink orientations (Q3581590) (← links)
- Unique Sink Orientations of Grids (Q3596343) (← links)
- (Q4230371) (← links)
- (Q4247198) (← links)
- (Q4250176) (← links)
- One line and n points (Q4446873) (← links)
- (Q4499280) (← links)
- The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)
- (Q4542175) (← links)
- Linear programming — Randomization and abstract frameworks (Q4593969) (← links)
- ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP (Q4604381) (← links)
- Sampling with Removal in LP-type Problems (Q4635577) (← links)
- (Q4636463) (← links)
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
- A Subexponential Algorithm for Abstract Optimization Problems (Q4857592) (← links)
- (Q4942263) (← links)
- (Q5002737) (← links)
- (Q5088968) (← links)