( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Priority Queues with Decreasing Keys.

. FUN, том 226 из LIPIcs, стр. 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Miriam Stölting

Stephanie Stölting

Nathalie Stölting

Jürgen Stölting

Cécile Stölting

 

Другие публикации лиц с тем же именем

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