Sanjeev Mahajan

According to our database, Sanjeev Mahajan authored at least 13 papers between 1991 and 2001.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2001

Solving Some Discrepancy Problems in NC.

Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam

Algorithmica, 2001

1999

Derandomizing Approximation Algorithms Based on Semidefinite Programming.

Sanjeev Mahajan, H. Ramesh

SIAM J. Comput., 1999

1997

The Cost of Derandomization: Computability or Competitiveness.

Xiaotie Deng, Sanjeev Mahajan

SIAM J. Comput., 1997

Using Amplification to Compute Majority with Small Majority Gates.

Arvind Gupta, Sanjeev Mahajan

Comput. Complex., 1997

The generalized matching problem on partial $k$-trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Approximate Hypergraph Coloring.

Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan

Nord. J. Comput., 1996

Approximate Hypergraph Coloring.

Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan

Proceedings of the Algorithm Theory, 1996

Vertex Partitioning Problems On Partial k-Trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Algorithm Theory, 1996

1995

Semidefinite Programming and its Applications to NP Problems

Roman Bacik, Sanjeev Mahajan

Electron. Colloquium Comput. Complex., 1995

Derandomizing Semidefinite Programming Based Approximation Algorithms.

Sanjeev Mahajan, Ramesh Hariharan

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Regularity and Locality in K-terminal Graphs.

Sanjeev Mahajan, Joseph G. Peters

Discret. Appl. Math., 1994

1991

Server Problems and Resistive Spaces.

Xiaotie Deng, Sanjeev Mahajan

Inf. Process. Lett., 1991

Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version)

Xiaotie Deng, Sanjeev Mahajan

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991