Architectures for Arithmetic over GF(2m). - Rana Barua; Samik Sengupta (VLSI Design, 1997)

Proving SAT does not have Small Circuits with an Application to the Two. - Lance Fortnow; Aduri Pavan; Samik Sengupta (CCC, 2003)

Reductions between Disjoint NP-Pairs - Christian Glaßer; Alan L. Selman; Samik Sengupta (Electron. Colloquium Comput. Complex., 2003)

Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. - Alan L. Selman; Samik Sengupta (CCC, 2004)

A Protocol for Serializing Unique Strategies. - Marcel Crâsmaru; Christian Glaßer; Kenneth W. Regan; Samik Sengupta (MFCS, 2004)

Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy - Alan L. Selman; Samik Sengupta (Electron. Colloquium Comput. Complex., 2004)

On Higher Arthur-Merlin Classes. - Jin-yi Cai; Denis Charles; Aduri Pavan; Samik Sengupta (Int. J. Found. Comput. Sci., 2004)

Disjoint NP-Pairs. - Christian Glaßer; Alan L. Selman; Samik Sengupta; Liyu Zhang 001 (SIAM J. Comput., 2004)

Properties of NP-Complete Sets. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Samik Sengupta (SIAM J. Comput., 2006)

Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. - Aduri Pavan; Alan L. Selman; Samik Sengupta; N. V. Vinodchandran (Theor. Comput. Sci., 2007)

Proving SAT does not have small circuits with an application to the two queries problem. - Lance Fortnow; Aduri Pavan; Samik Sengupta (J. Comput. Syst. Sci., 2008)