( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.

, , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 91-102. Springer, (2015)

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

 

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

On the adaptiveness of quicksort, , и . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, стр. 130--149. (2005)Cache oblivious search trees via binary trees of small height., , и . SODA, стр. 39-48. ACM/SIAM, (2002)Cache-oblivious string dictionaries., и . SODA, стр. 581-590. ACM Press, (2006)Worst-Case Efficient Priority Queues.. SODA, стр. 52-58. ACM/SIAM, (1996)Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)., , и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 26-37. Springer, (2014)Optimal Resilient Dynamic Dictionaries., , , , , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 347-358. Springer, (2007)Counting in the Presence of Memory Faults., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 842-851. Springer, (2009)Comparator Networks for Binary Heap Construction., и . SWAT, том 1432 из Lecture Notes in Computer Science, стр. 158-168. Springer, (1998)On the adaptiveness of Quicksort., , и . ACM Journal of Experimental Algorithmics, (2008)Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees., и . ESA, том 87 из LIPIcs, стр. 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)