( en | de | ru )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
Generalized Hypergraph Matching via Iterated Packing and Local Ratio.

, and . CoRR, (2016)

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

Geometric Hitting Set for Segments of Few Orientations, , , , and . Theory Comput. Syst., 62 (2): 268--303 (2018)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 62 (1-2): 633-634 (2012)Neuromorphic scaling advantages for energy-efficient random walk computation., , , , , , , and . CoRR, (2021)Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . WADS, volume 3608 of Lecture Notes in Computer Science, page 233-243. Springer, (2005)Path Hitting in Acyclic Graphs., and . ESA, volume 4168 of Lecture Notes in Computer Science, page 564-575. Springer, (2006)Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model., , and . STOC, page 1805-1815. ACM, (2024)Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality., , , , and . SODA, page 1319-1384. SIAM, (2023)Stochastic Neuromorphic Circuits for Solving MAXCUT., , , , , and . IPDPS, page 779-787. IEEE, (2023)Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model., , and . CoRR, (2023)The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut., and . FOCS, page 498-506. IEEE, (2022)