default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTuhin Sahai
Person information
- affiliation: SRI International, Menlo Park, USA
- affiliation (former): Raytheon Technologies Research Center, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Amit Surana
, Abeynaya Gnanasekaran, Tuhin Sahai:
An efficient quantum algorithm for simulating polynomial dynamical systems. Quantum Inf. Process. 23(3): 105 (2024)- [i20]Tuhin Sahai, Abeynaya Gnanasekaran:
On the Emergence of Ergodic Dynamics in Unique Games. CoRR abs/2404.16024 (2024) - [i19]Xingzi Xu, Tuhin Sahai:
Accelerating Spectral Clustering on Quantum and Analog Platforms. CoRR abs/2408.08486 (2024) - 2023
- [c10]Abeynaya Gnanasekaran, Amit Surana, Tuhin Sahai:
Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems. QCE 2023: 66-75 - [i18]Abeynaya Gnanasekaran, Amit Surana, Tuhin Sahai:
Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems. CoRR abs/2303.02463 (2023) - [i17]Hassen Saïdi, Susmit Jha, Tuhin Sahai:
math-PVS: A Large Language Model Framework to Map Scientific Publications to PVS Theories. CoRR abs/2310.17064 (2023) - 2022
- [j10]Benjamin J. Zhang, Tuhin Sahai, Youssef M. Marzouk:
A Koopman framework for rare event simulation in stochastic differential equations. J. Comput. Phys. 456: 111025 (2022) - [c9]Hongyu Zhu, Stefan Klus, Tuhin Sahai:
A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs. CCTA 2022: 1202-1207 - [i16]Hongyu Zhu, Stefan Klus, Tuhin Sahai:
A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs. CoRR abs/2203.00004 (2022) - [i15]Amit Surana, Abeynaya Gnanasekaran, Tuhin Sahai:
Carleman linearization based efficient quantum algorithm for higher order polynomial differential equations. CoRR abs/2212.10775 (2022) - 2021
- [j9]Richa Varma, Chris Melville, Claudio Pinello, Tuhin Sahai:
Post Quantum Secure Command and Control of Mobile Agents Inserting Quantum-Resistant Encryption Schemes in the Secure Robot Operating System. Int. J. Semantic Comput. 15(3): 359-379 (2021) - [i14]Jiali Xing, David Fischer, Nitya Labh, Ryan Piersma, Benjamin C. Lee, Yu Amy Xia, Tuhin Sahai, Vahid Tarokh:
Talaria: A Framework for Simulation of Permissioned Blockchains for Logistics and Beyond. CoRR abs/2103.02260 (2021) - [i13]Benjamin J. Zhang, Tuhin Sahai, Youssef M. Marzouk:
Computing eigenfunctions of the multidimensional Ornstein-Uhlenbeck operator. CoRR abs/2110.09229 (2021) - 2020
- [c8]Tuhin Sahai, Anurag Mishra, Jose Miguel Pasini, Susmit Jha:
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms. AAAI 2020: 1627-1635 - [c7]Richa Varma, Chris Melville, Claudio Pinello, Tuhin Sahai:
Post Quantum Secure Command and Control of Mobile Agents Inserting quantum-resistant encryption schemes in the Secure Robot Operating System. IRC 2020: 33-40 - [i12]Tuhin Sahai:
Dynamical Systems Theory and Algorithms for NP-hard Problems. CoRR abs/2005.05052 (2020) - [i11]Richa Varma, Chris Melville, Claudio Pinello, Tuhin Sahai:
Post Quantum Secure Command and Control of Mobile Agents : Inserting quantum-resistant encryption schemes in the Secure Robot Operating System. CoRR abs/2009.07937 (2020)
2010 – 2019
- 2019
- [j8]Igor Mezic, Vladimir A. Fonoberov, Maria Fonoberova, Tuhin Sahai:
Spectral Complexity of Directed Graphs and Application to Structural Decomposition. Complex. 2019: 9610826:1-9610826:18 (2019) - [j7]Susmit Jha, Ashish Tiwari, Sanjit A. Seshia, Tuhin Sahai, Natarajan Shankar:
TeLEx: learning signal temporal logic from positive examples using tightness metric. Formal Methods Syst. Des. 54(3): 364-387 (2019) - [j6]Susmit Jha, Tuhin Sahai, Vasumathi Raman, Alessandro Pinto, Michael Francis:
Explaining AI Decisions Using Efficient Methods for Learning Sparse Boolean Formulae. J. Autom. Reason. 63(4): 1055-1075 (2019) - [i10]Tuhin Sahai, Anurag Mishra, Jose Miguel Pasini, Susmit Jha:
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms. CoRR abs/1910.13088 (2019) - 2017
- [c6]Susmit Jha, Vasumathi Raman, Alessandro Pinto, Tuhin Sahai, Michael Francis:
On Learning Sparse Boolean Formulae for Explaining AI Decisions. NFM 2017: 99-114 - [c5]Susmit Jha, Ashish Tiwari, Sanjit A. Seshia, Tuhin Sahai, Natarajan Shankar:
TeLEx: Passive STL Learning Using Only Positive Examples. RV 2017: 208-224 - [i9]Tuhin Sahai, Stefan Klus, Michael Dellnitz:
Continuous Relaxations for the Traveling Salesman Problem. CoRR abs/1702.05224 (2017) - 2015
- [i8]Tuhin Sahai, George Mathew, Amit Surana:
A Chaotic Dynamical System that Paints. CoRR abs/1504.02010 (2015) - 2014
- [i7]Stefan Klus, Tuhin Sahai:
A Spectral Assignment Approach for the Graph Isomorphism Problem. CoRR abs/1411.0969 (2014) - 2013
- [j5]Tuhin Sahai, Jose Miguel Pasini:
Uncertainty quantification in hybrid dynamical systems. J. Comput. Phys. 237: 411-427 (2013) - [c4]Jose Miguel Pasini, Tuhin Sahai:
Polynomial chaos based uncertainty quantification in Hamiltonian and chaotic systems. CDC 2013: 1113-1118 - [c3]Brendan J. Englot, Tuhin Sahai, Isaac Cohen:
Efficient tracking and pursuit of moving targets by heuristic solution of the traveling salesman problem. CDC 2013: 3433-3438 - 2012
- [j4]Tuhin Sahai, Alberto Speranzon, Andrzej Banaszuk:
Hearing the clusters of a graph: A distributed algorithm. Autom. 48(1): 15-24 (2012) - [c2]Tuhin Sahai, Jose Miguel Pasini:
Uncertainty quantification in hybrid dynamical systems. CDC 2012: 2183-2188 - [i6]Esha Sahai, Tuhin Sahai:
Mapping and Reducing the Brain on the Cloud. CoRR abs/1207.4978 (2012) - [i5]Tuhin Sahai, Stefan Klus, Michael Dellnitz:
A Traveling Salesman Learns Bayesian Networks. CoRR abs/1211.4888 (2012) - 2011
- [j3]Andrzej Banaszuk, Vladimir A. Fonoberov, Thomas A. Frewen, Marin Kobilarov, George Mathew, Igor Mezic, Alessandro Pinto, Tuhin Sahai, Harshad S. Sane, Alberto Speranzon, Amit Surana:
Scalable approach to uncertainty quantification and robust design of interconnected dynamical systems. Annu. Rev. Control. 35(1): 77-98 (2011) - [j2]Stefan Klus, Tuhin Sahai, Cong Liu, Michael Dellnitz:
An efficient algorithm for the parallel solution of high-dimensional differential equations. J. Comput. Appl. Math. 235(9): 3053-3062 (2011) - [i4]Andrzej Banaszuk, Vladimir A. Fonoberov, Thomas A. Frewen, Marin Kobilarov, George Mathew, Igor Mezic, Alessandro Pinto, Tuhin Sahai, Harshad S. Sane, Alberto Speranzon, Amit Surana:
Scalable Approach to Uncertainty Quantification and Robust Design of Interconnected Dynamical Systems. CoRR abs/1103.0733 (2011) - [i3]Amit Surana, Tuhin Sahai, Andrzej Banaszuk:
Iterative Methods for Scalable Uncertainty Quantification in Complex Networks. CoRR abs/1110.2435 (2011) - 2010
- [c1]Tuhin Sahai, Alberto Speranzon, Andrzej Banaszuk:
Wave equation based algorithm for distributed eigenvector computation. CDC 2010: 7308-7315 - [i2]Stefan Klus, Tuhin Sahai, Cong Liu, Michael Dellnitz:
An efficient algorithm for the parallel solution of high-dimensional differential equations. CoRR abs/1003.5238 (2010)
2000 – 2009
- 2009
- [j1]Tuhin Sahai, Alexander Vladimirsky:
Numerical Methods for Approximating Invariant Manifolds of Delayed Systems. SIAM J. Appl. Dyn. Syst. 8(3): 1116-1135 (2009) - [i1]Tuhin Sahai, Alberto Speranzon, Andrzej Banaszuk:
Hearing the clusters in a graph: A distributed algorithm. CoRR abs/0911.4729 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
