( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Separation of Unbounded-Error Models in Multi-Party Communication Complexity.

, и . Theory of Computing, 14 (1): 1-23 (2018)

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.

Nikhil Sasidharan

Mande Hajadi

Nikhil Ratanje

Nikhil Jethava

Nikhil Karamchandani

 

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

Separation of Unbounded-Error Models in Multi-Party Communication Complexity., и . Theory of Computing, 14 (1): 1-23 (2018)Randomized versus Deterministic Decision Tree Size., , , , и . STOC, стр. 867-880. ACM, (2023)The log-approximate-rank conjecture is false., , и . STOC, стр. 42-53. ACM, (2019)Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead., , , и . Electron. Colloquium Comput. Complex., (2019)Symmetry and Quantum Query-To-Communication Simulation., , , , , и . STACS, том 219 из LIPIcs, стр. 20:1-20:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)One-Way Communication Complexity and Non-Adaptive Decision Trees., , и . STACS, том 219 из LIPIcs, стр. 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Improved Approximate Degree Bounds for k-Distinctness., , и . TQC, том 158 из LIPIcs, стр. 2:1-2:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Weights at the Bottom Matter When the Top is Heavy., и . CoRR, (2017)Tight Bounds for Quantum Phase Estimation and Related Problems., и . ESA, том 274 из LIPIcs, стр. 81:1-81:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximate Degree, Secret Sharing, and Concentration Phenomena., , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 71:1-71:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)