( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast Stable In-Place Sorting with O (n) Data Moves.

, и . Algorithmica, 16 (2): 151-160 (1996)

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.

Venkatesh Kolluru

Venkatesh Ramakrishnan

Sreenath Ramanath

Aravamudhan Raman

Natraj Raman

 

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

Faster Algorithms for Finding and Counting Subgraphs, , , , и . CoRR, (2009)Succinct ordinal trees with level-ancestor queries., , и . ACM Trans. Algorithms, 2 (4): 510-534 (2006)Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime., , и . CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2017)Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs., , , и . MFCS, том 58 из LIPIcs, стр. 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Subexponential Algorithms for Partial Cover Problems., , , и . FSTTCS, том 4 из LIPIcs, стр. 193-201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Sorting and Selection with Equality Comparisons., , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 434-445. Springer, (2015)Stable in Situ Sorting and Minimum Data Movement., , и . BIT, 30 (2): 220-234 (1990)Harmonious coloring: Parameterized algorithms and upper bounds., , , , и . Theor. Comput. Sci., (2019)Less space: Indexing for queries with wildcards., , , и . Theor. Comput. Sci., (2014)Structural parameterizations of Tracking Paths problem., и . Theor. Comput. Sci., (2022)