Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Mahajan, Sanjeev"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Derandomizing approximation algorithms based on semidefinite programming
Sanjeev Mahajan
,
H. Ramesh
SIAM Journal on Computing
28
(5), 1999, pp. 1641-1663
The cost of derandomization: Computability or competitiveness
Xiaotie Deng
,
Sanjeev Mahajan
SIAM Journal on Computing
26
(3), 1997, pp. 786-802
Solving some discrepancy problems in
NC
Sanjeev Mahajan
,
Edgar A. Ramos
,
K.V. Subrahmanyam
Lecture Notes in Computer Science
1346
, 1997, pp. 22-36
Vertex partitioning problems on partial
k
-trees
Arvind Gupta
,
Damon Kaller
,
Sanjeev Mahajan
,
Tom Shermer
Lecture Notes in Computer Science
1097
, 1996, pp. 161-172
Approximate hypergraph coloring
Pierre Kelsen
,
Sanjeev Mahajan
,
Hariharan Ramesh
Lecture Notes in Computer Science
1097
, 1996, pp. 41-52
Semidefinite programming and its applications to NP problems
Roman Bac̑ík
,
Sanjeev Mahajan
Lecture Notes in Computer Science
959
, 1995, pp. 566-575
Derandomizing semidefinite programming based approximation algorithms
Sanjeev Mahajan
,
H. Ramesh
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 162-169
Regularity and locality in
k
-terminal graphs
Sanjeev Mahajan
,
Joseph G. Peters
Discrete Applied Mathematics
54
, 1994, pp. 229-250
Infinite games: Randomization, computability, and applications to online problems
Xiaotie Deng
,
Sanjeev Mahajan
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 289-298
Server problems and resistive spaces
Xiaotie Deng
,
Sanjeev Mahajan
Information Processing Letters
37
, 1991, pp. 193-196