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
Hilfe
Suche: Author="Natarajan, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation techniques for average completion time scheduling
C. Chekuri
,
R. Motwani
,
B. Natarajan
,
C. Stein
SIAM Journal on Computing
31
(1), 2001, pp. 146-166
On learning functions from noise-free and noisy samples via Occam's razor
B. Natarajan
SIAM Journal on Computing
29
(3), 1999-2000, pp. 712-727
Approximation techniques for average completion time scheduling
C. Chekuri
,
R. Motwani
,
B. Natarajan
,
C. Stein
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 609-618
Sparse approximate solutions to linear systems
B.K. Natarajan
SIAM Journal on Computing
24
(2), 1995, pp. 227-234
Condition-sensitive computations of approximate fixed points
B.K. Natarajan
Journal of Complexity
9
(3), 1993, pp. 406-411
Probably approximate learning over classes of distributions
B.K. Natarajan
SIAM Journal on Computing
21
(3), 1992, June, pp. 438-449
Probably approximate learning of sets and functiosn
B.K. Natarajan
SIAM Journal on Computing
20
(2), 1991, April, pp. 328-351
On learning boolean functions
B.K. Natarajan
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 296-304
An algorithmic approach to the automated design of parts orienters
B.K. Natarajan
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 132-142