Author image not provided
 C T Gan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count1
Publication years1985-1985
Available for download1
Average downloads per article297.00
Downloads (cumulative)297
Downloads (12 Months)11
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


1 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 1 of 1
Sort by:

1 published by ACM
June 1985 ACM Transactions on Mathematical Software (TOMS): Volume 11 Issue 2, June 1985
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Downloads (Overall): 297

Full text available: PDFPDF
A recent study by Akl indicates that Mifsud's algorithm, which involves unnecessary searching operations, is the fastest existing combination generator. A modified Page and Wilson's algorithm, which is essentially similar to Mifsud's algorithm, is presented. A theoretical analysis of the modified algorithm is also given.
Keywords: combinations



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