( en | de | ru )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
Stochastic Neuromorphic Circuits for Solving MAXCUT.

, , , , , and . IPDPS, page 779-787. IEEE, (2023)

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.

Hildegard Parekh

Niranjan Parekh

René-Ojas Woltering

 

Other publications of authors with the same name

Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 50 (2): 244-254 (2008)Improved Approximations for Tour and Tree Covers., , , and . Algorithmica, 38 (3): 441-449 (2004)Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model., , and . CoRR, (2023)Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality., , , , and . CoRR, (2021)A 2110-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem., , , and . J. Comb. Optim., 5 (3): 317-326 (2001)A Unified Approach to Approximating Partial Covering Problems., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 468-479. Springer, (2006)The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut., and . FOCS, page 498-506. IEEE, (2022)A Unified Approach to Approximating Partial Covering Problems., , and . Algorithmica, 59 (4): 489-509 (2011)Approximation Algorithms for k-hurdle Problems., , , and . Algorithmica, 59 (1): 81-93 (2011)Spiking network algorithms for scientific computing., , , , and . ICRC, page 1-8. IEEE Computer Society, (2016)