© University of Kent - Contact | Feedback | Legal | FOI | Cookies
The collected algorithms of the ACM
Tim Hopkins
Wiley Interdisciplinary Reviews: Computational Statistics, 1(3):182-196, November 2009 [doi].Abstract
The Collected Algorithms of the ACM (CALGO) is now the longest running journal-published series of algorithms. After placing CALGO in the context of other journal algorithm series, we discuss the factors that we believe have made CALGO the well respected means of publishing mathematical software that it is today. We report on how moving with the times and technology has ensured the survival of CALGO, and we look briefly at how we may continue this in the near future.
Download publication 141 kbytes (PDF)Bibtex Record
@article{2980, author = {Tim Hopkins}, title = {The collected algorithms of the {ACM}}, month = {November}, year = {2009}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {10.1002/wics.40}, url = {http://www.cs.kent.ac.uk/pubs/2009/2980}, publication_type = {article}, submission_id = {24267_1265717791}, ISSN = {1939-5108}, journal = {Wiley Interdisciplinary Reviews: Computational Statistics}, volume = {1}, number = {3}, publisher = {Wiley InterScience}, }