Hopkins, Tim (2009) The collected algorithms of the ACM. Wiley Interdisciplinary Reviews: Computational Statistics, 1 (3). pp. 182-196. ISSN 1939-5108. (doi:10.1002/wics.40) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30578)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://www.cs.kent.ac.uk/pubs/2009/2980 |
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.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1002/wics.40 |
| Uncontrolled keywords: | determinacy analysis, Craig interpolants |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Tim Hopkins |
| Date Deposited: | 21 Sep 2012 09:49 UTC |
| Last Modified: | 16 Nov 2021 10:08 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/30578 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
