Mayur Thakur

	2009
19		Mayur Thakur, Rahul Tripathi: Linear connectivity problems in directed hypergraphs. Theor. Comput. Sci. 410(27-29): 2592-2618 (2009)
	2008
18		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)
	2007
17		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
16		Mark E. Snyder, Ravi Sundaram, Mayur Thakur: A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses. LCN 2007: 556-566
15		Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz: Algorithms for the Balanced Edge Partitioning Problem. WEA 2007: 311-323
14		Lane A. Hemaspaandra, Mayur Thakur: Query-monotonic Turing reductions. Theor. Comput. Sci. 383(2-3): 153-186 (2007)
13		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)
	2006
12		Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions CoRR abs/cs/0602001: (2006)
	2005
11		Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions. COCOON 2005: 895-904
10		Sreeram Ramakrishnan, Mayur Thakur: An SDS modeling approach for simulation-based control. Winter Simulation Conference 2005: 1473-1482
9		Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005)
	2004
8		Mayur Thakur, Rahul Tripathi: Complexity of Linear Connectivity Problems in Directed Hypergraphs. FSTTCS 2004: 481-493
7		Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518
6		Lane A. Hemaspaandra, Mayur Thakur: Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004)
	2003
5		Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386
4		Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs CoRR cs.CC/0306131: (2003)
3		Christopher M. Homan, Mayur Thakur: One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67(3): 608-622 (2003)
	2002
2		Lane A. Hemaspaandra, Mayur Thakur: Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229
1		Christopher M. Homan, Mayur Thakur: One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254

Coauthor Index

1	Christopher L. Barrett	[13] [17] [18]
2	Edith Hemaspaandra (Edith Spaan)	[4] [7]
3	Lane A. Hemaspaandra (Lane A. Hemachandra)	[2] [6] [11] [12] [14]
4	Christopher Homan (Christopher M. Homan)	[1] [3]
5	Harry B. Hunt III	[13] [17] [18]
6	Madhav V. Marathe	[13] [17] [18]
7	Sreeram Ramakrishnan	[10]
8	S. S. Ravi	[13] [17] [18]
9	Daniel J. Rosenkrantz	[13] [17] [18]
10	Ekaterina Smorodkina	[15]
11	Mark E. Snyder	[16]
12	Holger Spakowski	[4] [5] [7] [9]
13	Richard Edwin Stearns	[13] [17] [18]
14	Ravi Sundaram	[16]
15	Daniel R. Tauritz	[15]
16	Rahul Tripathi	[5] [8] [9] [19]

Colors in the list of coauthors