Rahul Tripathi

According to our database1, Rahul Tripathi authored at least 19 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
User authentication system based on human exhaled breath physics.
CoRR, 2024

2020
Estimating Precisions for Multiple Binary Classifiers Under Limited Samples.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Applied Data Science Track, 2020

2019
Detecting Sensitive Content in Spoken Language.
Proceedings of the 2019 IEEE International Conference on Data Science and Advanced Analytics, 2019

2013
Identifying high betweenness centrality nodes in large social networks.
Soc. Netw. Anal. Min., 2013

2012
Mining Associations Using Directed Hypergraphs.
Proceedings of the Workshops Proceedings of the IEEE 28th International Conference on Data Engineering, 2012

2011
The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions.
IEEE Trans. Parallel Distributed Syst., 2011

On strategy improvement algorithms for simple stochastic games.
J. Discrete Algorithms, 2011

K-path centrality: a new centrality measure in social networks.
Proceedings of the 4th Workshop on Social Network Systems, 2011

2010
The 1-Versus-2 Queries Problem Revisited.
Theory Comput. Syst., 2010

2009
Linear connectivity problems in directed hypergraphs.
Theor. Comput. Sci., 2009

Hierarchical Unambiguity.
SIAM J. Comput., 2009

2008
Analysis and approximation of optimal co-scheduling on chip multiprocessors.
Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, 2008

2007
On the Power of Unambiguity in Alternating Machines.
Theory Comput. Syst., 2007

Complexity results in graph reconstruction.
Discret. Appl. Math., 2007

Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
LWPP and WPP are not uniformly gap-definable.
J. Comput. Syst. Sci., 2006

2005
Quantum and classical complexity classes: Separations, collapses, and closure properties.
Inf. Comput., 2005

2004
Degree Bounds on Polynomials and Relativization Theory.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Complexity of Linear Connectivity Problems in Directed Hypergraphs.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004


  Loading...