Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Complexité programme")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 500

  • Page / 20

Selection :

  • and

A study in dimensions of psychological complexity of programsCHAUDHARY, B. D; SAHASRABUDDHE, H. V.International journal of man-machine studies. 1985, Vol 23, Num 2, pp 113-133, issn 0020-7373Article

A note on the complexity of program evaluationIBARRA, O. H; LENINGER, B. S; ROSIER, L. E et al.Mathematical systems theory. 1984, Vol 17, Num 2, pp 85-96, issn 0025-5661Article

Determinants of program repair maintenance requirementsGREMILLION, L. L.Communications of the ACM. 1984, Vol 27, Num 8, pp 826-832, issn 0001-0782Article

The PEEK measurement programELSHOFF, J. L.Performance evaluation review. 1984, Vol 12, Num 4, pp 40-53, issn 0163-5999Article

An approach to understanding program comprehensibility using spatial complexity, concept assignment and typographical styleMOHAN, Andrew; GOLD, Nicolas; LAYZELL, Paul et al.International Conference on Software Maintenance. 2004, isbn 0-7695-2213-0, p. 530Conference Paper

A complexity measure based on selection and nestingHUISHENG GONG; SCHMIDT, M.Performance evaluation review. 1985, Vol 13, Num 1, pp 14-19, issn 0163-5999Article

On generalizations of semi-terms of particularly simple formBAAZ, Matthias; MOSER, Georg.Lecture notes in computer science. 2002, pp 382-396, issn 0302-9743, isbn 3-540-44240-5, 15 p.Conference Paper

Representable P. Martin-Löf testsSTAIGER, L.Kybernetika. 1985, Vol 21, Num 3, pp 235-243, issn 0023-5954Article

A complexity measure derivation method based on analysis of complexity factors in program structureTAKAHASHI, M; NAGASE, A; KURODA, K et al.Review of the electrical communication laboratories. 1984, Vol 32, Num 1, pp 41-48, issn 0029-067XArticle

Fixed-parameter complexity of semantics for logic programsLONC, Zbigniew; TRUSZCZYNSKI, Miroslaw.Lecture notes in computer science. 2001, pp 197-211, issn 0302-9743, isbn 3-540-42935-2Conference Paper

Metrics to measure the complexity of partial programsREYNOLDS, R. G.The Journal of systems and software. 1984, Vol 4, Num 1, pp 75-91, issn 0164-1212Article

Transformation de la récursivité en itération et complexité = Transformation of recursive procedure into iterative ones and complexityDJOSSOU, Koffi.1984, Non paginé [140 f.]Thesis

Complexity measures for assembly language programsBLAINE, J. D; KEMMERER, R. A.The Journal of systems and software. 1985, Vol 5, Num 3, pp 229-245, issn 0164-1212Article

An initial approach to assessing program comprehensibility using spatial complexity, number of concepts and typographical styleMOHAN, Andrew; GOLD, Nicolas; LAYZELL, Paul et al.Working conference on reverse engineering. 2004, pp 246-255, isbn 0-7695-2243-2, 1Vol, 10 p.Conference Paper

Axiomatizing software test data adequacyWEYUKER, E. J.IEEE transactions on software engineering. 1986, Vol 12, Num 12, pp 1128-1138, issn 0098-5589Article

A simple measure of software complexityEJIOGU, L. O.Performance evaluation review. 1985, Vol 13, Num 1, pp 33-47, issn 0163-5999Article

Renaming a set of non-horn clausesNIE, X; GUO, Q.Lecture notes in computer science. 1997, pp 600-608, issn 0302-9743, isbn 3-540-63614-5Conference Paper

New conditions for the existence of least generalizations under relative subsumptionYAMAMOTO, A.Lecture notes in computer science. 2000, pp 253-264, issn 0302-9743, isbn 3-540-67795-XConference Paper

Composing general logic programsBROGI, A; CONTIERO, S; TURINI, F et al.Lecture notes in computer science. 1997, pp 273-288, issn 0302-9743, isbn 3-540-63255-7Conference Paper

A comparison of a new measure of logical complexity of programs with the halstead and McCabe methodsSITHARAMA IYENGAR, S; FULLER, J.Kybernetes. 1986, Vol 15, Num 2, pp 103-110, issn 0368-492XArticle

A composed program complexity measure = Mesure de complexité d'un programme composéMAES, R.Angewandte Informatik. 1985, Vol 27, Num 1, pp 9-16, issn 0013-5704Article

Operating system models in a concurrent Pascal environment: Complexity and performance considerationsPASHTAN, A.IEEE transactions on software engineering. 1985, Vol 11, Num 1, pp 136-141, issn 0098-5589Article

Computation of logical effort in high level languagesCATER, S. C; SITHARAMA IYENGAR, S; FULLER, J et al.Computer languages. 1984, Vol 9, Num 3-4, pp 133-148, issn 0096-0551Article

Meta-complexity theorems : Talk AbstractMCALLESTER, David.Lecture notes in computer science. 2000, pp 13-17, issn 0302-9743, isbn 3-540-41053-8Conference Paper

Fast rewriting of symmetric polynomialsGÖBEL, M.Lecture notes in computer science. 1999, pp 371-381, issn 0302-9743, isbn 3-540-66201-4Conference Paper

  • Page / 20