Ojas Parekh

Most-cited papers

A Unified Approach to Approximating Partial Covering Problems
Jochen Könemann, Ojas Parekh, Danny Segev
2006Algorithmica100 citations
Semantic Scholar
Energy Scaling Advantages of Resistive Memory Crossbar Based Computation and Its Application to Sparse Coding
S. Agarwal, T. Quach, Ojas Parekh, Alexander H. Hsia +4 more
2016Frontiers in Neuroscience99 citations Open access
Semantic Scholar
HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware
Nicolas P. D. Sawaya, Daniel Marti-Dafcik, Y. Ho, Daniel P. Tabor +12 more
2023International Conference on Quantum Computing and Engineering56 citations Open access
Semantic Scholar
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
Sevag Gharibian, Ojas Parekh
2019International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques56 citations
Semantic Scholar
Neuromorphic scaling advantages for energy-efficient random walk computations
J. Smith, A. Hill, Leah Reeder, B. Franke +4 more
2020Nature Electronics51 citations Open access
Semantic Scholar
Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms
Ojas Parekh, Kevin Thompson
2021International Colloquium on Automata, Languages and Programming43 citations Open access
Semantic Scholar
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
Ojas Parekh, Kevin Thompson
2022arXiv.org36 citations Open access
Semantic Scholar
Spiking network algorithms for scientific computing
William M. Severa, Ojas Parekh, Kristofor D. Carlson, Conrad D. James +1 more
2016International Conference on Rebooting Computing33 citations Open access
Semantic Scholar
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
Buğra Çaşkurlu, V. Mkrtchyan, Ojas Parekh, K. Subramani
2014IFIP TCS33 citations Open access
Semantic Scholar
Solving a steady-state PDE using spiking networks and neuromorphic hardware
J. Smith, William M. Severa, A. J. Hill, Leah Reeder +4 more
2020International Conference on Systems32 citations Open access
Semantic Scholar
Computing with Spikes: The Advantage of Fine-Grained Timing
Stephen J Verzi, Fredrick Rothganger, Ojas Parekh, T. Quach +4 more
2018Neural Computation31 citations
Semantic Scholar
Finding effective support-tree preconditioners
B. Maggs, G. Miller, Ojas Parekh, R. Ravi +1 more
2005ACM Symposium on Parallelism in Algorithms and Architectures30 citations Open access
Semantic Scholar
Provable Advantages for Graph Algorithms in Spiking Neural Networks
J. Aimone, Y. Ho, Ojas Parekh, C. Phillips +3 more
2021ACM Symposium on Parallelism in Algorithms and Architectures27 citations Open access
Semantic Scholar
Spiking Neural Algorithms for Markov Process Random Walk
William M. Severa, R. Lehoucq, Ojas Parekh, J. Aimone
2018IEEE International Joint Conference on Neural Network26 citations Open access
Semantic Scholar
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
S. Report, Ojas Parekh, Jeremy D. Wendt, L. Shulenburger +3 more
201526 citations Open access
Semantic Scholar
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication
Ojas Parekh, C. Phillips, Conrad D. James, J. Aimone
2018ACM Symposium on Parallelism in Algorithms and Architectures24 citations Open access
Semantic Scholar
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality
Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson +1 more
2021ACM-SIAM Symposium on Discrete Algorithms23 citations Open access
Semantic Scholar
Iterative Packing for Demand and Hypergraph Matching
Ojas Parekh
2011Conference on Integer Programming and Combinatorial Optimization23 citations Open access
Semantic Scholar
Solving Symmetric Diagonally-Dominant Systems by Preconditioning
B. Maggs, G. Miller, Ojas Parekh, R. Ravi +2 more
200323 citations
Semantic Scholar
An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
Jun Takahashi, Ch.Tirupathi Rayudu, Cunlu Zhou, Robbie King +2 more
202322 citations
Semantic Scholar
Dynamic Programming with Spiking Neural Computing
J. Aimone, Ojas Parekh, C. Phillips, A. Pınar +2 more
2019International Conference on Systems22 citations Open access
Semantic Scholar
The brain’s unique take on algorithms
J. Aimone, Ojas Parekh
2023Nature Communications19 citations Open access
Semantic Scholar
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems
Ojas Parekh, Kevin Thompson
2020Embedded Systems and Applications19 citations Open access
Semantic Scholar
A Combinatorial Model for Dentate Gyrus Sparse Coding
William M. Severa, Ojas Parekh, Conrad D. James, J. Aimone
2017Neural Computation18 citations Open access
Semantic Scholar
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
Ojas Parekh, David Pritchard
2014Workshop on Approximation and Online Algorithms18 citations Open access
Semantic Scholar
Approximability of the capacitated b-edge dominating set problem
A. Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
2007Theoretical Computer Science17 citations Open access
Semantic Scholar
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
Buğra Çaşkurlu, V. Mkrtchyan, Ojas Parekh, K. Subramani
2017SIAM Journal on Discrete Mathematics16 citations
Semantic Scholar
Geometric Hitting Set for Segments of Few Orientations
S. Fekete, Kan Huang, Joseph B. M. Mitchell, Ojas Parekh +1 more
2015Theory of Computing Systems16 citations Open access
Semantic Scholar
Provable Neuromorphic Advantages for Computing Shortest Paths
J. Aimone, Y. Ho, Ojas Parekh, C. Phillips +3 more
2020ACM Symposium on Parallelism in Algorithms and Architectures15 citations
Semantic Scholar
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut
John Kallaugher, Ojas Parekh
2022IEEE Annual Symposium on Foundations of Computer Science14 citations Open access
Semantic Scholar
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems
A. Berger, Ojas Parekh
2008Algorithmica14 citations
Semantic Scholar
Compacting cuts: a new linear formulation for minimum cut
R. Carr, G. Konjevod, G. Little, Venkatesh Natarajan +1 more
2007ACM-SIAM Symposium on Discrete Algorithms14 citations
Semantic Scholar
Linear Time Algorithms for Generalized Edge Dominating Set Problems
A. Berger, Ojas Parekh
2005Workshop on Algorithms and Data Structures14 citations Open access
Semantic Scholar
Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality
Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson +1 more
2021arXiv.org13 citations
Semantic Scholar
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem
Sean Hallgren, Eunou Lee, Ojas Parekh
2020International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques13 citations
Semantic Scholar
An explicit vector algorithm for high-girth MaxCut
Jessica Thompson, Ojas Parekh, Kunal Marwaha
2021SIAM Symposium on Simplicity in Algorithms11 citations Open access
Semantic Scholar
Neural computing for scientific computing applications: more than just machine learning
J. Aimone, Ojas Parekh, William M. Severa
2017Neuromorphic Computing Symposium11 citations Open access
Semantic Scholar
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Jochen Könemann, Ojas Parekh, David Pritchard
2009Workshop on Approximation and Online Algorithms11 citations
Semantic Scholar
Polyhedral techniques for graphic covering problems
R. Ravi, Ojas Parekh
200211 citations
Semantic Scholar
Path Hitting in Acyclic Graphs
Ojas Parekh, Danny Segev
2006Algorithmica8 citations
Semantic Scholar
LDRD Final Report on Massively-Parallel Linear Programming: the parPCx System
Ojas Parekh, C. Phillips, E. Boman
20058 citations Open access
Semantic Scholar
An approximation algorithm for the edge-dilation k-center problem,
J. Könemann, Yan-Jun Li, Ojas Parekh, Amitabh Sinha
2004Operations Research Letters8 citations
Semantic Scholar
Synergies Between Operations Research and Quantum Information Science
Ojas Parekh
2023INFORMS journal on computing7 citations Open access
Semantic Scholar
Stochastic Neuromorphic Circuits for Solving MAXCUT
Bradley H. Theilman, Yipu Wang, Ojas Parekh, William M. Severa +2 more
2022IEEE International Parallel and Distributed Processing Symposium7 citations
Semantic Scholar
On Small-Depth Tree Augmentations
Ojas Parekh, R. Ravi, Michael Zlatin
2021Operations Research Letters7 citations Open access
Semantic Scholar
A computational framework for ontologically storing and analyzing very large overhead image sets
R. Brost, William C. McLendon, Ojas Parekh, M. Rintoul +2 more
2014BigSpatial@SIGSPATIAL7 citations Open access
Semantic Scholar
Forestation in Hypergraphs: Linear k-Trees
Ojas Parekh
2003Electronic Journal of Combinatorics7 citations Open access
Semantic Scholar
Quantum Optimization and Approximation Algorithms.
Ojas Parekh, C. Ryan-Anderson, Sevag Gharibian
20196 citations Open access
Semantic Scholar
The Approximability of Partial Vertex Covers in Trees
V. Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
2017Conference on Current Trends in Theory and Practice of Informatics6 citations Open access
Semantic Scholar
The energy scaling advantages of RRAM crossbars
S. Agarwal, Ojas Parekh, T. Quach, Conrad D. James +2 more
20152015 Fourth Berkeley Symposium on Energy Efficient Electronic Systems (E3S)6 citations Open access
Semantic Scholar