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
[1]
Hilfe
Suche: Author="Chari, Suresh"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms via approximations of probability distributions
Suresh Chari
,
Pankaj Rohatgi
,
Aravind Srinivasan
Journal of Computer and System Sciences
61
(1), 2000, pp. 81-107
On completeness under random reductions
Suresh Chari
,
Pankaj Rohatgi
Journal of Computer and System Sciences
53
(3), 1996, pp. 545-555
Randomness-optimal unique element isolation with applications to perfect matching and related problems
Suresh Chari
,
Pankaj Rohatgi
,
Aravind Srinivasan
SIAM Journal on Computing
24
(5), 1995, October, pp. 1036-1050
Improved algorithms via approximations of probability distributions
Suresh Chari
,
Pankaj Rohatgi
,
Aravind Srinivasan
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 584-592
On the intellectual terrain around
NP
Juris Hartmanis
,
Suresh Chari
Lecture Notes in Computer Science
778
, 1994, pp. 1-11
Randomness-optimal unique element isolation, with applications to perfect matching and related problems
Suresh Chari
,
Pankaj Rohatgi
,
Aravind Srinivasan
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 458-467
On completeness under random reductions
Suresh Chari
,
Pankaj Rohatgi
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 176-184
On the complexity of incremental computation
Suresh Chari
,
Desh Ranjan
,
Pankaj Rohatgi
Lecture Notes in Computer Science
629
, 1992, pp. 172-180