Sanjeev Mahajan

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