Ojas Parekh

According to our database1, Ojas Parekh authored at least 57 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Complexity Classification of Product State Problems for Local Hamiltonians.
CoRR, 2024

2023
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model.
Electron. Colloquium Comput. Complex., 2023

Synergies Between Operations Research and Quantum Information Science.
CoRR, 2023

Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians.
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.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Stochastic Neuromorphic Circuits for Solving MAXCUT.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022
On small-depth tree augmentations.
Oper. Res. Lett., 2022

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

An explicit vector algorithm for high-girth MaxCut.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.
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.
CoRR, 2021

Neuromorphic scaling advantages for energy-efficient random walk computation.
CoRR, 2021

Provable Advantages for Graph Algorithms in Spiking Neural Networks.
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.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Probing a Set of Trajectories to Maximize Captured Information.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Provable Neuromorphic Advantages for Computing Shortest Paths.
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.
Proceedings of the International Conference on Neuromorphic Systems, 2020

An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem.
Proceedings of the Approximation, 2020

2019
Dynamic Programming with Spiking Neural Computing.
Proceedings of the International Conference on Neuromorphic Systems, 2019

Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.
Proceedings of the Approximation, 2019

2018
Computing with Spikes: The Advantage of Fine-Grained Timing.
Neural Comput., 2018

Geometric Hitting Set for Segments of Few Orientations.
Theory Comput. Syst., 2018

Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Spiking Neural Algorithms for Markov Process Random Walk.
Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

2017
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.
SIAM J. Discret. Math., 2017

A Combinatorial Model for Dentate Gyrus Sparse Coding.
Neural Comput., 2017

The Approximability of Partial Vertex Covers in Trees.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Neural computing for scientific computing applications: more than just machine learning.
Proceedings of the Neuromorphic Computing Symposium, 2017

2016
Spiking network algorithms for scientific computing.
Proceedings of the IEEE International Conference on Rebooting Computing, 2016

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

Generalized Hypergraph Matching via Iterated Packing and Local Ratio.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs.
Proceedings of the Theoretical Computer Science, 2014

A computational framework for ontologically storing and analyzing very large overhead image sets.
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.
Algorithmica, 2012

2011
A Unified Approach to Approximating Partial Covering Problems.
Algorithmica, 2011

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

Iterative Packing for Demand and Hypergraph Matching.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Constraint processing in relational database systems: from theory to implementation.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009
Compacting cuts: A new linear formulation for minimum cut.
ACM Trans. Algorithms, 2009

2008
Approximation algorithms for partially covering with edges.
Theor. Comput. Sci., 2008

Path Hitting in Acyclic Graphs.
Algorithmica, 2008

Linear Time Algorithms for Generalized Edge Dominating Set Problems.
Algorithmica, 2008

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007
Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci., 2007

2006
A 1/2-integral relaxation for the <i>A</i>-matching problem.
Oper. Res. Lett., 2006

2005
Finding effective support-tree preconditioners.
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<sup>, </sup>.
Oper. Res. Lett., 2004

Improved Approximations for Tour and Tree Covers.
Algorithmica, 2004

2003
Forestation in Hypergraphs: Linear k-Trees.
Electron. J. Comb., 2003

2002
Approximation Algorithms for Edge-Dilation k-Center Problems.
Proceedings of the Algorithm Theory, 2002

Edge dominating and hypomatchable sets.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
Proceedings of the Algorithms, 2002

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

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

1997
A survey and new results in renegotiated service.
J. High Speed Networks, 1997


  Loading...