|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
|
|
Results
Found 14 publication records. Showing 14 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam |
Solving Some Discrepancy Problems in NC.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Mahajan, H. Ramesh |
Derandomizing Approximation Algorithms Based on Semidefinite Programming. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arvind Gupta, Sanjeev Mahajan |
Using Amplification to Compute Majority with Small Majority Gates. |
Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Sanjeev Mahajan |
The Cost of Derandomization: Computability or Competitiveness. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam |
Solving Some Discrepancy Problems in NC. |
FSTTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. |
Nord. J. Comput. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer |
Vertex Partitioning Problems On Partial k-Trees. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Roman Bacik, Sanjeev Mahajan |
Semidefinite Programming and its Applications to NP Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Roman Bacik, Sanjeev Mahajan |
Semidefinite Programming and its Applications to NP Problems. |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
| 1 | Sanjeev Mahajan, Joseph G. Peters |
Regularity and Locality in K-terminal Graphs. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Sanjeev Mahajan |
Server Problems and Resistive Spaces. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Sanjeev Mahajan |
Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) |
STOC |
1991 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #14 of 14 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")