( en | de | ru )

 

Disambiguation of "Mande, Nikhil S."

Author of the publication

copydeleteadd this publication to your clipboard
Randomized versus Deterministic Decision Tree Size.

, , , , and . Electron. Colloquium Comput. Complex., (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Nikhil Sasidharan

Mande Hajadi

Nikhil Ratanje

Nikhil Jethava

Nikhil Karamchandani

 

Other publications of authors with the same name

The Log-Approximate-Rank Conjecture Is False., , and . J. ACM, 67 (4): 23:1-23:28 (2020)The Log-Approximate-Rank Conjecture is False., , and . Electron. Colloquium Comput. Complex., (2018)Lower bounds for quantum-inspired classical algorithms via communication complexity., and . CoRR, (2024)The log-approximate-rank conjecture is false., , and . STOC, page 42-53. ACM, (2019)Separation of Unbounded-Error Models in Multi-Party Communication Complexity., and . Theory of Computing, 14 (1): 1-23 (2018)Randomized versus Deterministic Decision Tree Size., , , , and . STOC, page 867-880. ACM, (2023)Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead., , , and . Electron. Colloquium Comput. Complex., (2019)Improved Approximate Degree Bounds for k-Distinctness., , and . TQC, volume 158 of LIPIcs, page 2:1-2:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Symmetry and Quantum Query-To-Communication Simulation., , , , , and . STACS, volume 219 of LIPIcs, page 20:1-20:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)One-Way Communication Complexity and Non-Adaptive Decision Trees., , and . STACS, volume 219 of LIPIcs, page 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)