Ojas Parekh
Discrete Math & Optimization

Discrete Math & Optimization
(505) 844-0287
Sandia National Laboratories, New Mexico
P.O. Box 5800
Albuquerque, NM 87185-1326
Biography
I am a theoretical computer scientist who enjoys applying mathematical techniques to practically motivated interdisciplinary problems. I have worked in a variety of fields including discrete optimization, combinatorics, combinatorial scientific computing, and most recently, quantum and neuromorphic computing. A recent passion is helping shape the emerging fields of quantum approximation algorithms and quantum discrete optimization.
I direct the Department of Energy’s Fundamental Algorithmic Research for Quantum Computing (FAR-QC) project, a multi-institutional effort tasked with designing novel quantum algorithms to realize resource advantages over classical computation, especially for optimization, simulation, and machine learning.
Experience
- 2014-Present Principal Member of Technical Staff, Sandia National Labs
- 2010-2013 Senior Member of Technical Staff, Sandia National Labs
- 2003-2009 Assistant Professor of Computer Science, Math CS Department, Emory University
- 2002-2003 Postdoc, Sandia National Labs
- 1997-2002 Ph.D. in Algorithms, Combinatorics, and Optimization, Carnegie Mellon University
- 1995-1997 B.S. in Discrete Mathematics, Georgia Tech
Publications
-
Smith, J., Hill, A.J., Reeder, L.E., Franke, B., Lehoucq, R., Parekh, O., Severa, W., Aimone, J.B., & Aimone, J.B. (2022). Neuromorphic scaling advantages for energy-efficient random walk computations. Nature Electronics, 5(2), pp. 102-112. https://doi.org/10.1038/s41928-021-00705-7 Publication ID: 80181
-
Parekh, O., Wang, Y., Ho, Y., Phillips, C., Pinar, A., Aimone, J.B., Severa, W., & Severa, W. (2021). Neuromorphic Graph Algorithms. https://doi.org/10.2172/1829422 Publication ID: 76679
-
Parekh, O., Thompson, K., & Thompson, K. (2021). Beating random assignment for approximating quantum 2-local hamiltonian problems [Conference Presenation]. Leibniz International Proceedings in Informatics, LIPIcs. https://doi.org/10.2172/1884207 Publication ID: 75371
-
Aimone, J.B., Ho, Y., Parekh, O., Phillips, C., Pinar, A., Severa, W., Wang, Y., & Wang, Y. (2021). Provable advantages for graph algorithms in spiking neural networks [Conference Paper]. Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3409964.3461813 Publication ID: 78648
-
Parekh, O., Thompson, J., & Thompson, J. (2021). Outperforming QAOA on MaxCut with Fast Classical Hyperplane Rounding Algorithms [Conference Presenation]. https://doi.org/10.2172/1882084 Publication ID: 79547
-
Parekh, O., Thompson, K., & Thompson, K. (2021). Application of the level-2 quantum lasserre hierarchy in quantum approximation algorithms [Conference Presenation]. Leibniz International Proceedings in Informatics, LIPIcs. https://doi.org/10.2172/1884683 Publication ID: 78977
-
Aimone, J.B., Ho, Y., Parekh, O., Phillips, C., Pinar, A., Severa, W., Wang, Y., & Wang, Y. (2021). Provable Advantages for Graph Algorithms in Spiking Neural Networks [Conference Presenation]. https://doi.org/10.2172/1890920 Publication ID: 78930
-
Parekh, O. (2021). CIS External Review Lightning Presentation: Neuromorphic Graph Algorithms [Presentation]. https://www.osti.gov/biblio/1856083 Publication ID: 77677
-
Ebeida, M., Abdelkader, A., Amenta, N., Kouri, D.P., Parekh, O., Phillips, C., Winovich, N., & Winovich, N. (2020). Novel Geometric Operations for Linear Programming. https://doi.org/10.2172/1813669 Publication ID: 71776
-
Hallgren, S., Lee, E., Parekh, O., & Parekh, O. (2020). An approximation algorithm for the MAX-2-local hamiltonian problem [Conference Poster]. Leibniz International Proceedings in Informatics, LIPIcs. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85091272313&origin=inward Publication ID: 77248
-
Aimone, J.B., Ho, Y., Parekh, O., Phillips, C., Pinar, A., Severa, W., Wang, Y., & Wang, Y. (2020). Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths [Conference Poster]. https://www.osti.gov/biblio/1814114 Publication ID: 74560
-
Smith, J., Severa, W., Hill, A.J., reeder, L., Parekh, O., Franke, B., Lehoucq, R., Aimone, J.B., & Aimone, J.B. (2020). Solving a steady-state pde using spiking networks and neuromorphic hardware [Conference Poster]. https://doi.org/10.1145/3407197.3407202 Publication ID: 74507
-
Smith, J., Severa, W., Hill, A.J., Reeder, L., Franke, B., Lehoucq, R., Parekh, O., Aimone, J.B., & Aimone, J.B. (2020). Solving a steady-state PDE using spiking networks and neuromorphic hardware [Conference Poster]. ACM International Conference Proceeding Series. https://doi.org/10.1145/3407197.3407202 Publication ID: 74065
-
Aimone, J.B., Ho, Y., Parekh, O., Phillips, C., Pinar, A., Severa, W., Wang, Y., & Wang, Y. (2020). Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths [Conference Poster]. https://www.osti.gov/biblio/1808434 Publication ID: 74074
-
Fekete, S.P., Hill, A., Krupke, D., Mayer, T., Mitchell, J.S.B., Parekh, O., Phillips, C., & Phillips, C. (2020). Probing a Set of Trajectories to Maximize Captured Information [Conference Poster]. Leibniz International Proceedings in Informatics, LIPIcs. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85088166178&origin=inward Publication ID: 73277
-
Parekh, O. (2020). Quantum Optimization and Learning and Simulation (QOALAS): Project Overview [Presentation]. https://www.osti.gov/biblio/1884115 Publication ID: 73012
-
Parekh, O. (2020). Fundamental Algorithmic Research for Quantum Computing (FAR-QC): Project Overview [Presentation]. https://www.osti.gov/biblio/1882061 Publication ID: 73011
-
Stephens, J., Parekh, O., Bolden, W., & Bolden, W. (2020). A Hybrid Quantum Optimization Algorithm Incorporating Classical Heuristics [Presentation]. https://www.osti.gov/biblio/1761890 Publication ID: 70788
-
Smith, J., Aimone, J.B., Franke, B., Hill, A.J., Lehoucq, R., Parekh, O., Reeder, L., Severa, W., & Severa, W. (2020). Solving IPDEs on Spiking Neuromorphic Hardware [Conference Poster]. https://www.osti.gov/biblio/1761032 Publication ID: 70692
-
Parekh, O. (2019). Almost optimal classical algorithms for a quantum generalization of Max Cut [Conference Poster]. https://www.osti.gov/biblio/1643365 Publication ID: 66940
-
Gharibian, S., Parekh, O., & Parekh, O. (2019). Almost optimal classical approximation algorithms for a quantum generalization of max-cut [Conference Poster]. Leibniz International Proceedings in Informatics, LIPIcs. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85072862729&origin=inward Publication ID: 65388
-
Parekh, O. (2019). Quantum Approaches for Discrete Optimization [Conference Poster]. https://www.osti.gov/biblio/1641667 Publication ID: 70517
-
Aimone, J.B., Parekh, O., Phillips, C., Pinar, A., Severa, W., Xu, H., & Xu, H. (2019). Dynamic Programming with Spiking Neural Computing [Conference Poster]. https://doi.org/10.1145/3354265.3354285 Publication ID: 70516
-
Aimone, J.B., Pinar, A., Parekh, O., Severa, W., Phillips, C., Xu, H., & Xu, H. (2019). Dynamic programming with spiking neural computing [Conference Poster]. ACM International Conference Proceeding Series. https://doi.org/10.1145/3354265.3354285 Publication ID: 70018
-
Stephens, J., Ryan-Anderson, C., Bolden, W., Parekh, O., & Parekh, O. (2019). Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems [Conference Poster]. https://www.osti.gov/biblio/1598932 Publication ID: 65622
-
Parekh, O., Ryan-Anderson, C., Gharibian, S., & Gharibian, S. (2019). Quantum Optimization and Approximation Algorithms. https://doi.org/10.2172/1492737 Publication ID: 64463
-
Parekh, O. (2019). Quantum Approaches for Discrete Optimization [Conference Poster]. https://www.osti.gov/biblio/1595905 Publication ID: 64464
-
Severa, W., Lehoucq, R., Parekh, O., Aimone, J.B., & Aimone, J.B. (2018). Spiking Neural Algorithms for Markov Process Random Walk [Conference Poster]. Proceedings of the International Joint Conference on Neural Networks. https://doi.org/10.1109/IJCNN.2018.8489628 Publication ID: 61822
-
Verzi, S., Rothganger, F., Parekh, O., Quach, T.-T., Miner, N., Vineyard, C., James, C., Aimone, J.B., & Aimone, J.B. (2018). Computing with spikes: The advantage of fine-grained timing. Neural Computation, 30(10), pp. 2660-2690. https://doi.org/10.1162/neco_a_01113 Publication ID: 63758
-
Sarovar, M., Parekh, O., Somma, R., Subasi, Y., Metcalf, M., Moussa, J., Su, Y., Childs, A., Gharibian, S., Ryan-Anderson, C., Bapat, A., Jordan, S., & Jordan, S. (2018). Quantum Optimization and Learning and Simulation [Conference Poster]. https://www.osti.gov/biblio/1592311 Publication ID: 59036
-
Aimone, J.B., Hill, A.J., Lehoucq, R., Parekh, O., Reeder, L., Severa, W., & Severa, W. (2018). Neural Algorithms for Low Power Implementation of Partial Differential Equations. https://doi.org/10.2172/1474253 Publication ID: 59070
-
Aimone, J.B., Hill, A.J., Lehoucq, R., Parekh, O., Severa, W., & Severa, W. (2018). Neuromorphic Hardware Implementation of Spiking Algorithms for Markov Random Walks [Conference Poster]. https://www.osti.gov/biblio/1582258 Publication ID: 63837
-
Stephens, J., Parekh, O., Ryan-Anderson, C., & Ryan-Anderson, C. (2018). Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems [Presentation]. https://www.osti.gov/biblio/1577041 Publication ID: 63577
-
Parekh, O., James, C., Phillips, C., Aimone, J.B., & Aimone, J.B. (2018). Constant-depth and subcubic-size threshold circuits for matrix multiplication [Conference Poster]. Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85053484982&origin=inward Publication ID: 55164
-
Debusschere, B., Sargsyan, K., Parekh, O., & Parekh, O. (2018). Quantum Annealing Approaches for Building Sparse Surrogate Models in Uncertainty Quantification [Conference Poster]. https://www.osti.gov/biblio/1806634 Publication ID: 63222
-
Severa, W., Lehoucq, R., Parekh, O., Aimone, J.B., & Aimone, J.B. (2018). Spiking Neural Algorithms for Markov Process Random Walk [Conference Poster]. https://doi.org/10.1109/IJCNN.2018.8489628 Publication ID: 62925
-
Parekh, O. (2018). Quantum Optimization Algorithms [Presentation]. https://www.osti.gov/biblio/1526360 Publication ID: 62546
-
Parekh, O., Phillips, C., James, C., Aimone, J.B., & Aimone, J.B. (2018). Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication [Conference Poster]. https://doi.org/10.1145/3210377.3210410 Publication ID: 62239
-
Parekh, O., Phillips, C., Powers, V., Sakr, N., Stein, C., & Stein, C. (2018). A Scheduling Problem Motivated by Cybersecurity and Adaptive Machine Learning [Conference Poster]. https://www.osti.gov/biblio/1511904 Publication ID: 61936
-
Fekete, S.P., Huang, K., Mitchell, J.S.B., Parekh, O., Phillips, C., & Phillips, C. (2018). Geometric Hitting Set for Segments of Few Orientations. Theory of Computing Systems, 62(2), pp. 268-303. https://doi.org/10.1007/s00224-016-9744-7 Publication ID: 48400
-
Gharibian, S., Parekh, O., Ryan-Anderson, C., & Ryan-Anderson, C. (2017). Approximate Constraint Satisfaction in the Quantum Setting [Conference Poster]. https://www.osti.gov/biblio/1468312 Publication ID: 58222
-
Ryan-Anderson, C., Landahl, A., Parekh, O., Jacobson, N., Jiao, Y., & Jiao, Y. (2017). Quantum Algorithms Architecture and Error Correction [Presentation]. https://www.osti.gov/biblio/1468314 Publication ID: 58226
-
Aimone, J.B., Parekh, O., Severa, W., & Severa, W. (2017). Neural computing for scientific computing applications [Conference Poster]. ACM International Conference Proceeding Series. https://doi.org/10.1145/3183584.3183618 Publication ID: 54293
-
Aimone, J.B., Severa, W., Parekh, O., & Parekh, O. (2017). Neural Computing for Scientific Computing Applications: [Conference Poster]. https://doi.org/10.1145/3183584.3183618 Publication ID: 57522
-
Parekh, O., Ryan-Anderson, C., & Ryan-Anderson, C. (2017). Quantum Approximation Algorithms [Conference Poster]. https://www.osti.gov/biblio/1507515 Publication ID: 57433
-
Vineyard, C., Parekh, O., Phillips, C., Aimone, J.B., James, C., Vineyard, C., Vineyard, C., & Vineyard, C. (2017). Adaptive Learning Theory [Presentation]. https://www.osti.gov/biblio/1367220 Publication ID: 56382
-
Ryan-Anderson, C., Parekh, O., Jiao, Y., & Jiao, Y. (2017). Investigating the Quantum Approximate Optimization Algorithm?s Advantage over Classical Algorithms [Conference Poster]. https://www.osti.gov/biblio/1505903 Publication ID: 54937
-
Mkrtchyan, V., Parekh, O., Segev, D., Subramani, K., & Subramani, K. (2017). The Approximability of Partial Vertex Covers in Trees. SOFSEM 2017: Theory and Practice of Computer Science. https://doi.org/10.1007/978-3-319-51963-0_27 Publication ID: 42756
-
Severa, W., Parekh, O., James, C., Aimone, J.B., & Aimone, J.B. (2017). A combinatorial model for dentate gyrus sparse coding. Neural Computation, 29(1), pp. 94-117. https://doi.org/10.1162/NECO_a_00905 Publication ID: 51741
-
Severa, W., Carlson, K.D., Parekh, O., Vineyard, C., Aimone, J.B., & Aimone, J.B. (2016). Can we be formal in assessing the strengths and weaknesses of neural architectures? A case study using a spiking cross-correlation algorithm [Conference Poster]. https://www.osti.gov/biblio/1413431 Publication ID: 48137
-
Severa, W., Parekh, O., Carlson, K.D., James, C., Aimone, J.B., & Aimone, J.B. (2016). Spiking network algorithms for scientific computing [Conference Poster]. 2016 IEEE International Conference on Rebooting Computing, ICRC 2016 – Conference Proceedings. https://doi.org/10.1109/ICRC.2016.7738681 Publication ID: 47206
-
Severa, W., Carlson, K.D., Parekh, O., Vineyard, C., Aimone, J.B., & Aimone, J.B. (2016). Can we be formal in assessing the strengths and weaknesses of neural architectures? A case study using a spiking cross-correlation algorithm [Conference Poster]. https://www.osti.gov/biblio/1410236 Publication ID: 47882
-
Severa, W., Parekh, O., James, C., Aimone, J.B., & Aimone, J.B. (2016). Formalizing Function within the Hippocampal Trisynaptic Circuit [Conference Poster]. https://www.osti.gov/biblio/1408291 Publication ID: 47646
-
Marinella, M., Agarwal, S., Plimpton, S.J., Talin, A., El Gabaly Marquez, F., Fuller, E., Hughart, D.R., Parekh, O., Debenedictis, E.P., Goeke, R., Hsia, A., Aimone, J.B., James, C., & James, C. (2016). Emerging Technologies for the Acceleration of Neuromorphic Algorithms [Conference Poster]. https://www.osti.gov/biblio/1505271 Publication ID: 51075
-
Severa, W., Parekh, O., Carlson, K.D., James, C., Aimone, J.B., & Aimone, J.B. (2016). Spiking Network Algorithms for Scientific Computing [Conference Poster]. https://doi.org/10.1109/ICRC.2016.7738681 Publication ID: 51273
-
Parekh, O., Wendt, J.D., Shulenburger, L., Landahl, A., Moussa, J., Aidun, J., & Aidun, J. (2016). Benchmarking Near-‐term Adiabatic Quantum Computation [Presentation]. https://www.osti.gov/biblio/1368864 Publication ID: 50257
-
Parekh, O. (2016). Presentation for IARPA Quantum Enhanced Optimization Proposers’ Day [Presentation]. https://www.osti.gov/biblio/1368767 Publication ID: 50149
-
Marinella, M., Agarwal, S., Hughart, D.R., Plimpton, S.J., Parekh, O., Quach, T.-T., Debenedictis, E.P., Goeke, R., Hsia, A., Aimone, J.B., James, C., & James, C. (2016). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars [Conference Poster]. https://www.osti.gov/biblio/1365322 Publication ID: 49686
-
Agarwal, S., Parekh, O., Quach, T.-T., Debenedictis, E.P., James, C., Marinella, M., Aimone, J.B., & Aimone, J.B. (2016). Energy Scaling Advantages of Resistive Memory Crossbar Based Computation [Conference Poster]. https://www.osti.gov/biblio/1422171 Publication ID: 48959
-
Agarwal, S., Plimpton, S.J., Parekh, O., Hsia, A., Quach, T.-T., Hughart, D.R., Richter, I., Debenedictis, E.P., James, C., Aimone, J.B., Marinella, M., & Marinella, M. (2016). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars [Conference Poster]. https://www.osti.gov/biblio/1346466 Publication ID: 48730
-
Severa, W., Parekh, O., James, C., Aimone, J.B., & Aimone, J.B. (2016). A Combinatorial Model of Dentate Gyrus Sparse Coding and Pattern Separation [PowerPoint] [Conference Poster]. https://www.osti.gov/biblio/1346453 Publication ID: 48713
-
Severa, W., Parekh, O., James, C., Aimone, J.B., & Aimone, J.B. (2016). A Combinatorial Model of Dentate Gyrus Sparse Coding and Pattern Separation [Poster] [Conference Poster]. https://www.osti.gov/biblio/1345889 Publication ID: 48635
-
Maunz, P., Sterk, J., Lobser, D., Parekh, O., Ryan-Anderson, C., & Ryan-Anderson, C. (2016). Quantum Graph Analysis. https://doi.org/10.2172/1235806 Publication ID: 46733
-
Agarwal, S., Quach, T.-T., Parekh, O., Hsia, A.H., Debenedictis, E.P., James, C., Marinella, M., Aimone, J.B., & Aimone, J.B. (2016). Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding. Frontiers in Neuroscience, 9(JAN). https://doi.org/10.3389/fnins.2015.00484 Publication ID: 46410
-
Aimone, J.B., Parekh, O., Severa, W., & Severa, W. (2015). A Sparse Coding Model of the Hippocampal Dentate Gyrus [Conference Poster]. https://www.osti.gov/biblio/1337917 Publication ID: 42156
-
Marinella, M., Agarwal, S., Hughart, D.R., Plimpton, S.J., Parekh, O., Quach, T.-T., Debenedictis, E.P., Goeke, R., Hsia, A., Aimone, J.B., James, C., & James, C. (2015). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars [Conference Poster]. https://www.osti.gov/biblio/1336275 Publication ID: 41847
-
Agarwal, S., Parekh, O., Quach, T.-T., James, C., Aimone, J.B., Marinella, M., & Marinella, M. (2015). The energy scaling advantages of RRAM crossbars [Conference Poster]. 2015 4th Berkeley Symposium on Energy Efficient Electronic Systems, E3S 2015 – Proceedings. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84962050591&origin=inward Publication ID: 44154
-
Severa, W., Parekh, O., James, C., Aimone, J.B., & Aimone, J.B. (2015). Finding Triangles and Tracking Particles: Using Spiking Neural Networks for Pattern Identification Algorithms [Conference Poster]. https://www.osti.gov/biblio/1333797 Publication ID: 41734
-
Fekete, S., Huang, K., Mitchell, J., Parekh, O., Phillips, C., & Phillips, C. (2015). Geometric hitting set for segments of few orientations [Conference Poster]. https://doi.org/10.1007/978-3-319-28684-6_13 Publication ID: 46186
-
Agarwal, S., Parekh, O., Quach, T.-T., James, C., Aimone, J.B., Marinella, M., & Marinella, M. (2015). The Energy Scaling Advantages of RRAM Crossbars [Conference Poster]. https://doi.org/10.1109/E3S.2015.7336818 Publication ID: 45841
-
Parekh, O., Wendt, J.D., Shulenburger, L., Landahl, A., Moussa, J., Aidun, J., & Aidun, J. (2015). Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis. https://doi.org/10.2172/1459086 Publication ID: 43094
-
Caskurlu, B., Mkrtchyan, V., Parekh, O., Subramani, K., & Subramani, K. (2015). On Bipartite Graphs Trees and Their Partial Vertex Covers. https://www.osti.gov/biblio/1427215 Publication ID: 42757
-
Brost, R., Carroll, M., McLendon, W., Parekh, O., Strip, D., Rintoul, M., Woodbridge, D., & Woodbridge, D. (2015). Image-Based Algorithms – Semantic Graph Algorithms [Conference Poster]. https://www.osti.gov/biblio/1245931 Publication ID: 42743
-
Parekh, O. (2015). Benchmarking quantum annealing for complex network analysis on synthetic social networks [Presentation]. https://www.osti.gov/biblio/1245916 Publication ID: 42520
-
Carr, R., Parekh, O., & Parekh, O. (2015). A 2-edge-connected spanning subgraph problem [Conference Poster]. https://www.osti.gov/biblio/1240334 Publication ID: 42289
-
Parekh, O., Carr, R., & Carr, R. (2015). Unearthing planted solutions in quantum-annealing-inspired Ising problems [Conference Poster]. https://www.osti.gov/biblio/1504578 Publication ID: 42187
-
Fekete, S.P., Huang, K., Mitchell, J.S.B., Parekh, O., Phillips, C., & Phillips, C. (2015). Geometric hitting set for segments of few orientations [Conference Poster]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). https://doi.org/10.1007/978-3-319-28684-6_13 Publication ID: 45477
-
Parekh, O., Pritchard, D., & Pritchard, D. (2015). Generalized hypergraph matching via iterated packing and local ratio [Presentation]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). https://doi.org/10.1007/978-3-319-18263-6_18 Publication ID: 38403
-
Brost, R., Rintoul, M., McLendon, W., Strip, D.R., Parekh, O., Woodbridge, D., & Woodbridge, D. (2014). A computational framework for ontologically storing and analyzing very large overhead image sets [Conference Poster]. Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, BigSpatial 2014. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84920278649&origin=inward Publication ID: 38276
-
Brost, R., McLendon, W., Parekh, O., Rintoul, M., Strip, D., Woodbridge, D., & Woodbridge, D. (2014). A Computational Framework for Ontologically Storing and Analyzing Very Large Overhead Image Sets [Conference Poster]. https://doi.org/10.1145/2676536.2676537 Publication ID: 39289
-
Parekh, O. (2014). Benchmarking quantum annealing for community detection on synthetic social networks [Conference Poster]. https://www.osti.gov/biblio/1314564 Publication ID: 38374
-
Rintoul, M., Watson, J., McLendon, W., Parekh, O., & Parekh, O. (2014). Encoding and analyzing aerial imagery using geospatial semantic graphs. https://doi.org/10.2172/1204099 Publication ID: 37291
-
Brost, R., McLendon, W., Parekh, O., Rintoul, M., Woodbridge, D., & Woodbridge, D. (2014). Facility Search in Remote Sensing Data Using Geospatial Semantic Graphs [Conference]. https://www.osti.gov/biblio/1141268 Publication ID: 37273
-
Brost, R., McLendon, W., Parekh, O., Rintoul, M., Woodbridge, D., & Woodbridge, D. (2014). Temporal Analysis and Change Detection via Geospatial-Temporal Semantic Graphs [Conference]. https://www.osti.gov/biblio/1141170 Publication ID: 37272
-
Parekh, O., Aidun, J., Dubicka, I., Landahl, A., Shulenburger, L., Tigges, C., Wendt, J.D., & Wendt, J.D. (2013). Evaluating Near-Term Adiabatic Quantum Computing. https://doi.org/10.2172/1465512 Publication ID: 31686
-
Parekh, O., Phillips, C., Siirola, J.D., Watson, J., & Watson, J. (2013). PICO’s New Hierarchical Branch-and Bound System for Massively Parallel Integer Programming [Conference]. https://www.osti.gov/biblio/1106949 Publication ID: 35032
-
Phillips, C., Parekh, O., Siirola, J.D., Watson, J., & Watson, J. (2013). Hierarchical Parallel MIP [Conference]. https://www.osti.gov/biblio/1106679 Publication ID: 34984
-
Sterk, J., Blume-Kohout, R., Parekh, O., Maunz, P., Tigges, C., Blain, M., Colbaugh, R., Johnson, C., & Johnson, C. (2013). Quantum Graph Analysis with Trapped Yb Ion Qubits [Conference]. https://www.osti.gov/biblio/1145353 Publication ID: 32567
-
Parekh, O. (2012). Let Your Users Do the Ranking [Presentation]. https://www.osti.gov/biblio/1647932 Publication ID: 29809
-
Parekh, O., Phillips, C., Siirola, J.D., Watson, J., & Watson, J. (2012). PICO’s new hierarchical branch-and-bound system for massively parallel integer programming [Conference]. https://www.osti.gov/biblio/1061056 Publication ID: 29665
-
Gray, G., Hart, W., Hough, P., Parekh, O., Phillips, C., Siirola, J.D., Swiler, L., Watson, J., & Watson, J. (2012). Optimization of large-scale heterogeneous system-of-systems models. https://doi.org/10.2172/1034869 Publication ID: 26013
-
Carr, R., Parekh, O., & Parekh, O. (2011). A 2-edge-connected spanning subgraph problem [Conference]. https://www.osti.gov/biblio/1106816 Publication ID: 25024
-
Carr, R., Parekh, O., & Parekh, O. (2011). Approximating a capacitated 2-edge-connected spanning subgraph problem. Operations Research Letters. https://www.osti.gov/biblio/1106938 Publication ID: 24400
-
Carr, R., Parekh, O., & Parekh, O. (2011). Approximating a 2-edge-connected subgraph problem [Conference]. https://www.osti.gov/biblio/1106512 Publication ID: 24190
-
Carr, R., Phillips, C., Parekh, O., & Parekh, O. (2011). Towards Certficates for Integer Programming Computations [Conference]. https://www.osti.gov/biblio/1106366 Publication ID: 24188
-
Parekh, O. (2011). Iterative packing for demand matching and sparse packing [Conference]. https://www.osti.gov/biblio/1141090 Publication ID: 23212
-
Parekh, O. (2010). Iterative packing for demand matching and sparse packing [Conference]. https://www.osti.gov/biblio/1032921 Publication ID: 20820
-
Boman, E., Boman, E., Parekh, O., & Parekh, O. (2003). Combinatorial and algorithmic aspects of the null spaces of symmetric H-matrices [Conference]. https://www.osti.gov/biblio/993896 Publication ID: 2369