Algorithm 161: combinatorial of M things taken one at a time, two at a time, up to N at a time

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Create an ACM Web Account Forgot Password?

Forgot your password?

We can help you if you still remember your username for your account

ACM Membership is not required to create a web account. Please indicate if you are a ACM/SIG Member or subscriber to ensure you receive your membership privileges.

If you are an ACM/SIG Member or subscriber, the email address you provide must match the one we have on file for you; this will enable you to take full advantage of member benefits.

You will be sent an email to complete the account creation process.

Need Access?

Please select one of the options below for access to premium content and features.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.