I agree that this site is using cookies. You can find further informations here.
X
Parekh, Ojas
73  results:
Search for persons X
?
1

Exponential Quantum Space Advantage for Approximating Maxim..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Kallaugher, John ; Parekh, Ojas ; Voronova, Nadezhda - p. 1805-1815 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Special Issue of INFORMS Journal on Computing—Quantum Compu..:

Coffrin, Carleton ; Lobe, Elisabeth ; Nannicini, Giacomo.
INFORMS Journal on Computing.  35 (2023)  3 - p. 521-522 , 2023
Link: https://doi.org/10.1287/..
 
?
3

Stochastic Neuromorphic Circuits for Solving MAXCUT:

, In: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS),
Theilman, Bradley H. ; Wang, Yipu ; Parekh, Ojas... - p. 779-787 , 2023
Link: https://doi.org/10.1109/..
 
?
4

The brain's unique take on algorithms:

Aimone, James B. ; Parekh, Ojas
Nature Communications.  14 (2023)  1 - p. , 2023
Link: https://doi.org/10.1038/..
 
?
5

HamLib: A Library of Hamiltonians for Benchmarking Quantum ..:

, In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE),
Sawaya, Nicolas PD ; Marti-Dafcik, Daniel ; Ho, Yang... - p. 389-390 , 2023
Link: https://doi.org/10.1109/..
 
?
6

Synergies Between Operations Research and Quantum Informati..:

Parekh, Ojas
INFORMS Journal on Computing.  35 (2023)  2 - p. 266-273 , 2023
Link: https://doi.org/10.1287/..
 
?
7

Neuromorphic scaling advantages for energy-efficient random..:

Smith, J. Darby ; Hill, Aaron J. ; Reeder, Leah E....
Nature Electronics.  5 (2022)  2 - p. 102-112 , 2022
Link: https://doi.org/10.1038/..
 
?
8

The Quantum and Classical Streaming Complexity of Quantum a..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Kallaugher, John ; Parekh, Ojas - p. 498-506 , 2022
Link: https://doi.org/10.1109/..
 
?
9

On small-depth tree augmentations:

Parekh, Ojas ; Ravi, R. ; Zlatin, Michael
Operations Research Letters.  50 (2022)  6 - p. 667-673 , 2022
Link: https://doi.org/10.1016/..
 
?
10

Provable Advantages for Graph Algorithms in Spiking Neural ..:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Aimone, James B. ; Ho, Yang ; Parekh, Ojas... - p. 35-47 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Solving a steady-state PDE using spiking networks and neuro..:

, In: International Conference on Neuromorphic Systems 2020,
Smith, J. Darby ; Severa, William ; Hill, Aaron J.... - p. 1-8 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Provable Neuromorphic Advantages for Computing Shortest Pat..:

, In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
Aimone, James B. ; Ho, Yang ; Parekh, Ojas... - p. 497-499 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Dynamic Programming with Spiking Neural Computing:

, In: Proceedings of the International Conference on Neuromorphic Systems,
Aimone, James B. ; Parekh, Ojas ; Phillips, Cynthia A.... - p. 1-9 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Constant-Depth and Subcubic-Size Threshold Circuits for Mat..:

, In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures,
Parekh, Ojas ; Phillips, Cynthia A. ; James, Conrad D.. - p. 67-76 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Geometric Hitting Set for Segments of Few Orientations:

Fekete, Sándor P. ; Huang, Kan ; Mitchell, Joseph S. B...
Theory of Computing Systems.  62 (2017)  2 - p. 268-303 , 2017
Link: https://doi.org/10.1007/..
 
1-15