( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
A Simple Greedy Algorithm for Dynamic Graph Orientation.

, and . ISAAC, volume 92 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Miriam Stölting

Stephanie Stölting

Nathalie Stölting

Jürgen Stölting

Cécile Stölting

 

Other publications of authors with the same name

Finger Search Trees with Constant Insertion Time.. SODA, page 540-549. ACM/SIAM, (1998)Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property, and . CoRR, (2011)Funnel Heap - A Cache Oblivious Priority Queue., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 219-228. Springer, (2002)Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time., , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 193-202. Springer, (2009)Approximate Dictionary Queries., and . CPM, volume 1075 of Lecture Notes in Computer Science, page 65-74. Springer, (1996)Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms., and . WADS, volume 3608 of Lecture Notes in Computer Science, page 385-395. Springer, (2005)Solving the String Statistics Problem in Time O(n log n)., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 728-739. Springer, (2002)Dynamic Planar Range Maxima Queries., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 256-267. Springer, (2011)OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 164-175. Springer, (2011)A Linear Time Algorithm for the k Maximal Sums Problem., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 442-453. Springer, (2007)