default search action
Rahul Tripathi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Mukesh Karunanethy, Rahul Tripathi, Mahesh V. Panchagnula, Raghunathan Rengaswamy:
User authentication system based on human exhaled breath physics. CoRR abs/2401.02447 (2024) - 2020
- [c14]Rahul Tripathi, Srinivasan Jagannathan, Balaji Dhamodharaswamy:
Estimating Precisions for Multiple Binary Classifiers Under Limited Samples. ECML/PKDD (4) 2020: 240-256
2010 – 2019
- 2019
- [c13]Rahul Tripathi, Balaji Dhamodharaswamy, Srinivasan Jagannathan, Abhishek Nandi:
Detecting Sensitive Content in Spoken Language. DSAA 2019: 374-381 - 2017
- [i3]Nicolas Kourtellis, Tharaka Alahakoon, Ramanuja Simha, Adriana Iamnitchi, Rahul Tripathi:
Identifying high betweenness centrality nodes in large social networks. CoRR abs/1702.06087 (2017) - 2013
- [j10]Nicolas Kourtellis, Tharaka Alahakoon, Ramanuja Simha
, Adriana Iamnitchi
Identifying high betweenness centrality nodes in large social networks. Soc. Netw. Anal. Min. 3(4): 899-914 (2013) - 2012
- [c12]Ramanuja Simha
Mining Associations Using Directed Hypergraphs. ICDE Workshops 2012: 190-197 - 2011
- [j9]Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar:
On strategy improvement algorithms for simple stochastic games. J. Discrete Algorithms 9(3): 263-278 (2011) - [j8]Yunlian Jiang, Kai Tian, Xipeng Shen
The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions. IEEE Trans. Parallel Distributed Syst. 22(7): 1192-1205 (2011) - [c11]Tharaka Alahakoon, Rahul Tripathi, Nicolas Kourtellis, Ramanuja Simha
K-path centrality: a new centrality measure in social networks. SNS 2011: 1 - 2010
- [j7]Rahul Tripathi:
The 1-Versus-2 Queries Problem Revisited. Theory Comput. Syst. 46(2): 193-221 (2010) - [c10]Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar:
On Strategy Improvement Algorithms for Simple Stochastic Games. CIAC 2010: 240-251
2000 – 2009
- 2009
- [j6]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. SIAM J. Comput. 38(5): 2079-2112 (2009) - [j5]Mayur Thakur, Rahul Tripathi:
Linear connectivity problems in directed hypergraphs. Theor. Comput. Sci. 410(27-29): 2592-2618 (2009) - 2008
- [c9]Yunlian Jiang, Xipeng Shen
Analysis and approximation of optimal co-scheduling on chip multiprocessors. PACT 2008: 220-229 - 2007
- [j4]Edith Hemaspaandra, Lane A. Hemaspaandra
Complexity results in graph reconstruction. Discret. Appl. Math. 155(2): 103-118 (2007) - [j3]Holger Spakowski, Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines. Theory Comput. Syst. 41(2): 291-326 (2007) - [c8]Rahul Tripathi:
The 1-Versus-2 Queries Problem Revisited. ISAAC 2007: 137-147 - [c7]Rahul Tripathi:
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. MFCS 2007: 548-558 - [i2]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. CoRR abs/cs/0702047 (2007) - 2006
- [j2]Holger Spakowski, Rahul Tripathi:
LWPP and WPP are not uniformly gap-definable. J. Comput. Syst. Sci. 72(4): 660-689 (2006) - [c6]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. MFCS 2006: 777-788 - 2005
- [j1]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005) - [c5]Holger Spakowski, Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines. FCT 2005: 125-136 - 2004
- [c4]Mayur Thakur, Rahul Tripathi:
Complexity of Linear Connectivity Problems in Directed Hypergraphs. FSTTCS 2004: 481-493 - [c3]Holger Spakowski, Rahul Tripathi:
Degree Bounds on Polynomials and Relativization Theory. IFIP TCS 2004: 97-110 - [c2]Edith Hemaspaandra, Lane A. Hemaspaandra
Complexity Results in Graph Reconstruction. MFCS 2004: 287-297 - [i1]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity Results in Graph Reconstruction. CoRR cs.CC/0410021 (2004) - 2003
- [c1]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386
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-04-24 23:10 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: