default search action
Maurice H. Halstead
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1980
- [j15]Maurice H. Halstead, Victor B. Schneider:
Self-Assessment Procedure VII: A Self-Assessment Precedure Dealing with Software Science. Commun. ACM 23(8): 475-480 (1980)
1970 – 1979
- 1979
- [j14]Maurice H. Halstead:
Advances in Software Science. Adv. Comput. 18: 119-172 (1979) - [j13]Maurice H. Halstead:
Guest Editorial on Software Science. IEEE Trans. Software Eng. 5(2): 74-75 (1979) - [j12]Stuart H. Zweben, Maurice H. Halstead:
The Frequency Distribution of Operators in PL/I Programs. IEEE Trans. Software Eng. 5(2): 91-95 (1979) - [j11]Douglas Comer, Maurice H. Halstead:
A Simple Experiment in Top-Down Design. IEEE Trans. Software Eng. 5(2): 105-109 (1979) - 1978
- [c9]Maurice H. Halstead:
Management Prediction - Can Software Science Help? COMPSAC 1978: 126-128 - 1976
- [j10]Samuel D. Conte, Maurice H. Halstead:
The Technology of Computer Center Management: A Proposed Course for Graduate Professional Programs in Computer Science or in Information Systems. Commun. ACM 19(7): 369-370 (1976) - [c8]R. D. Gordon, Maurice H. Halstead:
An experiment comparing Fortran programming times with the software physics hypothesis. AFIPS National Computer Conference 1976: 935-937 - 1975
- [c7]Maurice H. Halstead:
Toward a theoretical basis for estimating programming effort. ACM Annual Conference 1975: 222-224 - 1974
- [j9]Neodet Bulut, Maurice H. Halstead:
Impurities found in algorithm implementations. ACM SIGPLAN Notices 9(3): 9-12 (1974) - [c6]Necdet Bulut, Maurice H. Halstead, Rudolf Bayer:
Experimental validation of a structural property of Fortran algorithms. ACM Annual Conference (1) 1974: 207-211 - [c5]Barron C. Housel, Maurice H. Halstead:
A methodology for machine language decompilation. ACM Annual Conference (1) 1974: 254-260 - 1973
- [j8]Maurice H. Halstead:
Language level, a missing concept in information theory. SIGMETRICS Perform. Evaluation Rev. 2(1): 7-9 (1973) - [j7]Maurice H. Halstead:
An experimental determination of the "purity" of a trivial algorithm. SIGMETRICS Perform. Evaluation Rev. 2(1): 10-15 (1973) - [j6]Necdet Bulut, Maurice H. Halstead:
Invariant properties of algorithms. ACM SIGPLAN Notices 8(6): 12-13 (1973) - [c4]Maurice H. Halstead, Rudolf Bayer:
Algorithm dynamics. ACM Annual Conference 1973: 126-135 - [c3]Maurice H. Halstead:
Language selection for applications. AFIPS National Computer Conference 1973: 211-214 - 1972
- [j5]Arthur E. Oldehoeft, Maurice H. Halstead:
Maximum Computing Power and Cost Factors in the Centralization Problem. Commun. ACM 15(2): 94-96 (1972) - [j4]Maurice H. Halstead:
Natural laws controlling algorithm structure? ACM SIGPLAN Notices 7(2): 19-26 (1972) - 1971
- [e1]Maurice H. Halstead:
Proceedings of the SIGPLAN Symposium on Languages for System Implementation, Lafayette, Indiana, USA, October 25-26, 1971. ACM 1971, ISBN 978-1-4503-7887-1 [contents]
1960 – 1969
- 1967
- [c2]Maurice H. Halstead:
Machine-independence and third-generation computers. AFIPS Fall Joint Computing Conference 1967: 587-592 - [c1]Maurice H. Halstead, Gordon T. Uber, K. R. Gielow:
An algorithmic search procedure for program generation. AFIPS Spring Joint Computing Conference 1967: 657-662 - 1963
- [j3]Maurice H. Halstead:
NELIAC. Commun. ACM 6(3): 91-92 (1963) - 1962
- [j2]Maurice H. Halstead:
Certification of Algorithm 78: Ratfact. Commun. ACM 5(3): 168 (1962) - 1960
- [j1]Harry D. Huskey, Maurice H. Halstead, R. McArthur:
NELIAC - dialect of ALGOL. Commun. ACM 3(8): 463-468 (1960)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: