( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How to Compress Asymmetric Communication.

, и . CCC, том 33 из LIPIcs, стр. 102-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Ramamoorthy Acharya

Kasyap Natarajan

Paruthiure Natarajan

Natarajan Thiagarajan

Arupon Natarajan

 

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

How to Compress Asymmetric Communication., и . CCC, том 33 из LIPIcs, стр. 102-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)How to Solve Fair k-Center in Massive Data Models., , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 1877-1886. PMLR, (2020)Equivalence of Systematic Linear Data Structures and Matrix Rigidity., и . ITCS, том 151 из LIPIcs, стр. 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Equivalence of Systematic Linear Data Structures and Matrix Rigidity., и . Electron. Colloquium Comput. Complex., (2019)Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers., и . Electron. Colloquium Comput. Complex., (2017)On the communication complexity of greater-than., и . Allerton, стр. 442-444. IEEE, (2015)Edge Estimation with Independent Set Oracles., , , , и . ITCS, том 94 из LIPIcs, стр. 38:1-38:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Edge Estimation with Independent Set Oracles., , , , и . ACM Trans. Algorithms, 16 (4): 52:1-52:27 (2020)Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics.. University of Washington, USA, (2020)New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity., и . Electron. Colloquium Comput. Complex., (2016)