Author image not provided
 Fred Malcolm Ives

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.60
Citation Count13
Publication count5
Publication years1972-1987
Available for download4
Average downloads per article946.50
Downloads (cumulative)3,786
Downloads (12 Months)185
Downloads (6 Weeks)12
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
Sort by:

1 published by ACM
August 1987 ACM SIGPLAN Notices: Volume 22 Issue 8, August 1, 1987
Publisher: ACM
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 160

Full text available: PdfPdf

2 published by ACM
July 1986 SIGPLAN '86: Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Publisher: ACM
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Downloads (Overall): 466

Full text available: PDFPDF
Since the introduction of LALR parsing, several algorithms have been presented for the computation of the lookahead sets needed to produce an LALR parser. The algorithm in Aho and Ullman[1] has perhaps received the widest exposure. The recent algorithms by DeRemer and Pennello[2] and Park, Choe, and Chang[4] are the ...
Also published in:
July 1986  ACM SIGPLAN Notices: Volume 21 Issue 7, July 1986

3 published by ACM
June 1979 ACM Transactions on Mathematical Software (TOMS): Volume 5 Issue 2, June 1979
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 10,   Downloads (12 Months): 161,   Downloads (Overall): 2,179

Full text available: PDFPDF

4 published by ACM
February 1976 Communications of the ACM: Volume 19 Issue 2, Feb. 1976
Publisher: ACM
Citation Count: 7
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 981

Full text available: PDFPDF
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The ...
Keywords: loop-free algorithms, permutations


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