Mayur Thakur

Ramanuja Simha, Rahul Tripathi, Mayur Thakur: Mining Associations Using Directed Hypergraphs. ICDE Workshops 2012: 190-197

Julia Albath, Mayur Thakur, Sanjay Madria: Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks. AINA 2010: 812-819

Mayur Thakur, Rahul Tripathi: Linear connectivity problems in directed hypergraphs. Theor. Comput. Sci. 410(27-29): 2592-2618 (2009)

Mark E. Snyder, Ravi Sundaram, Mayur Thakur: Preprocessing DNS Log Data for Effective Data Mining. ICC 2009: 1-5

David A. Cape, Bruce M. McMillin, Benjamin W. Passer, Mayur Thakur: Recursive Decomposition of Progress Graphs. SSIRI 2009: 23-31

Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Theor. Comput. Sci. 395(1): 132-133 (2008)

Lane A. Hemaspaandra, Mayur Thakur: Query-monotonic Turing reductions. Theor. Comput. Sci. 383(2-3): 153-186 (2007)

Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Predecessor existence problems for finite discrete dynamical systems. Theor. Comput. Sci. 386(1-2): 3-37 (2007)

Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Computational Aspects of Analyzing Social Network Dynamics. IJCAI 2007: 2268-2273

Mark E. Snyder, Ravi Sundaram, Mayur Thakur: A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses. LCN 2007: 556-566

Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz: Algorithms for the Balanced Edge Partitioning Problem. WEA 2007: 311-323

Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions. CoRR abs/cs/0602001 (2006)

Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005)

Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions. COCOON 2005: 895-904

Sreeram Ramakrishnan, Mayur Thakur: An SDS modeling approach for simulation-based control. Winter Simulation Conference 2005: 1473-1482

Lane A. Hemaspaandra, Mayur Thakur: Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004)

Mayur Thakur, Rahul Tripathi: Complexity of Linear Connectivity Problems in Directed Hypergraphs. FSTTCS 2004: 481-493

Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518

Christopher M. Homan, Mayur Thakur: One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67(3): 608-622 (2003)

Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386

Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. CoRR cs.CC/0306131 (2003)

Lane A. Hemaspaandra, Mayur Thakur: Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229

Christopher M. Homan, Mayur Thakur: One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254