Communications of the ACM
Communications of the ACM
Solution of polynomial equation by Bairstow-Hitchcock method
Communications of the ACM
Communications of the ACM
Algorithms: Bessel function I, series expansion
Communications of the ACM
Algorithms: evaluation of the Chebyshev polynomial Tn(X) by recursion
Communications of the ACM
Algorithms: evaluation of the Hermite polynomial Hn(X) by recursion
Communications of the ACM
Algorithms: evaluation of the Laguerre polynomial Ln(X) by recursion
Communications of the ACM
Algorithms: evaluation of the Legendre polynomial Pn(X) by recursion
Communications of the ACM
Algorithms 13: complex exponential integral
Communications of the ACM
Algorithms: Euclidean algorithm
Communications of the ACM
Algorithms: Bessel function I, asymptotic expansion
Communications of the ACM
Computer programming with a dynamic algebra
Computer programming with a dynamic algebra
Machine-independent computer programming
Machine-independent computer programming
A Review and Evaluation of Software Science
ACM Computing Surveys (CSUR)
Models and Measurements for Quality Assessment of Software
ACM Computing Surveys (CSUR)
An algorithmic approach to the detection and prevention of plagiarism
ACM SIGCSE Bulletin
Some results from an empirical study of computer software
ICSE '79 Proceedings of the 4th international conference on Software engineering
Modularization in the pilot compiler and its effect on the length
ACM '76 Proceedings of the 1976 annual conference
ACM '73 Proceedings of the ACM annual conference
M.H. Halstead's Software Science - a critical examination
ICSE '82 Proceedings of the 6th international conference on Software engineering
On the specification and quantification of software performance objectives
ACM '77 Proceedings of the 1977 annual conference
Conservation of software science parameters across modularization
ACM '77 Proceedings of the 1977 annual conference
Toward a theoretical basis for estimating programming effort
ACM '75 Proceedings of the 1975 annual conference
Experimental validation of a structural property of fortran algorithms
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A measurement of structure for unstructured programming languages
Proceedings of the software quality assurance workshop on Functional and performance issues
Psychological complexity of computer programs: an experimental methodology
ACM SIGPLAN Notices
The automatic measurement of the relative merits of student programs
ACM SIGPLAN Notices
Measuring commercial PL/I programs using Halstead's criteria
ACM SIGPLAN Notices
Invariant properties of algorithms
ACM SIGPLAN Notices - Abstracts in programming language-related research
Impurities found in algorithm implementations
ACM SIGPLAN Notices
Measurements of program similarity in identical task environments
ACM SIGPLAN Notices
Language level, a missing concept in information theory
ACM SIGMETRICS Performance Evaluation Review
An experimental determination of the "purity" of a trivial algorithm
ACM SIGMETRICS Performance Evaluation Review
A recent approach to the study of algorithms
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Language selection for applications
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
An experiment comparing Fortran programming times with the software physics hypothesis
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Analysis of a metamodel to estimate complexity of using a domain-specific language
Proceedings of the 10th Workshop on Domain-Specific Modeling
A critical examination of software science
Journal of Systems and Software
DeSoCoRe: detecting source code re-use across programming languages
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Demonstration Session
| Hi-index | 0.00 |
In this preliminary report, a hypothesis is developed to the effect that algorithms, considered as distrillations of thought, may possess a general structure which obeys physical laws. Testing the hypothesis against measurements of published algorithms does not disprove it.