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: Journal=J. Algorithms AND YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Monte-Carlo approximation algorithms for enumeration problems
Richard M. Karp
,
Michael Luby
,
Neal Madras
Journal of Algorithms
10
, 1989, pp. 429-448
The solution of some random
NP
-hard problems in polynomial expected time
M.E. Dyer
,
A.M. Frieze
Journal of Algorithms
10
, 1989, pp. 451-489
Linear broadcast routing
Ching-Tsun Chou
,
Inder S. Gopal
Journal of Algorithms
10
, 1989, pp. 490-517
On an efficient dynamic programming technique of F.F. Yao
Michelle L. Wachs
Journal of Algorithms
10
, 1989, pp. 518-530
On the distribution of running times of certain integer factoring algorithms
James Lee Hafner
,
Kevin S. McCurley
Journal of Algorithms
10
, 1989, pp. 531-556
Maximum matchings in general graphs through randomization
Michael O. Rabin
,
Vijay V. Vazirani
Journal of Algorithms
10
, 1989, pp. 557-567
The graph genus problem is
NP
-complete
Carsten Thomassen
Journal of Algorithms
10
, 1989, pp. 568-576
Gray code sequences of partitions
Carla D. Savage
Journal of Algorithms
10
, 1989, pp. 577-595
Seiten
<
1
2