Gerth Stølting Brodal

Sitert av

	Alle	Siden 2020
Sitater	4908	949
h-indeks	41	16
i10-indeks	87	28

280

140

210

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202518 22 34 35 24 61 86 96 138 163 174 182 187 236 200 228 247 260 238 270 217 239 279 238 192 188 190 171 171 37

Offentlig tilgang

Vis alle

15 artikler

1 artikkel

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Christian Nørgaard Storm PedersenBioinformatics Research Centre (BiRC) and Department of Computer Science, Aarhus UniversityVerifisert e-postadresse på birc.au.dk
Riko JacobITU CopenhagenVerifisert e-postadresse på itu.dk
Lars ArgeProfessor of Computer Science and MADALGO center director, Aarhus UniversityVerifisert e-postadresse på cs.au.dk
Thomas MailundAssociate Professor of Bioinformatics, Aarhus UniversityVerifisert e-postadresse på birc.au.dk
Srinivasa Rao SattiProfessor, NTNUVerifisert e-postadresse på ntnu.no
Gabi MoruzJ.W. Goethe University Frankfurt am MainVerifisert e-postadresse på cs.uni-frankfurt.de
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )Verifisert e-postadresse på di.ku.dk
Kostas TsichlasDept. of Computer Engineering & Informatics, University of PatrasVerifisert e-postadresse på ceid.upatras.gr
Pooya DavoodiApple, Machine Learning EngineerVerifisert e-postadresse på apple.com
Andreas SandPhD student at Bioinformatics Research Centre and Department of Computer Science, Aarhus UniversityVerifisert e-postadresse på cs.au.dk
Christos ZaroliagisProfessor of Algorithm Design, Analysis and Engineering, University of PatrasVerifisert e-postadresse på ceid.upatras.gr
John IaconoUniversité Libre de BruxellesVerifisert e-postadresse på ulb.ac.be
Spyros SioutasProfessor at University of PatrasVerifisert e-postadresse på ceid.upatras.gr
G. LagogiannisAgricultural University of AthensVerifisert e-postadresse på aua.gr
Morten Kragelund HoltConsultant, Delegate A/SVerifisert e-postadresse på delegate.dk
Konstantinos Tsakalidis Κωνσταντίνος...Department of Computer Science, University of LiverpoolVerifisert e-postadresse på liverpool.ac.uk
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaVerifisert e-postadresse på cs.uoi.gr
Michael A. BenderStony Brook UniversityVerifisert e-postadresse på cs.stonybrook.edu
Rune LyngsoeInactiveVerifisert e-postadresse på lyngsoe.eu
Thomas MølhaveCTO, SCALGO.Verifisert e-postadresse på moelhave.com

Følg

Gerth Stølting Brodal

Aarhus University

Verifisert e-postadresse på cs.au.dk - Startside

Algorithms Data Structures


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
Dynamic planar convex hull GS Brodal, R Jacob The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	272	2002
New Data Structures for Orthogonal Range Searching S Alstrup, GS Brodal, T Rauhe 41st Annual Symposium on Foundations of Computer Science, 198-207, 2000	218	2000
Worst-case efficient external-memory priority queues GS Brodal, J Katajainen 6th Scandinavian Workshop on Algorithm Theory, 107-118, 1998	216	1998
Cache oblivious search trees via binary trees of small height GS Brodal, R Fagerberg, R Jacob Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002	209	2002
Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries GS Brodal, R Jacob Algorithmic Methods and Models for Optimization of Railways, 2003	172	2003
Lower Bounds for External Memory Dictionaries. GS Brodal, R Fagerberg. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 546-554, 2003	167	2003
Cache oblivious distribution sweeping GS Brodal, R Fagerberg International Colloquium on Automata, Languages, and Programming, 426-438, 2002	111	2002
Dynamic Representations of Sparse Graphs GS Brodal, R Fagerberg 6th International Workshop on Algorithms and Data Structure, 342-351, 1999	106	1999
Finding Maximal Pairs with Bounded Gap GS Brodal, RB Lyngsø, CNS Pedersen, J Stoye Journal of Discrete Algorithms 1 (1), 77-104, 2000	100	2000
Finding maximal pairs with bounded gap G Brodal, R Lyngsø, C Pedersen, J Stoye Combinatorial Pattern Matching, 134-149, 1999	100	1999
Optimal sparse matrix dense vector multiplication in the I/O-model MA Bender, GS Brodal, R Fagerberg, R Jacob, E Vicari Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007	99	2007
A Parallel Priority Queue with Constant Time Operations GS Brodal, JL Träff, CD Zaroliagis Journal of Parallel and Distributed Computing 49 (1), 4-21, 1998	99	1998
Engineering a cache-oblivious sorting algorithm GS Brodal, R Fagerberg, K Vinther ACM Journal of Experimental Algorithmics 12 (2.2), 2008	96	2008
Engineering a Cache-Oblivious Sorting Algorithm GS Brodal, R Fagerberg, K Vinther 6th Workshop on Algorithm Engineering and Experiments, 4-17, 2004	96*	2004
On the limits of cache-obliviousness GS Brodal, R Fagerberg Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	93	2003
Pattern matching in dynamic texts S Alstrup, GS Brodal, T Rauhe Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000	90	2000
tqDist: a library for computing the quartet and triplet distances between binary or general trees A Sand, MK Holt, J Johansen, GS Brodal, T Mailund, CNS Pedersen Bioinformatics 30 (14), 2079-2080, 2014	89	2014
Funnel Heap - A Cache Oblivious Priority Queue GS Brodal, R Fagerberg. 13th Annual International Symposium on Algorithms and Computation, 209-228, 2002	87	2002
Computing the Quartet Distance between Evolutionary Trees in Time O (n log 2 n) GS Brodal, R Fagerberg, C Pedersen Proc. 12th Annual International Symposium on Algorithms and Computation …, 2001	84	2001
Recrafting the neighbor-joining method T Mailund, G Brodal, R Fagerberg, C Pedersen, D Phillips BMC bioinformatics 7 (1), 29, 2006	83	2006

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere