( en | de | ru )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
Finding effective support-tree preconditioners.

, , , , and . SPAA, page 176-185. ACM, (2005)

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

Finding effective support-tree preconditioners., , , , and . SPAA, page 176-185. ACM, (2005)Probing a Set of Trajectories to Maximize Captured Information, , , , , , and . CoRR, (2020)Approximation Algorithms for Edge-Dilation k-Center Problems., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 210-219. Springer, (2002)Provable Neuromorphic Advantages for Computing Shortest Paths., , , , , , and . SPAA, page 497-499. ACM, (2020)Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication., , , and . SPAA, page 67-76. ACM, (2018)Spiking Neural Algorithms for Markov Process Random Walk., , , and . IJCNN, page 1-8. IEEE, (2018)Provable Advantages for Graph Algorithms in Spiking Neural Networks., , , , , , and . SPAA, page 35-47. ACM, (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)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 62 (1-2): 633-634 (2012)