ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithm 265: find precedence functions [L2]
Full text PdfPdf (404 KB)
Source
Communications of the ACM archive
Volume 8 ,  Issue 10  (October 1965) table of contents
Pages: 604 - 605  
Year of Publication: 1965
ISSN:0001-0782
Author
Niklaus Wirth  Stanford Univ., Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365628.365647
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Peter G. Behrenz, Algorithm 133: Random, Communications of the ACM, v.5 n.11, p.553, Nov. 1962  [doi>10.1145/368996.368971]
2
R. R. Coveyou, Serial Correlation in the Generation of Pseudo-Random Numbers, Journal of the ACM (JACM), v.7 n.1, p.72-74, Jan. 1960  [doi>10.1145/321008.321018]
 
3
GREENBERGER, M. An a priori determination of serial correlation in computer generated random numbers. Math. Comput. 15 (1961), 383-389. correlation in Math. Comput 16(1962), 126.
 
4
KENDALL, M. G., AND BABINGTON SMITH, B. Randomness and random sampling numbers. J. Royal Statist. Soc. 101 (1938), 147-166.

CITED BY  3
David F. Martin, A Boolean matrix method for the computation of linear precedence functions, Communications of the ACM, v.15 n.6, p.448-454, June 1972
James R. Bell, A new method for determining linear precedence functions for precedence grammars, Communications of the ACM, v.12 n.10, p.567-569, Oct. 1969
Nadia Thalmann , Daniel Thalmann, The use of PASCAL as a teaching tool in introductory, intermediate and advanced computer science courses, ACM SIGCSE Bulletin, v.10 n.1, February 1978

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computations on matrices


General Terms:
Algorithms, Design, Performance, Theory

Collaborative Colleagues:
Niklaus Wirth: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player