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="Santha, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average-case analysis of the merging algorithm of Hwang and Lin
W. Fernandez de la Vega
,
A.M. Frieze
,
M. Santha
Algorithmica
22
(4), 1998, pp. 483-489
A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments
E. Bampis
,
M. El Haddad
,
Y. Manoussakis
,
M. Santha
Journal of Algorithms
19
(3), 1995, pp. 432-440
A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments
E. Bampis
,
M. El Haddad
,
Y. Manoussakis
,
M. Santha
Lecture Notes in Computer Science
694
, 1993, pp. 553-560
Relativized Arthur-Merlin versus Merlin-Arthur games
M. Santha
Lecture Notes in Computer Science
287
, 1987, pp. 435-442
Generating quasi-random sequences from semi-random sources
M. Santha
,
U.V. Vazirani
Journal of Computer and System Sciences
33
(1), 1986, August, pp. 75-87
Generating quasi-random sequences from slightly-random sources
M. Santha
,
U.V. Vazirani
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 434-440