Ojas Parekh

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 47

Top Topics

Maximum Matching

Approximation Algorithms

Top Venues

Publications

Eunou Lee, Ojas Parekh
An Improved Quantum Max Cut Approximation via Maximum Matching. ICALP (2024)
John Kallaugher, Ojas Parekh, Nadezhda Voronova
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. STOC (2024)
John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, Justin Yirka
Complexity Classification of Product State Problems for Local Hamiltonians. CoRR (2024)
John Kallaugher, Ojas Parekh, Nadezhda Voronova
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. Electron. Colloquium Comput. Complex. (2023)
Ojas Parekh
Synergies Between Operations Research and Quantum Information Science. INFORMS J. Comput. 35 (2) (2023)
Bradley H. Theilman, Yipu Wang, Ojas Parekh, William Severa, J. Darby Smith, James B. Aimone
Stochastic Neuromorphic Circuits for Solving MAXCUT. IPDPS (2023)
Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. SODA (2023)
John Kallaugher, Ojas Parekh, Nadezhda Voronova
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. CoRR (2023)
Ojas Parekh
Synergies Between Operations Research and Quantum Information Science. CoRR (2023)
Carleton Coffrin, Elisabeth Lobe, Giacomo Nannicini, Ojas Parekh
- Quantum Computing and Operations Research. INFORMS J. Comput. 35 (3) (2023)
Daniel Hothem, Ojas Parekh, Kevin Thompson
Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians. TQC (2023)
Ojas Parekh, R. Ravi, Michael Zlatin
On small-depth tree augmentations. Oper. Res. Lett. 50 (6) (2022)
John Kallaugher, Ojas Parekh
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. CoRR (2022)
Jessica K. Thompson, Ojas Parekh, Kunal Marwaha
An explicit vector algorithm for high-girth MaxCut. SOSA (2022)
Ojas Parekh, Kevin Thompson
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms. CoRR (2022)
John Kallaugher, Ojas Parekh
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. FOCS (2022)
J. Darby Smith, Aaron J. Hill, Leah E. Reeder, Brian C. Franke, Richard B. Lehoucq, Ojas Parekh, William Severa, James B. Aimone
Neuromorphic scaling advantages for energy-efficient random walk computation. CoRR (2021)
Jessica K. Thompson, Ojas Parekh, Kunal Marwaha
An explicit vector algorithm for high-girth MaxCut. CoRR (2021)
James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang
Provable Advantages for Graph Algorithms in Spiking Neural Networks. SPAA (2021)
Ojas Parekh, R. Ravi, Michael Zlatin
On Small-Depth Tree Augmentations. CoRR (2021)
Ojas Parekh, Kevin Thompson
Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. ICALP (2021)
Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright
Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality. CoRR (2021)
Ojas Parekh, Kevin Thompson
Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. CoRR (2021)
Ojas Parekh, Kevin Thompson
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. ESA (2021)
Sean Hallgren, Eunou Lee, Ojas Parekh
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem. APPROX-RANDOM (2020)
Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Probing a Set of Trajectories to Maximize Captured Information. CoRR (2020)
Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. CoRR (2020)
Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Probing a Set of Trajectories to Maximize Captured Information. SEA (2020)
Ojas Parekh, Kevin Thompson
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. CoRR (2020)
James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang
Provable Neuromorphic Advantages for Computing Shortest Paths. SPAA (2020)
Sevag Gharibian, Ojas Parekh
Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut. CoRR (2019)
James B. Aimone, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Helen Xu
Dynamic Programming with Spiking Neural Computing. ICONS (2019)
Sevag Gharibian, Ojas Parekh
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. APPROX-RANDOM (2019)
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Geometric Hitting Set for Segments of Few Orientations. Theory Comput. Syst. 62 (2) (2018)
William Severa, Rich Lehoucq, Ojas Parekh, James B. Aimone
Spiking Neural Algorithms for Markov Process Random Walk. IJCNN (2018)
Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. SPAA (2018)
Stephen J. Verzi, Fredrick H. Rothganger, Ojas Parekh, Tu-Thach Quach, Nadine E. Miner, Craig M. Vineyard, Conrad D. James, James B. Aimone
Computing with Spikes: The Advantage of Fine-Grained Timing. Neural Comput. 30 (10) (2018)
William Severa, Rich Lehoucq, Ojas Parekh, James B. Aimone
Spiking Neural Algorithms for Markov Process Random Walk. CoRR (2018)
James B. Aimone, Ojas Parekh, William Severa
Neural computing for scientific computing applications: more than just machine learning. NCS (2017)
Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
The Approximability of Partial Vertex Covers in Trees. SOFSEM (2017)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31 (3) (2017)
William Severa, Ojas Parekh, Conrad D. James, James B. Aimone
A Combinatorial Model for Dentate Gyrus Sparse Coding. Neural Comput. 29 (1) (2017)
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Geometric Hitting Set for Segments of Few Orientations. CoRR (2016)
William Severa, Ojas Parekh, Kristofor D. Carlson, Conrad D. James, James B. Aimone
Spiking network algorithms for scientific computing. ICRC (2016)
Ojas Parekh
Iterative Packing for Demand and Hypergraph Matching. CoRR (2016)
Ojas Parekh, David Pritchard
Generalized Hypergraph Matching via Iterated Packing and Local Ratio. CoRR (2016)
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Geometric Hitting Set for Segments of Few Orientations. WAOA (2015)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS (2014)
Ojas Parekh, David Pritchard
Generalized Hypergraph Matching via Iterated Packing and Local Ratio. WAOA (2014)
Jochen Könemann, Ojas Parekh, David Pritchard
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica 68 (3) (2014)
Randy C. Brost, William C. McLendon III, Ojas Parekh, Mark D. Rintoul, David R. Strip, Diane Myung-kyung Woodbridge
A computational framework for ontologically storing and analyzing very large overhead image sets. BigSpatial@SIGSPATIAL (2014)
André Berger, Ojas Parekh
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 62 (1-2) (2012)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59 (4) (2011)
Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley
-hurdle Problems. Algorithmica 59 (1) (2011)
Ojas Parekh
Iterative Packing for Demand and Hypergraph Matching. IPCO (2011)
James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang
Constraint processing in relational database systems: from theory to implementation. SAC (2010)
Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms 5 (3) (2009)
André Berger, Ojas Parekh
Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 50 (2) (2008)
Ojas Parekh, Danny Segev
Path Hitting in Acyclic Graphs. Algorithmica 52 (4) (2008)
Ojas Parekh
Approximation algorithms for partially covering with edges. Theor. Comput. Sci. 400 (1-3) (2008)
Jochen Könemann, Ojas Parekh, David Pritchard
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA (2008)
André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385 (1-3) (2007)
Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
Compacting cuts: a new linear formulation for minimum cut. SODA (2007)
Robert D. Carr, Ojas Parekh
-matching problem. Oper. Res. Lett. 34 (4) (2006)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. ESA (2006)
Ojas Parekh, Danny Segev
Path Hitting in Acyclic Graphs. ESA (2006)
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo
Finding effective support-tree preconditioners. SPAA (2005)
André Berger, Ojas Parekh
Linear Time Algorithms for Generalized Edge Dominating Set Problems. WADS (2005)
Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
. Oper. Res. Lett. 32 (5) (2004)
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
Improved Approximations for Tour and Tree Covers. Algorithmica 38 (3) (2004)
Ojas Parekh
Forestation in Hypergraphs: Linear k-Trees. Electron. J. Comb. 10 (2003)
Eduardo Sany Laber, Ojas Parekh, R. Ravi
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA (2002)
Ojas Parekh
Edge dominating and hypomatchable sets. SODA (2002)
Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT (2002)
Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5 (3) (2001)
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
Improved approximations for tour and tree covers. APPROX (2000)
Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA (2000)
Ellen W. Zegura, Scott McFarland, Ojas Parekh
A survey and new results in renegotiated service. J. High Speed Networks 6 (3) (1997)