BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Portugal
1 × Spain
1 × Switzerland
2 × Greece
2 × USA
Collaborated with:
R.Fagerberg G.Lagogiannis K.Tsakalidis A.Östlin C.N.S.Pedersen R.E.Tarjan G.Moruz S.Alstrup T.Rauhe R.B.Lyngsø C.Makris A.K.Tsakalidis K.Tsichlas
Talks about:
cach (4) oblivi (3) optim (2) tree (2) rang (2) evolutionari (1) fibonacci (1) distribut (1) construct (1) statist (1)

Person: Gerth Stølting Brodal

DBLP DBLP: Brodal:Gerth_St=oslash=lting

Contributed to:

STOC 20122012
ICALP (1) 20112011
ICALP 20052005
STOC 20032003
ICALP 20022002
STOC 20022002
ICALP 20012001
STOC 20012001

Wrote 9 papers:

STOC-2012-BrodalLT #fibonacci #strict
Strict fibonacci heaps (GSB, GL, RET), pp. 1177–1184.
ICALP-v1-2011-BrodalT #query
Dynamic Planar Range Maxima Queries (GSB, KT), pp. 256–267.
ICALP-2005-BrodalFM #adaptation #sorting
Cache-Aware and Cache-Oblivious Adaptive Sorting (GSB, RF, GM), pp. 576–588.
STOC-2003-BrodalF #on the
On the limits of cache-obliviousness (GSB, RF), pp. 307–315.
Cache Oblivious Distribution Sweeping (GSB, RF), pp. 426–438.
ICALP-2002-BrodalLOP #problem #statistics #string
Solving the String Statistics Problem in Time O(n log n) (GSB, RBL, , CNSP), pp. 728–739.
STOC-2002-BrodalLMTT #pointer
Optimal finger search trees in the pointer machine (GSB, GL, CM, AKT, KT), pp. 583–591.
ICALP-2001-BrodalFPO #complexity #using
The Complexity of Constructing Evolutionary Trees Using Experiments (GSB, RF, CNSP, ), pp. 140–151.
Optimal static range reporting in one dimension (SA, GSB, TR), pp. 476–482.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.