( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree.

, , , и . SODA, стр. 3960-3996. SIAM, (2024)

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.

Rajesh Saiju

Hybrid Power System Modelling - Simulation and Energy Management Unit Development. Uni Kassel, (2008)

Vittalapura Jayaram

Jayaram Dadda

Rajesh Chitta

Rajesh Saiju

 

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

An Optimal Algorithm for Triangle Counting., и . CoRR, (2021)Fully Dynamic Consistent k-Center Clustering., , , , и . SODA, стр. 3463-3484. SIAM, (2024)Optimal Sketching for Kronecker Product Regression and Low Rank Approximation., , , , и . NeurIPS, стр. 4739-4750. (2019)HyperAttention: Long-context Attention in Near-Linear Time., , , , , и . CoRR, (2023)Towards Optimal Moment Estimation in Streaming and Distributed Models., и . APPROX-RANDOM, том 145 из LIPIcs, стр. 29:1-29:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Optimal Algorithm for Triangle Counting in the Stream., и . APPROX-RANDOM, том 207 из LIPIcs, стр. 11:1-11:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search., , , и . CoRR, (2024)Testing Positive Semi-Definiteness via Random Submatrices., , и . FOCS, стр. 1191-1202. IEEE, (2020)A Framework for Adversarially Robust Streaming Algorithms., , , и . PODS, стр. 63-80. ACM, (2020)When is approximate counting for conjunctive queries tractable?, , , и . STOC, стр. 1015-1027. ACM, (2021)