Gerth Stølting Brodal 个人学术档案

引用次数

	总计	2019 年至今
引用	4783	1080
h 指数	41	17
i10 指数	85	33

280

140

210

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202418 22 35 37 28 66 87 93 136 161 178 182 182 236 198 221 245 253 241 268 214 233 279 235 199 187 192 167 100

开放获取的出版物数量

查看全部

14 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Christian Nørgaard Storm PedersenBioinformatics Research Centre (BiRC) and Department of Computer Science, Aarhus University在 birc.au.dk 的电子邮件经过验证
Riko JacobITU Copenhagen在 itu.dk 的电子邮件经过验证
Lars ArgeProfessor of Computer Science and MADALGO center director, Aarhus University在 cs.au.dk 的电子邮件经过验证
Thomas MailundAssociate Professor of Bioinformatics, Aarhus University在 birc.au.dk 的电子邮件经过验证
Srinivasa Rao SattiProfessor, NTNU在 ntnu.no 的电子邮件经过验证
Gabi MoruzJ.W. Goethe University Frankfurt am Main在 cs.uni-frankfurt.de 的电子邮件经过验证
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )在 di.ku.dk 的电子邮件经过验证
Kostas TsichlasDept. of Computer Engineering & Informatics, University of Patras在 ceid.upatras.gr 的电子邮件经过验证
Pooya DavoodiApple, Machine Learning Engineer在 apple.com 的电子邮件经过验证
Andreas SandPhD student at Bioinformatics Research Centre and Department of Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
John IaconoUniversité Libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
Christos ZaroliagisProfessor of Algorithm Design, Analysis and Engineering, University of Patras在 ceid.upatras.gr 的电子邮件经过验证
Spyros SioutasProfessor at University of Patras在 ceid.upatras.gr 的电子邮件经过验证
Morten Kragelund HoltConsultant, Delegate A/S在 delegate.dk 的电子邮件经过验证
Konstantinos Tsakalidis Κωνσταντίνος...Department of Computer Science, University of Liverpool在 liverpool.ac.uk 的电子邮件经过验证
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of Ioannina在 cs.uoi.gr 的电子邮件经过验证
Michael A. BenderStony Brook University在 cs.stonybrook.edu 的电子邮件经过验证
Laura TomaBowdoin College在 bowdoin.edu 的电子邮件经过验证
Rune LyngsoeInactive在 lyngsoe.eu 的电子邮件经过验证
Thomas MølhaveCTO, SCALGO.在 moelhave.com 的电子邮件经过验证

关注

Gerth Stølting Brodal

Aarhus University

在 cs.au.dk 的电子邮件经过验证 - 首页

Algorithms Data Structures


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Dynamic planar convex hull GS Brodal, R Jacob The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	266	2002
Worst-case efficient external-memory priority queues GS Brodal, J Katajainen 6th Scandinavian Workshop on Algorithm Theory, 107-118, 1998	215	1998
New Data Structures for Orthogonal Range Searching S Alstrup, GS Brodal, T Rauhe 41st Annual Symposium on Foundations of Computer Science, 198-207, 2000	214	2000
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	210	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	169	2003
Lower Bounds for External Memory Dictionaries. GS Brodal, R Fagerberg. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 546-554, 2003	156	2003
Cache oblivious distribution sweeping GS Brodal, R Fagerberg International Colloquium on Automata, Languages, and Programming, 426-438, 2002	108	2002
Dynamic Representations of Sparse Graphs GS Brodal, R Fagerberg 6th International Workshop on Algorithms and Data Structure, 342-351, 1999	103	1999
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
Finding Maximal Pairs with Bounded Gap GS Brodal, RB Lyngsø, CNS Pedersen, J Stoye Journal of Discrete Algorithms 1 (1), 77-104, 2000	95	2000
Finding maximal pairs with bounded gap G Brodal, R Lyngsø, C Pedersen, J Stoye Combinatorial Pattern Matching, 134-149, 1999	95	1999
Engineering a cache-oblivious sorting algorithm GS Brodal, R Fagerberg, K Vinther ACM Journal of Experimental Algorithmics 12 (2.2), 2008	94	2008
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	94	2007
Engineering a Cache-Oblivious Sorting Algorithm GS Brodal, R Fagerberg, K Vinther 6th Workshop on Algorithm Engineering and Experiments, 4-17, 2004	94*	2004
On the limits of cache-obliviousness GS Brodal, R Fagerberg Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	91	2003
Funnel Heap - A Cache Oblivious Priority Queue GS Brodal, R Fagerberg. 13th Annual International Symposium on Algorithms and Computation, 209-228, 2002	87	2002
Pattern matching in dynamic texts S Alstrup, GS Brodal, T Rauhe Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000	86	2000
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
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	81	2014
Strict fibonacci heaps GS Brodal, G Lagogiannis, RE Tarjan Proceedings of the 44th symposium on Theory of Computing, 1177-1184, 2012	79	2012

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用