Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) - Xiaotie Deng; Sanjeev Mahajan (STOC, 1991)

Server Problems and Resistive Spaces. - Xiaotie Deng; Sanjeev Mahajan (Inf. Process. Lett., 1991)

Regularity and Locality in K-terminal Graphs. - Sanjeev Mahajan; Joseph G. Peters (Discret. Appl. Math., 1994)

Derandomizing Semidefinite Programming Based Approximation Algorithms. - Sanjeev Mahajan; Ramesh Hariharan (FOCS, 1995)

Semidefinite Programming and its Applications to NP Problems - Roman Bacik; Sanjeev Mahajan (Electron. Colloquium Comput. Complex., 1995)

Vertex Partitioning Problems On Partial k-Trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (SWAT, 1996)

Approximate Hypergraph Coloring. - Pierre Kelsen; Sanjeev Mahajan; Ramesh Hariharan (SWAT, 1996)

Approximate Hypergraph Coloring. - Noga Alon; Pierre Kelsen; Sanjeev Mahajan; Ramesh Hariharan (Nord. J. Comput., 1996)

The generalized matching problem on partial $k$-trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (Contemporary Trends in Discrete Mathematics, 1997)

Using Amplification to Compute Majority with Small Majority Gates. - Arvind Gupta; Sanjeev Mahajan (Comput. Complex., 1997)

The Cost of Derandomization: Computability or Competitiveness. - Xiaotie Deng; Sanjeev Mahajan (SIAM J. Comput., 1997)

Derandomizing Approximation Algorithms Based on Semidefinite Programming. - Sanjeev Mahajan; H. Ramesh (SIAM J. Comput., 1999)

Solving Some Discrepancy Problems in NC. - Sanjeev Mahajan; Edgar A. Ramos; K. V. Subrahmanyam 001 (Algorithmica, 2001)