( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Parallel Priority Queue with Constant Time Operations.

, , и . J. Parallel Distributed Comput., 49 (1): 4-21 (1998)

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

 

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

Worst-Case Efficient Priority Queues.. SODA, стр. 52-58. ACM/SIAM, (1996)Optimal Planar Orthogonal Skyline Counting Queries, и . CoRR, (2013)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)On the adaptiveness of quicksort, , и . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, стр. 130--149. (2005)Optimal Resilient Dynamic Dictionaries., , , , , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 347-358. Springer, (2007)Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)., , и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 26-37. Springer, (2014)Counting in the Presence of Memory Faults., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 842-851. Springer, (2009)Fault Tolerant External Memory Algorithms., , и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 411-422. Springer, (2009)Comparator Networks for Binary Heap Construction., и . SWAT, том 1432 из Lecture Notes in Computer Science, стр. 158-168. Springer, (1998)