Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-8  
 Basket 
Solving some discrepancy problems in NC
Authors: Mahajan, Sanjeev; Ramos, Edgar A.; Subrahmanyam, K. V.
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1997
Title of Proceedings: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97)
Start Page: 22
End Page: 36
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517927.0
The Cost of Derandomization: Computability or Competitiveness
Authors: Deng, Xiaotie; Mahajan, Sanjeev
Date of Publication (YYYY-MM-DD): 1997
Title of Journal: SIAM Journal on Computing
Volume: 26
Issue / Number: 3
Start Page: 786
End Page: 802
Document Type: Article
ID: 517891.0
Using amplification to compute majority with small majority gates
Authors: Gupta, Arvind; Mahajan, Sanjeev
Date of Publication (YYYY-MM-DD): 1997
Title of Journal: Computational Complexity
Volume: 6
Issue / Number: 1
Start Page: 46
End Page: 63
Document Type: Article
ID: 517918.0
Approximate hypergraph coloring
Authors: Kelsen, Pierre; Mahajan, Sanjeev; Hariharan, Ramesh
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory
Start Page: 41
End Page: 52
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517839.0
Coloring 2-colorable hypergraphs with a sublinear number of colors
Authors: Hariharan, Ramesh; Kelsen, Pierre; Mahajan, Sanjeev
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Scandinavian Workshop on Algorithm Theory (SWAT96)
Start Page: 41
End Page: 52
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517852.0
Vertex partitioning problems on partial k-trees
Authors: Gupta, Arvind; Kaller, Damon; Mahajan, Sanjeev; Shermer, Thomas C.
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory
Start Page: 161
End Page: 172
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517886.0
Derandomizing semidefinite programming based approximation algorithms
Authors: Hariharan, Ramesh; Mahajan, Sanjeev
Place of Publication: -
Publisher: -
Date of Publication (YYYY-MM-DD): 1995
Title of Proceedings: 36th IEEE Symposium on Foundations of Computer Science
Start Page: 162
End Page: 16
Document Type: Conference-Paper
ID: 517767.0
Semidefinite programming and its applications to NP problems
Authors: Bacik, Roman; Mahajan, Sanjeev
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1995
Title of Proceedings: Computing and Combinatorics: 1st Annual International Conference (COCOON95)
Start Page: 566
End Page: 575
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517880.0
Entries: 1-8  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.