The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sanjeev Mahajan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roman Bacik, Sanjeev Mahajan
    Semidefinite Programming and its Applications to NP Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:566-575 [Conf]
  2. Sanjeev Mahajan, Ramesh Hariharan
    Derandomizing Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:162-169 [Conf]
  3. Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
    Solving Some Discrepancy Problems in NC. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:22-36 [Conf]
  4. Xiaotie Deng, Sanjeev Mahajan
    Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:289-298 [Conf]
  5. Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
    Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:41-52 [Conf]
  6. Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
    Vertex Partitioning Problems On Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:161-172 [Conf]
  7. Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
    Solving Some Discrepancy Problems in NC. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:371-395 [Journal]
  8. Arvind Gupta, Sanjeev Mahajan
    Using Amplification to Compute Majority with Small Majority Gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:1, pp:46-63 [Journal]
  9. Sanjeev Mahajan, Joseph G. Peters
    Regularity and Locality in K-terminal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:229-250 [Journal]
  10. Roman Bacik, Sanjeev Mahajan
    Semidefinite Programming and its Applications to NP Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:11, pp:- [Journal]
  11. Xiaotie Deng, Sanjeev Mahajan
    Server Problems and Resistive Spaces. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:193-196 [Journal]
  12. Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
    Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:425-439 [Journal]
  13. Xiaotie Deng, Sanjeev Mahajan
    The Cost of Derandomization: Computability or Competitiveness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:786-802 [Journal]
  14. Sanjeev Mahajan, H. Ramesh
    Derandomizing Approximation Algorithms Based on Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1641-1663 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002