Algorithmic Solution of the Change-Making Problem

Authors:
S. K. Chang;A. Gill
Affiliations:
Electronics Research Laboratory, University of California, Department of Electrical Engineering and Computer Sciences, Berkeley, California;Electronics Research Laboratory, University of California, Department of Electrical Engineering and Computer Sciences, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1970

Citing 0
Cited 12

PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
The Change-Making Problem

Journal of the ACM (JACM)
Canonical Coin Changing and Greedy Solutions

Journal of the ACM (JACM)
ACM Algorithm 395: Student's t-distribution

Communications of the ACM
Algorithm 396: Student's t-Quantiles

Communications of the ACM
Remark on algorithm 397 [H]

Communications of the ACM
Algorithm 397: An integer programming problem

Communications of the ACM
Problems, exams, projects

ACM SIGCSE Bulletin
The classification of greedy algorithms

Science of Computer Programming
Managing change in the era of the iPhone

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A polynomial-time algorithm for the change-making problem

Operations Research Letters
Formal verification of change making algorithms

Proceedings of the 51st ACM Southeast Conference

Quantified Score

Hi-index	0.07

Visualization

Abstract