Samik Sengupta

	2008
18		Lance Fortnow, Aduri Pavan, Samik Sengupta: Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. 74(3): 358-363 (2008)
	2007
17		Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran: Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007)
	2006
16		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006)
	2005
15		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between disjoint NP-Pairs. Inf. Comput. 200(2): 247-267 (2005)
	2004
14		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. IEEE Conference on Computational Complexity 2004: 184-197
13		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2004: 42-53
12		Alan L. Selman, Samik Sengupta: Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. IEEE Conference on Computational Complexity 2004: 82-90
11		Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta: A Protocol for Serializing Unique Strategies. MFCS 2004: 660-672
10		Alan L. Selman, Samik Sengupta: Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy Electronic Colloquium on Computational Complexity (ECCC)(007): (2004)
9		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(019): (2004)
8		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15(1): 3-19 (2004)
7		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. SIAM J. Comput. 33(6): 1369-1416 (2004)
	2003
6		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2003: 313-332
5		Lance Fortnow, Aduri Pavan, Samik Sengupta: Proving SAT does not have Small Circuits with an Application to the Two. IEEE Conference on Computational Complexity 2003: 347-
4		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(011): (2003)
3		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(027): (2003)
	2002
2		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. COCOON 2002: 18-27
	1997
1		Rana Barua, Samik Sengupta: Architectures for Arithmetic over GF(2m). VLSI Design 1997: 465-469

Coauthor Index

1	Rana Barua	[1]
2	Jin-yi Cai	[2] [8]
3	Denis Charles	[2] [8]
4	Marcel Crâsmaru	[11]
5	Lance Fortnow	[5] [18]
6	Christian Glaßer (Christian Glasser)	[3] [4] [6] [7] [9] [11] [13] [14] [15] [16]
7	Aduri Pavan	[2] [5] [8] [9] [14] [16] [17] [18]
8	Kenneth W. Regan	[11]
9	Alan L. Selman	[3] [4] [6] [7] [9] [10] [12] [13] [14] [15] [16] [17]
10	N. V. Vinodchandran (N. Variyam Vinodchandran)	[17]
11	Liyu Zhang	[4] [6] [7]

Colors in the list of coauthors