( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model.

, , и . STOC, стр. 1805-1815. ACM, (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.

Hildegard Parekh

Niranjan Parekh

René-Ojas Woltering

 

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

Probing a Set of Trajectories to Maximize Captured Information, , , , , , и . CoRR, (2020)Finding effective support-tree preconditioners., , , , и . SPAA, стр. 176-185. ACM, (2005)Approximation Algorithms for Edge-Dilation k-Center Problems., , , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 210-219. Springer, (2002)Provable Neuromorphic Advantages for Computing Shortest Paths., , , , , , и . SPAA, стр. 497-499. ACM, (2020)Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication., , , и . SPAA, стр. 67-76. ACM, (2018)Spiking Neural Algorithms for Markov Process Random Walk., , , и . IJCNN, стр. 1-8. IEEE, (2018)Provable Advantages for Graph Algorithms in Spiking Neural Networks., , , , , , и . SPAA, стр. 35-47. ACM, (2021)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., и . Algorithmica, 62 (1-2): 633-634 (2012)Neuromorphic scaling advantages for energy-efficient random walk computation., , , , , , , и . CoRR, (2021)Geometric Hitting Set for Segments of Few Orientations, , , , и . Theory Comput. Syst., 62 (2): 268--303 (2018)