no. 1B
Analyse de la complexité des programmes, des algorithmes et des problèmes
Publications du Département de mathématiques (Lyon), no. 1B (1982), pp. 1-13. 
@article{PDML_1982___1B_1_0,
     author = {Chein, M.},
     title = {Analyse de la complexit\'e des programmes, des algorithmes et des probl\`emes},
     journal = {Publications du D\'epartement de math\'ematiques (Lyon)},
     pages = {1--13},
     publisher = {Universit\'e Claude Bernard - Lyon 1},
     number = {1B},
     year = {1982},
     mrnumber = {720723},
     language = {fr},
     url = {http://www.numdam.org/item/PDML_1982___1B_1_0/}
}
TY  - JOUR
AU  - Chein, M.
TI  - Analyse de la complexité des programmes, des algorithmes et des problèmes
JO  - Publications du Département de mathématiques (Lyon)
PY  - 1982
SP  - 1
EP  - 13
IS  - 1B
PB  - Université Claude Bernard - Lyon 1
UR  - http://www.numdam.org/item/PDML_1982___1B_1_0/
LA  - fr
ID  - PDML_1982___1B_1_0
ER  - 
%0 Journal Article
%A Chein, M.
%T Analyse de la complexité des programmes, des algorithmes et des problèmes
%J Publications du Département de mathématiques (Lyon)
%D 1982
%P 1-13
%N 1B
%I Université Claude Bernard - Lyon 1
%U http://www.numdam.org/item/PDML_1982___1B_1_0/
%G fr
%F PDML_1982___1B_1_0
Chein, M. Analyse de la complexité des programmes, des algorithmes et des problèmes. Publications du Département de mathématiques (Lyon), no. 1B (1982), pp. 1-13. http://www.numdam.org/item/PDML_1982___1B_1_0/

(1) Aho (A.V.), Hopcroft (J.E.), Ullman (J.D.) - The design and analysis of computer algorithms. - Addison-Wesly, 1974. | MR | Zbl

(2) Borodin (A.), Munro (I.) - The computational complexity of algebraic and numeric problems. - Elsevier Computing Science Library, 1975. | MR | Zbl

(3) Garey, Johnson (D.S.) - Computers and intractability. - W.H. Freeman and C°, 1979. | MR | Zbl

(4) Knuth (D.E.) - The Art of computer programming. - Addison-Wesley, 1968, Vol. 1. | MR | Zbl

Knuth (D.E.) - The Art of computer programming. - Addison-Wesley, 1969, Vol. 2. | Zbl

Knuth (D.E.) - The Art of computer programming. - Addison-Wesley, 1973. Vol. 3. | Zbl

(5) Chvatal - Determining the stability number of a graph. - S.I.A.M.,J. Comput. 6, 1977, p. 643-662. | MR | Zbl

(6) Cohen (J.) - A langage for inquiring about the run-time behaviour of programs. - Software, 7, 1977, p. 445-460. | Zbl

(7) Cohen (J.), Roth (M.) - On the implementation of Strassen's fast multiplication algorithm. - Acta Informatica, 6, 1978, p. 341-355. | MR | Zbl

(8) Cohen (J.), Zuckerman (C.) - Two languages for estimating program efficiency. - C.A.C.M., 17, 6, 1974, p. 301-308. | Zbl

(9) Diarmid (Mc) - Determining the chromatic number of a graph. - S.I.A.M., J. Comput, 1, 1979, p. 1-14. | MR | Zbl

(10) Karp (R.M.) - The probabilistic analysis of some combinatorial search algorithms, in J.F. Traub (Ed), Algorithms and Complexity, Academic Press, 1976 | MR | Zbl

(11) Knuth (D.E.) - The analysis of algorithms. - Actes, Congrès Inter. Math., 1970, t.3, p. 269-274. | MR | Zbl

(12) Knuth (D.E.) - An empirical study of fortran programs. - Software, 1, 1971, p. 105-133. | Zbl

(13) Knuth (D.E.) - Big micron and big omega and big theta. - Sigact news, Apr.-June 1976, p. 18-24.

(14) Knuth (D.E.), Moore (R.W.) - An analysis of Alpha-Beta pruning. - Artificial intelligence, 6, 1975, p. 293-326. | MR | Zbl

(15) Rivest (R.L.), Vuillemin (J.) - On recognizing graph properties from adjacency matrices. - Theor. Comput. Sc., 3, 1976, p. 371-384. | MR | Zbl

(16) Piwowarski (P.) - A nesting level complexity measure. - STGPLAN, Notices, 17, 9, 1982, p. 44-50

(17) Yao (Chi-Chih) - A lower bound to finding convex hulls. - J.A.C.M., 28, 4, 1981, p. 780-787. | MR | Zbl