Παρακολούθηση
Bernd Gärtner
Bernd Gärtner
Professor of Computer Science, ETH Zurich
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα inf.ethz.ch - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Understanding and using linear programming
J Matousek, B Gärtner
Springer Science & Business Media, 2006
6032006
A novel type of skeleton for polygons
O Aichholzer, F Aurenhammer, D Alberts, B Gärtner
J. UCS The Journal of Universal Computer Science, 752-761, 1996
4521996
Fast and robust smallest enclosing balls
B Gärtner
European symposium on algorithms, 325-338, 1999
2471999
Approximation algorithms and semidefinite programming
B Gärtner, J Matousek
Springer Science & Business Media, 2012
1902012
Fast smallest-enclosing-ball computation in high dimensions
K Fischer, B Gärtner, M Kutz
European Symposium on Algorithms, 630-641, 2003
1572003
The smallest enclosing ball of balls: combinatorial structure and algorithms
K Fischer, B Gärtner
International Journal of Computational Geometry & Applications 14 (04n05 …, 2004
1322004
A subexponential algorithm for abstract optimization problems
B Gärtner
SIAM Journal on Computing 24 (5), 1018-1035, 1995
1181995
Randomized simplex algorithms on Klee-Minty cubes
B Gartner, M Henk, GM Ziegler
Combinatorica 18 (3), 349-372, 1998
80*1998
Coresets for polytope distance
B Gärtner, M Jaggi
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
792009
An efficient, exact, and generic quadratic programming solver for geometric optimization
B Gärtner, S Schönherr
Proceedings of the sixteenth annual symposium on Computational geometry, 110-118, 2000
722000
Linear programming—randomization and abstract frameworks
B Gärtner, E Welzl
Annual Symposium on Theoretical Aspects of Computer Science, 667-687, 1996
701996
The Random‐Facet simplex algorithm on combinatorial cubes
B Gärtner
Random Structures & Algorithms 20 (3), 353-381, 2002
602002
Computing largest common point sets under approximate congruence
C Ambühl, S Chakraborty, B Gärtner
European Symposium on Algorithms, 52-64, 2000
592000
A simple sampling lemma: Analysis and applications in geometric optimization
B Gärtner, E Welzl
Discrete & Computational Geometry 25 (4), 569-590, 2001
552001
Optimization of convex functions with random pursuit
SU Stich, CL Muller, B Gartner
SIAM Journal on Optimization 23 (2), 1284-1309, 2013
542013
Violator spaces: Structure and algorithms
B Gärtner, J Matoušek, L Rüst, P Škovroň
Discrete Applied Mathematics 156 (11), 2124-2141, 2008
532008
Exact arithmetic at low cost–a case study in linear programming
B Gärtner
Computational Geometry 13 (2), 121-139, 1999
421999
Vapnik-Chervonenkis dimension and (pseudo-) hyperplane arrangements
B Gärtner, E Welzl
Discrete & Computational Geometry 12 (4), 399-432, 1994
381994
Majority model on random regular graphs
B Gärtner, AN Zehmakan
Latin American Symposium on Theoretical Informatics, 572-583, 2018
372018
Linear programming and unique sink orientations
B Gärtner, I Schurr
Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM …, 2006
362006
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20