Tobias Friedrich

Citée par

	Toutes	Depuis 2019
Citations	11262	5668
indice h	51	37
indice i10	288	180

1200

600

300

900

200620072008200920102011201220132014201520162017201820192020202120222023202437 57 103 183 260 288 357 493 571 653 730 784 867 956 993 1105 1093 1147 352

Accès public

Tout afficher

121 articles

19 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Frank NeumannOptimisation and Logistics, School of ComputerAdresse e-mail validée de adelaide.edu.au
Karl BringmannProfessor in Computer Science, Saarland UniversityAdresse e-mail validée de cs.uni-saarland.de
Martin S. KrejcaLIX, CNRS, Ecole Polytechnique, IPPAdresse e-mail validée de polytechnique.edu
Benjamin DoerrProfessor at Ecole Polytechnique, FranceAdresse e-mail validée de lix.polytechnique.fr
Thomas BläsiusKarlsruhe Institute of TechnologyAdresse e-mail validée de kit.edu
Andrew M. SuttonUniversity of Minnesota DuluthAdresse e-mail validée de umn.edu
Thomas SauerwaldUniversity Lecturer in Computer Science, University of CambridgeAdresse e-mail validée de cl.cam.ac.uk
Martin SchirneckTheory and Applications of Algorithms, University of Vienna, AustriaAdresse e-mail validée de univie.ac.at
Anton KrohmerGoogle Germany GmbH, Munich, GermanyAdresse e-mail validée de google.com
Dirk SudholtUniversity of Passau, GermanyAdresse e-mail validée de uni-passau.de
Markus WagnerAssociate Professor of Computer Science, Monash University, AustraliaAdresse e-mail validée de monash.edu
Andreas GöbelHasso Plattner Institute, University of PotsdamAdresse e-mail validée de hpi.de
Maximilian KatzmannAssistant Researcher, Karlsruhe Institute of Technology (KIT)Adresse e-mail validée de kit.edu
Pascal LenznerResearcher, HPI PotsdamAdresse e-mail validée de hpi.de
Pietro S. OlivetoProfessor of Computer Science, Chair in Algorithms, The University of SheffieldAdresse e-mail validée de sheffield.ac.uk
Ralf RothenbergerHasso Plattner Institute PotsdamAdresse e-mail validée de hpi.de
Per Kristian LehreProfessor at University of Birmingham and UKRI Turing AI Acceleration FellowAdresse e-mail validée de cs.bham.ac.uk
Duc-Cuong DangUniversity of Southampton, UKAdresse e-mail validée de soton.ac.uk
Sarel CohenThe Academic College of Tel Aviv-YaffoAdresse e-mail validée de mta.ac.il
Francesco QuinzanUniversity of OxfordAdresse e-mail validée de cs.ox.ac.uk

Suivre

Tobias Friedrich

Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, Germany

Adresse e-mail validée de hpi.de

Algorithm Engineering Randomness Artificial Intelligence Data Science Network Science


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Why rumors spread so quickly in social networks B Doer, M Fouz, T Friedrich Communications of the ACM 55 (6), 70-75, 2012	480	2012
Approximating the volume of unions and intersections of high-dimensional geometric objects K Bringmann, T Friedrich Computational Geometry 43 (6-7), 601-610, 2010	202	2010
Approximating covering problems by randomized search heuristics using multi-objective models T Friedrich, N Hebbinghaus, F Neumann, J He, C Witt Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007	175	2007
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice K Bringmann, T Friedrich Theoretical Computer Science 425, 104-116, 2012	172	2012
Social networks spread rumors in sublogarithmic time B Doerr, M Fouz, T Friedrich Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	172	2011
Nonlinear climate sensitivity and its implications for future greenhouse warming T Friedrich, A Timmermann, M Tigchelaar, O Elison Timm, A Ganopolski Science Advances 2 (11), e1501923, 2016	167	2016
Approximation quality of the hypervolume indicator K Bringmann, T Friedrich Artificial Intelligence 195, 265-290, 2013	147*	2013
Analyzing hypervolume indicator based algorithms D Brockhoff, T Friedrich, F Neumann International Conference on Parallel Problem Solving from Nature, 651-660, 2008	135	2008
Escaping local optima using crossover with emergent diversity DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ... IEEE Transactions on Evolutionary Computation 22 (3), 484-497, 2017	130	2017
Do additional objectives make a problem harder? D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007	130	2007
Quasirandom rumor spreading B Doerr, T Friedrich, T Sauerwald ACM Transactions on Algorithms (TALG) 11 (2), 1-35, 2014	119*	2014
Analysis of diversity-preserving mechanisms for global exploration T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009	119	2009
An efficient algorithm for computing hypervolume contributions K Bringmann, T Friedrich Evolutionary Computation 18 (3), 383-402, 2010	106	2010
On the effects of adding objectives to plateau functions D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler IEEE Transactions on Evolutionary Computation 13 (3), 591-603, 2009	104	2009
The compact genetic algorithm is efficient under extreme gaussian noise T Friedrich, T Kötzing, MS Krejca, AM Sutton IEEE Transactions on Evolutionary Computation 21 (3), 477-490, 2016	103	2016
Predicting the energy output of wind farms based on weather data: Important variables and their correlation E Vladislavleva, T Friedrich, F Neumann, M Wagner Renewable Energy 50, 236-243, 2013	102	2013
Approximation-guided evolutionary multi-objective optimization K Bringmann, T Friedrich, F Neumann, M Wagner IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011	102	2011
Efficient embedding of scale-free graphs in the hyperbolic plane T Bläsius, T Friedrich, A Krohmer, S Laue IEEE/ACM transactions on Networking 26 (2), 920-933, 2018	81	2018
Deterministic random walks on the two-dimensional grid B Doerr, T Friedrich Combinatorics, Probability and Computing 18 (1-2), 123-144, 2009	80	2009
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness B Doerr, T Friedrich, T Sauerwald Automata, Languages and Programming, 366-377, 2009	80*	2009

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs