Gerth Stølting Brodal
Gerth Stølting Brodal
Dirección de correo verificada de - Página principal
Citado por
Citado por
Dynamic planar convex hull
GS Brodal, R Jacob
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 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
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
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
Worst-case efficient priority queues
GS Brodal
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms …, 1996
Lower Bounds for External Memory Dictionaries.
GS Brodal, R Fagerberg.
14th Annual ACM-SIAM Symposium on Discrete Algorithms, 546-554, 2003
On External-Memory MST, SSSP and Multi-way Planar Graph Separation
L Arge, GS Brodal, L Toma
Journal of Algorithm 53 (2), 186-206, 2004
Cache oblivious distribution sweeping
GS Brodal, R Fagerberg
International Colloquium on Automata, Languages, and Programming, 426-438, 2002
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
Engineering a cache-oblivious sorting algorithm
GS Brodal, R Fagerberg, K Vinther
ACM Journal of Experimental Algorithmics 12 (2.2), 2008
Engineering a Cache-Oblivious Sorting Algorithm
GS Brodal, R Fagerberg, K Vinther
6th Workshop on Algorithm Engineering and Experiments, 4-17, 2004
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
MA Bender, GS Brodal, R Fagerberg, R Jacob, E Vicari
Theory of Computing Systems 47 (4), 934-962, 2010
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
Finding Maximal Pairs with Bounded Gap
GS Brodal, RB Lyngsø, CNS Pedersen, J Stoye
Journal of Discrete Algorithms 1 (1), 77-104, 2000
Finding maximal pairs with bounded gap
G Brodal, R Lyngsø, C Pedersen, J Stoye
Combinatorial Pattern Matching, 134-149, 1999
On the limits of cache-obliviousness
GS Brodal, R Fagerberg
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
Funnel Heap - A Cache Oblivious Priority Queue
GS Brodal, R Fagerberg.
13th Annual International Symposium on Algorithms and Computation, 209-228, 2002
Worst-case efficient external-memory priority queues
GS Brodal, J Katajainen
6th Scandinavian Workshop on Algorithm Theory, 107-118, 1998
Dynamic Representations of Sparse Graphs
GS Brodal, R Fagerberg
6th International Workshop on Algorithms and Data Structure, 342-351, 1999
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
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20