The following pages link to Bernd Gärtner (Q223957):
Displayed 21 items.
- One line and <i>ε</i> (Q5175983) (← links)
- The Domination Heuristic for LP-type Problems (Q5233567) (← links)
- Algorithms for learning sparse additive models with interactions in high dimensions* (Q5242847) (← links)
- Random sampling in geometric optimization (Q5361519) (← links)
- An efficient, exact, and generic quadratic programming solver for geometric optimization (Q5361521) (← links)
- Pitfalls in computing with pseudorandom determinants (Q5361525) (← links)
- The smallest enclosing ball of balls (Q5361635) (← links)
- Combinatorial Redundancy Detection (Q5368696) (← links)
- Coresets for polytope distance (Q5370697) (← links)
- Violator Spaces: Structure and Algorithms (Q5449544) (← links)
- Two New Bounds for the Random‐Edge Simplex‐Algorithm (Q5454270) (← links)
- Fundamentals of Computation Theory (Q5492929) (← links)
- Color War: Cellular Automata with Majority-Rule (Q5739013) (← links)
- Algorithms - ESA 2003 (Q5897282) (← links)
- A simple sampling lemma: Analysis and applications in geometric optimization (Q5939470) (← links)
- Enumerating triangulation paths (Q5952967) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
- Pseudo Unique Sink Orientations (Q6286012) (← links)
- The Crossing Tverberg Theorem (Q6311066) (← links)
- A Characterization of the Realizable Matou\v{s}ek Unique Sink Orientations (Q6377132) (← links)
- A Note on the Faces of the Dual Koch Arrangement (Q6427838) (← links)