Sanjeev Mahajan

Publication Activity (10 Years)

Years Active: 1991-2001
Publications (10 Years): 0

Publications

Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. Algorithmica 29 (3) (2001)
Sanjeev Mahajan, H. Ramesh
Derandomizing Approximation Algorithms Based on Semidefinite Programming. SIAM J. Comput. 28 (5) (1999)
Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. FSTTCS (1997)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics (1997)
Arvind Gupta, Sanjeev Mahajan
Using Amplification to Compute Majority with Small Majority Gates. Comput. Complex. 6 (1) (1997)
Xiaotie Deng, Sanjeev Mahajan
The Cost of Derandomization: Computability or Competitiveness. SIAM J. Comput. 26 (3) (1997)
Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
Approximate Hypergraph Coloring. Nord. J. Comput. 3 (4) (1996)
Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
Approximate Hypergraph Coloring. SWAT (1996)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
Vertex Partitioning Problems On Partial k-Trees. SWAT (1996)
Roman Bacik, Sanjeev Mahajan
Semidefinite Programming and its Applications to NP Problems Electron. Colloquium Comput. Complex. 2 (11) (1995)
Sanjeev Mahajan, Ramesh Hariharan
Derandomizing Semidefinite Programming Based Approximation Algorithms. FOCS (1995)
Roman Bacik, Sanjeev Mahajan
Semidefinite Programming and its Applications to NP Problems. COCOON (1995)
Sanjeev Mahajan, Joseph G. Peters
Regularity and Locality in K-terminal Graphs. Discret. Appl. Math. 54 (2-3) (1994)
Xiaotie Deng, Sanjeev Mahajan
Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) STOC (1991)
Xiaotie Deng, Sanjeev Mahajan
Server Problems and Resistive Spaces. Inf. Process. Lett. 37 (4) (1991)