( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs.

, , , , , , , и . ISAAC, том 149 из LIPIcs, стр. 51:1-51:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Michael R T Macnair

T Attin

T Neumann

T Weber

T Hollemann

 

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

Minimum-Width Drawings of Phylogenetic Trees., , , и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 39-55. Springer, (2019)The Online House Numbering Problem: Min-Max Online List Labeling., , , и . ESA, том 87 из LIPIcs, стр. 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Data structures and algorithms in Java (3. ed.)., и . Wiley, (2003)Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors.. SIAM J. Comput., 20 (4): 737-755 (1991)Communication-Efficient Parallel Sorting.. SIAM J. Comput., 29 (2): 416-432 (1999)Dynamic Trees and Dynamic Point Location., и . SIAM J. Comput., 28 (2): 612-636 (1998)Sweep Methods for Parallel Computational Geometry., , и . Algorithmica, 15 (2): 126-153 (1996)Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters., и . IEEE Trans. Knowl. Data Eng., 23 (2): 297-306 (2011)Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information., , , , и . IEEE Trans. Knowl. Data Eng., 18 (10): 1352-1367 (2006)Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm.. J. ACM, 58 (6): 27:1-27:26 (2011)