Ojas Parekh

According to our database, Ojas Parekh authored at least 62 papers between 1997 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Introduction to the Special Issue on Quantum Computing and Operations Research.

Carleton Coffrin, Elisabeth Lobe, Giacomo Nannicini, Ojas Parekh

INFORMS J. Comput., 2025

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing.

Ojas Parekh, John Kallaugher, Nadezhda Voronova

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Complexity Classification of Product State Problems for Local Hamiltonians.

John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, Justin Yirka

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Approximation Algorithms for Partial Vertex Covers in Trees.

Vahan Mkrtchyan, Ojas Parekh, K. Subramani

Int. J. Found. Comput. Sci., June, 2024

An Improved Quantum Max Cut Approximation via Maximum Matching.

Eunou Lee, Ojas Parekh

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Synergies Between Operations Research and Quantum Information Science.

Ojas Parekh

INFORMS J. Comput., 2023

Special Issue of <i>INFORMS Journal on Computing</i> - Quantum Computing and Operations Research.

Carleton Coffrin, Elisabeth Lobe, Giacomo Nannicini, Ojas Parekh

INFORMS J. Comput., 2023

Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model.

John Kallaugher, Ojas Parekh, Nadezhda Voronova

Electron. Colloquium Comput. Complex., 2023

Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians.

Daniel Hothem, Ojas Parekh, Kevin Thompson

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality.

Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware.

Nicolas P. D. Sawaya, Daniel Marti-Dafcik, Yang Ho, Daniel P. Tabor, David Esteban Bernal Neira, Alicia B. Magann, Shavindra P. Premaratne, Pradeep Dubey, Anne Y. Matsuura, Nathan Bishop, Wibe A. de Jong, Simon Benjamin, Ojas D. Parekh, Norm M. Tubman, Katherine Klymko, Daan Camps

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Stochastic Neuromorphic Circuits for Solving MAXCUT.

Bradley H. Theilman, Yipu Wang, Ojas Parekh, William Severa, J. Darby Smith, James B. Aimone

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

On small-depth tree augmentations.

Ojas Parekh, R. Ravi, Michael Zlatin

Oper. Res. Lett., 2022

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms.

Ojas Parekh, Kevin Thompson

CoRR, 2022

An explicit vector algorithm for high-girth MaxCut.

Jessica K. Thompson, Ojas Parekh, Kunal Marwaha

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.

John Kallaugher, Ojas Parekh

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality.

Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright

CoRR, 2021

Neuromorphic scaling advantages for energy-efficient random walk computation.

J. Darby Smith, Aaron J. Hill, Leah E. Reeder, Brian C. Franke, Richard B. Lehoucq, Ojas Parekh, William Severa, James B. Aimone

CoRR, 2021

Provable Advantages for Graph Algorithms in Spiking Neural Networks.

James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms.

Ojas Parekh, Kevin Thompson

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems.

Ojas Parekh, Kevin Thompson

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Probing a Set of Trajectories to Maximize Captured Information.

Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Provable Neuromorphic Advantages for Computing Shortest Paths.

James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Solving a steady-state PDE using spiking networks and neuromorphic hardware.

J. Darby Smith, William Severa, Aaron J. Hill, Leah Reeder, Brian Franke, Richard B. Lehoucq, Ojas D. Parekh, James B. Aimone

Proceedings of the International Conference on Neuromorphic Systems, 2020

An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem.

Sean Hallgren, Eunou Lee, Ojas Parekh

Proceedings of the Approximation, 2020

2019

Dynamic Programming with Spiking Neural Computing.

James B. Aimone, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Helen Xu

Proceedings of the International Conference on Neuromorphic Systems, 2019

Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.

Sevag Gharibian, Ojas Parekh

Proceedings of the Approximation, 2019

2018

Computing with Spikes: The Advantage of Fine-Grained Timing.

