Ojas Parekh - RankMe

88 papers A* 7A 8B 12Misc 1Journal 48Unranked 12

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