Subscribe
(Full Service)
Register
(Limited Service,
Free
)
Login
Search:
The ACM Digital Library
The Guide
Feedback
On programming of arithmetic operations
Full text
Pdf
(699 KB)
Source
Communications of the ACM
archive
Volume 1 , Issue 8 (August 1958)
table of contents
Pages: 3 - 6
Year of Publication: 1958
ISSN:0001-0782
Author
A. P. Ershov
Moscow Univ., Moscow, USSR
Publisher
ACM
New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5, Downloads (12 Months): 55, Citation Count: 28
Additional Information:
abstract
cited by
Tools and Actions:
Request Permissions
Review this Article
Save this Article to a Binder
Display Formats:
BibTeX
EndNote
ACM Ref
DOI Bookmark:
Use this link to bookmark this Article:
http://doi.acm.org/10.1145/368892.368907
What is a DOI?
ABSTRACT
The concepts used without explanation are taken from [1].
CITED BY
28
A. V. Aho , S. C. Johnson , J. D. Ullman, Code-generation for machines with multiregister operations, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.21-28, January 17-19, 1977, Los Angeles, California
William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968
Bhaskaram Prabhala , Ravi Sethi, Efficient Computation of Expressions with Common Subexpressions, Journal of the ACM (JACM), v.27 n.1, p.146-163, Jan. 1980
S. C. Johnson, A portable compiler: theory and practice, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-104, January 23-25, 1978, Tucson, Arizona
Bhaskaram Prabhala , Ravi Sethi, Efficient computation of expressions with common subexpressions, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.222-230, January 23-25, 1978, Tucson, Arizona
John W. Carr, III , Alan J. Perlis , James E. Robertson , Norman R. Scott, A visit to computation centers in the Soviet Union, Communications of the ACM, v.2 n.6, p.8-20, June 1959
Mahadevan Ganapathi , Charles N. Fischer , John L. Hennessy, Retargetable Compiler Code Generation, ACM Computing Surveys (CSUR), v.14 n.4, p.573-592, Dec. 1982
Bhaskaram Prabhala , Ravi Sethi, A comparison of instruction sets for stack machines, Proceedings of the ninth annual ACM symposium on Theory of computing, p.132-142, May 04-04, 1977, Boulder, Colorado, United States
R. W. Allard , K. A. Wolf , R. A. Zemlin, Some effects of the 6600 computer on language structures, Communications of the ACM, v.7 n.2, p.112-119, Feb. 1964
E. G. Coffman, Jr. , Ravi Sethi, Instruction Sets for Evaluating Arithmetic Expressions, Journal of the ACM (JACM), v.30 n.3, p.457-478, July 1983
A. P. Yershov, ALPHA—An Automatic Programming System of High Efficiency, Journal of the ACM (JACM), v.13 n.1, p.17-24, Jan. 1966
IEEE Annals of the History of Computing staff, Biographies, IEEE Annals of the History of Computing, v.15 n.2, p.55-61, April 1993
Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts
Keith D. Cooper , Li Xu, An efficient static analysis algorithm to detect redundant memory operations, ACM SIGPLAN Notices, v.38 n.2 supplement, p.97-107, February 2003
Markus E. Nebel, A unified approach to the analysis of Horton-Strahler parameters of binary tree structures, Random Structures & Algorithms, v.21 n.3-4, p.252-277, October 2002
F. Laroussinie , Ph. Schnoebelen , M. Turuani, On the expressivity and complexity of quantitative branching-time temporal logics, Theoretical Computer Science, v.297 n.1-3, p.297-315, 17 March 2003
Philippe Flajolet , Markus Nebel , Helmut Prodinger, The scientific works of Rainer Kemp (1949-2004), Theoretical Computer Science, v.355 n.3, p.371-381, 14 April 2006
Robert S. Boyer , Warren A. Hunt, Jr., Function memoization and unique object representation for ACL2 functions, Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications, August 15-16, 2006, Seattle, Washington
Michael Drmota , Helmut Prodinger, The register function for
t
-ary trees, ACM Transactions on Algorithms (TALG), v.2 n.3, p.318-334, July 2006
Jean-Christophe Filliâtre , Sylvain Conchon, Type-safe modular hash-consing, Proceedings of the 2006 workshop on ML, September 16-16, 2006, Portland, Oregon, USA
Henry G. Baker, The Boyer Benchmark at warp speed, ACM SIGPLAN Lisp Pointers, v.V n.3, p.13-14, July-Sept. 1992
Henry G. Baker, A tachy “TAK”, ACM SIGPLAN Lisp Pointers, v.V n.3, p.22-23, July-Sept. 1992
Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992
Carlos Ansótegui , María Luisa Bonet , Jordi Levy , Felip Manyà, Measuring the hardness of SAT instances, Proceedings of the 23rd national conference on Artificial intelligence, p.222-228, July 13-17, 2008, Chicago, Illinois
Fanny Chevalier , Maylis Delest , Jean-Philippe Domenger, A heuristic for the retrieval of objects in video in the framework of the rough indexing paradigm, Image Communication, v.22 n.7-8, p.622-634, August, 2007
Keith Cooper , Jason Eckhardt , Ken Kennedy, Redundancy elimination revisited, Proceedings of the 17th international conference on Parallel architectures and compilation techniques, October 25-29, 2008, Toronto, Ontario, Canada
Kiyokuni Kawachiya , Kazunori Ogata , Tamiya Onodera, Analysis and reduction of memory inefficiencies in Java strings, ACM SIGPLAN Notices, v.43 n.10, September 2008
Carlos Ansótegui , María Luisa Bonet , Jordi Levy , Felip Manyà, What Is a Real-World SAT Instance?, Proceeding of the 2007 conference on Artificial Intelligence Research and Development, p.19-28, June 13, 2007