Stephen J. Verzi, Fredrick H. Rothganger, Ojas Parekh, Tu-Thach Quach, Nadine E. Miner, Craig M. Vineyard, Conrad D. James, James B. Aimone

Neural Comput., 2018

Geometric Hitting Set for Segments of Few Orientations.

Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips

Theory Comput. Syst., 2018

Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication.

Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Spiking Neural Algorithms for Markov Process Random Walk.

William Severa, Rich Lehoucq, Ojas Parekh, James B. Aimone

Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

2017

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.

Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani

SIAM J. Discret. Math., 2017

A Combinatorial Model for Dentate Gyrus Sparse Coding.

William Severa, Ojas Parekh, Conrad D. James, James B. Aimone

Neural Comput., 2017

The Approximability of Partial Vertex Covers in Trees.

Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Neural computing for scientific computing applications: more than just machine learning.

James B. Aimone, Ojas Parekh, William Severa

Proceedings of the Neuromorphic Computing Symposium, 2017

2016

Spiking network algorithms for scientific computing.

William Severa, Ojas Parekh, Kristofor D. Carlson, Conrad D. James, James B. Aimone

Proceedings of the IEEE International Conference on Rebooting Computing, 2016

2014

Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation.

Jochen Könemann, Ojas Parekh, David Pritchard

Algorithmica, 2014

Generalized Hypergraph Matching via Iterated Packing and Local Ratio.

Ojas Parekh, David Pritchard

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs.

Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani

Proceedings of the Theoretical Computer Science, 2014

A computational framework for ontologically storing and analyzing very large overhead image sets.

Randy C. Brost, William C. McLendon III, Ojas Parekh, Mark D. Rintoul, David R. Strip, Diane Myung-kyung Woodbridge

Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2014

2012

Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.

André Berger, Ojas Parekh

Algorithmica, 2012

2011

A Unified Approach to Approximating Partial Covering Problems.

Jochen Könemann, Ojas Parekh, Danny Segev

Algorithmica, 2011

Approximation Algorithms for <i>k</i>-hurdle Problems.

Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley

Algorithmica, 2011

Iterative Packing for Demand and Hypergraph Matching.

Ojas Parekh

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Constraint processing in relational database systems: from theory to implementation.

James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009

Compacting cuts: A new linear formulation for minimum cut.

Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh

ACM Trans. Algorithms, 2009

2008

Approximation algorithms for partially covering with edges.

Ojas Parekh

Theor. Comput. Sci., 2008

Path Hitting in Acyclic Graphs.

Ojas Parekh, Danny Segev

Algorithmica, 2008

Linear Time Algorithms for Generalized Edge Dominating Set Problems.

André Berger, Ojas Parekh

Algorithmica, 2008

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.

Jochen Könemann, Ojas Parekh, David Pritchard

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

Approximability of the capacitated b-edge dominating set problem.

André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh

Theor. Comput. Sci., 2007

2006

A 1/2-integral relaxation for the <i>A</i>-matching problem.

Robert D. Carr, Ojas Parekh

Oper. Res. Lett., 2006

2005

Finding effective support-tree preconditioners.

Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004

An approximation algorithm for the edge-dilation <i>k</i>-center problem^,.

Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha

Oper. Res. Lett., 2004

Improved Approximations for Tour and Tree Covers.

Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha

Algorithmica, 2004

2003

Forestation in Hypergraphs: Linear k-Trees.

Ojas Parekh

Electron. J. Comb., 2003

2002

Approximation Algorithms for Edge-Dilation k-Center Problems.

Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha

Proceedings of the Algorithm Theory, 2002

Edge dominating and hypomatchable sets.

Ojas Parekh

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.

Eduardo Sany Laber, Ojas Parekh, R. Ravi

Proceedings of the Algorithms, 2002

2001

A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh

J. Comb. Optim., 2001

2000

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh

Proceedings of the Algorithms, 2000

1997

A survey and new results in renegotiated service.

Ellen W. Zegura, Scott McFarland, Ojas Parekh

J. High Speed Networks, 1997