Algorithms

recent open access

2025 (4)

Computing (general) / Communications of the ACM

2025	An Algorithm for a Better Bookshelf Communications of the ACM 2025 (9); by Erica Klarreich
2025	New Spectral Algorithms for Refuting Smoothed k-SAT Communications of the ACM 2025 (3); by Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2025	Shortening the Path to Designing Efficient Graph Algorithms Communications of the ACM 2025 (2); by Richard Peng
2025	Thinking of Algorithms as Institutions Communications of the ACM 2025 (1); by Virgílio Almeida, Ricardo Fabrino Mendonça, Fernando Filgueiras

2023 (9)

Computing (general) / Communications of the ACM

2023	Theoretical Analysis of Edit Distance Algorithms Communications of the ACM 2023 (12); by Paul Medvedev
2023	Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow Communications of the ACM 2023 (12); by Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough Communications of the ACM 2023 (9); by Chris Edwards
2023	More Than Just Algorithms Communications of the ACM 2023 (8); by Peter Norvig, Alfred Z. Spector, Chris Wiggins, Jeannette M. Wing, Ben Fried, Michael Tingley
2023	Offline and Online Algorithms for SSD Management Communications of the ACM 2023 (7); by Tomer Lange, Joseph Seffi Naor, Gala Yadgar
2023	Theoretical Analysis of Sequencing Bioinformatics Algorithms and Beyond Communications of the ACM 2023 (7); by Paul Medvedev
2023	On the Implicit Bias in Deep-Learning Algorithms Communications of the ACM 2023 (6); by Gal Vardi
2023	Using Algorithms to Deliver Disaster Aid Communications of the ACM 2023 (6); by Keith Kirkpatrick
2023	Better Algorithms through Faster Math Communications of the ACM 2023 (6); by Samuel Greengard

2022 (2)

Computing (general) / Communications of the ACM

2022	Algorithms with predictions Communications of the ACM 2022 (7); by Michael Mitzenmacher, Sergei Vassilvitskii
2022	Abstractions, their algorithms, and their compilers Communications of the ACM 2022 (2); by Alfred V. Aho, Jeffrey D. Ullman

2021 (3)

Computing (general) / Communications of the ACM

2021	Agent algorithm: crime-solving computer plays by its own rules Communications of the ACM 2021 (8); by Brian Clegg
2021	Let the algorithm decide? Communications of the ACM 2021 (6); by Chris Edwards
2021	Robustness meets algorithms Communications of the ACM 2021 (5); by Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart

2020 (4)

Computing (general) / Communications of the ACM

2020	Data-driven algorithm design Communications of the ACM 2020 (6); by Rishi Gupta, Tim Roughgarden
2020	Technical perspective: Algorithm selection as a learning problem Communications of the ACM 2020 (6); by Avrim Blum
2020	A bounded and envy-free cake cutting algorithm Communications of the ACM 2020 (4); by Haris Aziz, Simon Mackenzie
2020	Algorithms to harvest the wind Communications of the ACM 2020 (3); by Don Monroe

2019 (8)

Computing (general) / Communications of the ACM

2019	Algorithms, platforms, and ethnic bias Communications of the ACM 2019 (11); by Selena Silva, Martin Kenney
2019	Protein design by provable algorithms Communications of the ACM 2019 (10); by Mark A. Hallen, Bruce Randall Donald
2019	The algorithm that changed quantum machine learning Communications of the ACM 2019 (8); by Samuel Greengard
2019	Good algorithms make good neighbors Communications of the ACM 2019 (7); by Erica Klarreich
2019	Know your algorithms Communications of the ACM 2019 (4); by George V. Neville-Neil
2019	Neural algorithms and computing beyond Moore's law Communications of the ACM 2019 (4); by James B. Aimone
2019	A deterministic parallel algorithm for bipartite perfect matching Communications of the ACM 2019 (3); by Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2019	Illegal pricing algorithms Communications of the ACM 2019 (1); by Michal S. Gal

2018 (3)

Computing (general) / Communications of the ACM

2018	Algorithms behind modern storage systems Communications of the ACM 2018 (8); by Alex Petrov
2018	Technical perspective: Designing algorithms and the fairness criteria they should satisfy Communications of the ACM 2018 (2); by Vincent Conitzer
2018	Halide: decoupling algorithms from schedules for high-performance image processing Communications of the ACM 2018 (1); by Jonathan Ragan-Kelley, Andrew Adams, Dillon Sharlet, Connelly Barnes, Sylvain Paris, Marc Levoy, Saman P. Amarasinghe, Frédo Durand

2017 (1)

Computing (general) / Communications of the ACM

2017	It's not the algorithm, it's the data Communications of the ACM 2017 (2); by Keith Kirkpatrick

2016 (5)

Computing (general) / Communications of the ACM

2016	Sex as an algorithm: the theory of evolution under the lens of computation Communications of the ACM 2016 (11); by Adi Livnat, Christos H. Papadimitriou
2016	Battling algorithmic bias: how do we ensure algorithms treat us fairly? Communications of the ACM 2016 (10); by Keith Kirkpatrick
2016	Efficient parallelization using rank convergence in dynamic programming algorithms Communications of the ACM 2016 (10); by Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz
2016	Computational biology in the 21st century: scaling with compressive algorithms Communications of the ACM 2016 (8); by Bonnie Berger, Noah M. Daniels
2016	Algebraic fingerprints for faster algorithms Communications of the ACM 2016 (1); by Ioannis Koutis, Ryan Williams

2015 (2)

Computing (general) / Communications of the ACM

2015	The simplicity of cache efficient functional algorithms: technical perspective Communications of the ACM 2015 (7); by William D. Clinger
2015	Cache efficient functional algorithms Communications of the ACM 2015 (7); by Guy E. Blelloch, Robert Harper

2014 (3)

Computing (general) / Communications of the ACM

2014	Efficient maximum flow algorithms Communications of the ACM 2014 (8); by Andrew V. Goldberg, Robert Endre Tarjan
2014	A new spin on an old algorithm: technical perspective Communications of the ACM 2014 (2); by Michael W. Mahoney
2014	French team invents faster code-breaking algorithm Communications of the ACM 2014 (1); by Gary Anthes

2013 (5)

Computing (general) / Communications of the ACM

2013	Online algorithms in high-frequency trading Communications of the ACM 2013 (10); by Jacob Loveless, Sasha Stoikov, Rolf Waeber
2013	Spectral sparsification of graphs: theory and algorithms Communications of the ACM 2013 (8); by Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng
2013	Nonblocking algorithms and scalable multicore programming Communications of the ACM 2013 (7); by Samy Al-Bahra
2013	SimPL: an algorithm for placing VLSI circuits Communications of the ACM 2013 (6); by Myung-Chul Kim, Dongjin Lee, Igor L. Markov
2013	Exact exponential algorithms Communications of the ACM 2013 (3); by Fedor V. Fomin, Petteri Kaski

2012 (3)

Computing (general) / Communications of the ACM

2012	Natural algorithms in a networked world: technical perspective Communications of the ACM 2012 (12); by Ali Jadbabaie
2012	Natural algorithms and influence systems Communications of the ACM 2012 (12); by Bernard Chazelle
2012	Best algorithms + best computers = powerful match Communications of the ACM 2012 (5); by William Gropp

2011 (3)

Computing (general) / Communications of the ACM

2011	The PatchMatch randomized matching algorithm for image manipulation Communications of the ACM 2011 (11); by Connelly Barnes, Dan B. Goldman, Eli Shechtman, Adam Finkelstein
2011	A breakthrough in algorithm design Communications of the ACM 2011 (9); by Kirk L. Kroeker
2011	Patterns hidden from simple algorithms: technical perspective Communications of the ACM 2011 (4); by Madhu Sudan

2010 (2)

Computing (general) / Communications of the ACM

2010	Energy-efficient algorithms Communications of the ACM 2010 (5); by Susanne Albers
2010	Recent progress in quantum algorithms Communications of the ACM 2010 (2); by Dave Bacon, Wim van Dam

2009 (4)

Computing (general) / Communications of the ACM

2009	Technical opinion - Steering self-learning distance algorithms Communications of the ACM 2009 (11); by Frank Nielsen
2009	Smoothed analysis: an attempt to explain the behavior of algorithms in practice Communications of the ACM 2009 (10); by Daniel A. Spielman, Shang-Hua Teng
2009	Recommendation algorithms, online privacy, and more Communications of the ACM 2009 (5)
2009	Puzzled - Will my algorithm terminate? Communications of the ACM 2009 (2); by Peter Winkler

2008 (2)

Computing (general) / Communications of the ACM

2008	Geometry, flows, and graph-partitioning algorithms Communications of the ACM 2008 (10); by Sanjeev Arora, Satish Rao, Umesh V. Vazirani
2008	Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions Communications of the ACM 2008 (1); by Alexandr Andoni, Piotr Indyk

2005 (1)

Computing (general) / Communications of the ACM

2005	A P2P genetic algorithm environment for the internet Communications of the ACM 2005 (4); by Kay Chen Tan, Mingliang Wang, Wei Peng

2002 (2)

Computing (general) / Communications of the ACM

2002	Scaling mining algorithms to large databases Communications of the ACM 2002 (8); by Paul S. Bradley, Johannes Gehrke, Raghu Ramakrishnan, Ramakrishnan Srikant
2002	Data-driven evolution of data mining algorithms Communications of the ACM 2002 (8); by Padhraic Smyth, Daryl Pregibon, Christos Faloutsos

1997 (1)

Computing (general) / Communications of the ACM

1997	Why Interaction Is More Powerful Than Algorithms Communications of the ACM 1997 (5); by Peter Wegner

1996 (5)

Computing (general) / Communications of the ACM

1996	A Comparison of Sorting Algorithms for the Connection Machine CM-2 Communications of the ACM 1996 (12); by Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
1996	A Graph Labelling Proof of the Backpropagation Algorithm Communications of the ACM 1996 (12); by Raúl Rojas
1996	GENOCOP: A Genetic Algorithm for Numerical Optimization Problems with Linear Constraints Communications of the ACM 1996 (12); by Zbigniew Michalewicz, Cezary Z. Janikow
1996	Can Parallel Algorithms Enhance Seriel Implementation? Communications of the ACM 1996 (9); by Uzi Vishkin
1996	Programming Parallel Algorithms Communications of the ACM 1996 (3); by Guy E. Blelloch

1994 (1)

Computing (general) / Communications of the ACM

1994	Genetic and Evolutionary Algorithms Come of Age Communications of the ACM 1994 (3); by David E. Goldberg

1992 (1)

Computing (general) / Communications of the ACM

1992	A Practical Algorithm for Exact Array Dependence Analysis Communications of the ACM 1992 (8); by William W. Pugh

1990 (3)

Computing (general) / Communications of the ACM

1990	Connectionist Ideas and Algorithms Communications of the ACM 1990 (11); by Kevin Knight
1990	Should Program Algorithms be Patented? Communications of the ACM 1990 (8); by Pamela Samuelson
1990	A Very Fast Substring Search Algorithm Communications of the ACM 1990 (8); by Daniel Sunday

1989 (4)

Computing (general) / Communications of the ACM

1989	Parallel Thinning with Two-Subiteration Algorithms Communications of the ACM 1989 (3); by Zicheng Guo, Richard W. Hall
1989	A Practical Sieve Algorithm for Finding Prime Numbers Communications of the ACM 1989 (3); by Xuedong Luo
1989	A Definition Optimization Technique Used in a Code Translation Algorithm Communications of the ACM 1989 (1); by David M. DeJean, George W. Zobrist
1989	Fast Parallel Thinning Algorithms: Parallel Speed and Connectivity Preservation Communications of the ACM 1989 (1); by Richard W. Hall

1988 (5)

Computing (general) / Communications of the ACM

1988	Using Induction to Design Algorithms Communications of the ACM 1988 (11); by Udi Manber
1988	A Thinning Algorithm by Contour Generation Communications of the ACM 1988 (11); by Paul C. K. Kwok
1988	Probabilistic and Genetic Algorithms in Document Retrieval Communications of the ACM 1988 (10); by Michael D. Gordon
1988	A Subset Coloring Algorithm and Its Applications to Computer Graphics Communications of the ACM 1988 (10); by David Rubinstein, Jeffrey O. Shallit, Mario Szegedy
1988	An Insertion Algorithm for a Minimal Internal Path Length Binary Search Tree Communications of the ACM 1988 (5); by Thomas E. Gerasch

1987 (4)

Computing (general) / Communications of the ACM

1987	The Tea-Leaf Reader Algorithm: An Efficient Implementation of CRC-16 and CRC-32 Communications of the ACM 1987 (7); by Georgia Griffiths, G. Carlyle Stones
1987	A Versatile Data Structure for Edge-Oriented Graph Algorithms Communications of the ACM 1987 (6); by Jürgen Ebert
1987	Systolic Algorithms to Examine All Pairs of Elements Communications of the ACM 1987 (2); by Zen-Cheung Shih, Gen-Huey Chen, Richard C. T. Lee
1987	An Improved Parallel Thinning Algorithm Communications of the ACM 1987 (2); by Christopher M. Holt, Alan Stewart, Maurice Clint, Ronald H. Perrott

1986 (2)

Computing (general) / Communications of the ACM

1986	Data Parallel Algorithms Communications of the ACM 1986 (12); by W. Daniel Hillis, Guy L. Steele Jr.
1986	A Comment on "A Fast Parallel Algorithm for Thinning Digital Patterns" Communications of the ACM 1986 (3); by H. E. Lü, Patrick Shen-Pei Wang

1985 (5)

Computing (general) / Communications of the ACM

1985	The P² Algorithm for Dynamic Calculation of Quantiiles and Histograms Without Storing Observations Communications of the ACM 1985 (10); by Raj Jain, Imrich Chlamtac
1985	Data-Flow Algorithms for Parallel Matrix Computations Communications of the ACM 1985 (8); by Dianne P. O'Leary, G. W. Stewart
1985	A Generalized Implicit Enumeration Algorithm for Graph Coloring Communications of the ACM 1985 (4); by Marek Kubale, Boguslaw Jackowski
1985	A Class of Sorting Algorithms Based on Quicksort Communications of the ACM 1985 (4); by Roger L. Wainwright
1985	An Inverted Taxonomy of Sorting Algorithms Communications of the ACM 1985 (1); by Susan M. Merritt

1984 (7)

Computing (general) / Communications of the ACM

1984	Algorithm Design Techniques Communications of the ACM 1984 (9); by Jon Louis Bentley
1984	Pass-Algorithms: A User Validation Scheme Based on Knowledge of Secret Algorithms Communications of the ACM 1984 (8); by James A. Haskett
1984	A Null-Object Detection Algorithm for Constructive Solid Geometry Communications of the ACM 1984 (7); by Robert B. Tilove
1984	Efficient Algorithms to Globally Balance a Binary Search Tree Communications of the ACM 1984 (7); by Hsi Chang, S. Sitharama Iyengar
1984	Anomalies in Parallel Branch-and-Bound Algorithms Communications of the ACM 1984 (6); by Ten-Hwang Lai, Sartaj Sahni
1984	An Algorithm for Optimized Boolean Evaluation in Information Management Systems Communications of the ACM 1984 (5); by Gerard D. Finn
1984	A Fast Parallel Algorithm for Thinning Digital Patterns Communications of the ACM 1984 (3); by T. Y. Zhang, Ching Y. Suen

1983 (7)

Computing (general) / Communications of the ACM

1983	A Constructive Approach to the Design of Algorithms and Their Data Structures Communications of the ACM 1983 (11); by Gaston H. Gonnet, Frank Wm. Tompa
1983	An Analysis and Algorithm for Polygon Clipping Communications of the ACM 1983 (11); by You-Dong Liang, Brian A. Barsky
1983	Aha! Algorithms Communications of the ACM 1983 (9); by Jon Louis Bentley
1983	A Correction to Brelaz's Modification of Brown's Coloring Algorithm Communications of the ACM 1983 (8); by Jürgen Peemöller
1983	A General-Purpose Algorithm for Analyzing Concurrent Programs Communications of the ACM 1983 (5); by Richard N. Taylor
1983	A Tree Convolution Algorithm for the Solution of Queueing Networks Communications of the ACM 1983 (3); by Simon S. Lam, Luke Yeong-Chang Lien
1983	An Efficient Context-Free Parsing Algorithm (Reprint) Communications of the ACM 1983 (1); by Jay Earley

1982 (14)

Computing (general) / Communications of the ACM

1982	Pracniques: The "Wolf Fence" Algorithm for Debugging Communications of the ACM 1982 (11); by E. J. Gauss
1982	Distributed Computation on Graphs: Shortest Path Algorithms Communications of the ACM 1982 (11); by K. Mani Chandy, Jayadev Misra
1982	Combinatorially Implosive Algorithms Communications of the ACM 1982 (10); by William A. Kornfeld
1982	Plane-Sweep Algorithms for Intersecting Geometric Figures Communications of the ACM 1982 (10); by Jürg Nievergelt, Franco P. Preparata
1982	Efficient Parallel Algorithms for Some Graph Problems Communications of the ACM 1982 (9); by Francis Y. L. Chin, John Lam, I-Ngo Chen
1982	Algorithms for Computing the Volume and Other Integral Properties of Solids. I. Known Methods and Open Issues Communications of the ACM 1982 (9); by Yong Tsui Lee, Aristides A. G. Requicha
1982	Algorithms for Computing the Volume and Other Integral Properties of Solids. II. A Family of Algorithms Based on Representation Conversion and Cellular Approximation Communications of the ACM 1982 (9); by Yong Tsui Lee, Aristides A. G. Requicha
1982	The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality Communications of the ACM 1982 (8); by Judea Pearl
1982	Three New Combination Algorithms with the Minimal Change Property Communications of the ACM 1982 (8); by Clement W. H. Lam, Leonard H. Soicher
1982	An Efficient Garbage Compaction Algorithm Communications of the ACM 1982 (8); by Johannes J. Martin
1982	On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors Communications of the ACM 1982 (5); by Wm. Randolph Franklin
1982	Performance Results of the Simplex Algorithm for a Set of Real-World Linear Programming Models Communications of the ACM 1982 (3); by Edward H. McCall
1982	Linearzer: A Heuristic Algorithm for Queueing Network Models of Computing Systems Communications of the ACM 1982 (2); by K. Mani Chandy, Doug Neuse
1982	Approximation Algorithms for Convex Hulls Communications of the ACM 1982 (1); by Jon Louis Bentley, Mark G. Faust, Franco P. Preparata

1981 (6)

Computing (general) / Communications of the ACM

1981	An Algorithm for Exhaustive Generation of Building Floor Plans Communications of the ACM 1981 (12); by Per Galle
1981	Analysis of Future Event Set Algorithms for Discrete Event Simulation Communications of the ACM 1981 (12); by William M. McCormack, Robert G. Sargent
1981	An On-Line Algorithm for Fitting Straight Lines Between Data Ranges Communications of the ACM 1981 (9); by Joseph O'Rourke
1981	A User-Friendly Algorithm Communications of the ACM 1981 (9); by Barry Dwyer
1981	Long Term File Migration: Development and Evaluation of Algorithms Communications of the ACM 1981 (8); by Alan Jay Smith
1981	An Optimal Algorithm for Mutual Exclusion in Computer Networks Communications of the ACM 1981 (1); by Glenn Ricart, Ashok K. Agrawala

1980 (5)

Computing (general) / Communications of the ACM

1980	Bresnham's Algorithm with Grey Scale Communications of the ACM 1980 (11); by Michael L. V. Pitteway, D. J. Watkinson
1980	Best Sorting Algorithm for Nearly Sorted Lists Communications of the ACM 1980 (11); by Curtis R. Cook, Do Jin Kim
1980	Computational Algorithms for Product Form Queueing Networks Communications of the ACM 1980 (10); by K. Mani Chandy, Charles H. Sauer
1980	A More General Algorithm for Computing Closed Semiring Costs Between Vertices of a Directed Graph Communications of the ACM 1980 (6); by John G. Fletcher
1980	A Linear Algorithm for Copying Binary Trees Using Bounded Workspace Communications of the ACM 1980 (3); by K. P. Lee

1979 (8)

Computing (general) / Communications of the ACM

1979	Breaking Substitution Ciphers Using a Relaxation Algorithm Communications of the ACM 1979 (11); by Shmuel Peleg, Azriel Rosenfeld
1979	An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles Communications of the ACM 1979 (10); by Tomás Lozano-Pérez, Michael A. Wesley
1979	An Optimal Insertion Algorithm for One-Sided Height-Balanced Binary Search Trees Communications of the ACM 1979 (9); by Kari-Jouko Räihä, Stuart H. Zweben
1979	On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm Communications of the ACM 1979 (9); by Zvi Galil
1979	Algorithm = Logic + Control Communications of the ACM 1979 (7); by Robert A. Kowalski
1979	An Optimal Real-Time Algorithm for Planar Convex Hulls Communications of the ACM 1979 (7); by Franco P. Preparata
1979	An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes Communications of the ACM 1979 (5); by Ernest J. H. Chang, Rosemary Roberts
1979	Experiments with Some Algorithms that Find Central Solutions for Pattern Classification Communications of the ACM 1979 (3); by James R. Slagle

1978 (13)

Computing (general) / Communications of the ACM

1978	A Linear Sieve Algorithm for Finding Prime Numbers Communications of the ACM 1978 (12); by David Gries, Jayadev Misra
1978	An Analysis of Algorithms for the Dutch National Flag Problem Communications of the ACM 1978 (10); by Colin L. McMaster
1978	Simulations of Dynamic Sequential Search Algorithms Communications of the ACM 1978 (9); by Aaron M. Tenenbaum
1978	An Algorithm Using Symbolic Techniques for the Bel-Petrov Classification of Gravitational Fields Communications of the ACM 1978 (9); by R. A. Harris, J. D. Zund
1978	A Practical Interprocedural Data Flow Analysis Algorithm Communications of the ACM 1978 (9); by Jeffrey M. Barth
1978	Fast Parallel Sorting Algorithms Communications of the ACM 1978 (8); by Daniel S. Hirschberg
1978	A Time- and Space-Efficient Garbage Compaction Algorithm Communications of the ACM 1978 (8); by F. Lockwood Morris
1978	An Algorithm for Reasoning About Equality Communications of the ACM 1978 (7); by Robert E. Shostak
1978	An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products Communications of the ACM 1978 (7); by Francis Y. L. Chin
1978	A Selective Traversal Algorithm for Binary Search Trees Communications of the ACM 1978 (6); by James R. Driscoll, Y. Edmund Lien
1978	Analyses of Deterministic Parsing Algorithms Communications of the ACM 1978 (6); by Jacques Cohen, Martin A. Roth
1978	A Fast Algorithm for Copying List Structures Communications of the ACM 1978 (5); by Douglas W. Clark
1978	Anomalies with Variable Partition Paging Algorithms Communications of the ACM 1978 (3); by Mark A. Franklin, G. Scott Graham, Ram K. Gupta

1977 (6)

Computing (general) / Communications of the ACM

1977	An Algorithm for Reduction of Operator Strength Communications of the ACM 1977 (11); by John Cocke, Ken Kennedy
1977	A Fast String Searching Algorithm Communications of the ACM 1977 (10); by Robert S. Boyer, J Strother Moore
1977	A Bounded Storage Algorithm for Copying Cyclic Structures Communications of the ACM 1977 (6); by J. M. Robson
1977	A Fast Algorithm for Computing Longest Subsequences Communications of the ACM 1977 (5); by James W. Hunt, Thomas G. Szymanski
1977	A Comparison of Tree-Balancing Algorithms Communications of the ACM 1977 (5); by Jean-Loup Baer, B. Schwab
1977	A Linear Algorithm for Incremental Digital Display of Circular Arcs Communications of the ACM 1977 (2); by Jack Bresenham

1976 (10)

Computing (general) / Communications of the ACM

1976	Hierarchical Geometric Models for Visible Surface Algorithms Communications of the ACM 1976 (10); by James H. Clark
1976	A Parametric Algorithm for Drawing Pictures of Solid Objects Composed of Quadric Surfaces Communications of the ACM 1976 (10); by Joshua Levin
1976	An Improvement to Martin's Algorithm for Computation of Linear Precedence Functions Communications of the ACM 1976 (10); by C. Duong-Kien, Hans-Jürgen Hoffmann, D. Muth
1976	Analysis of an Algorithm for Real Time Garbage Collection Communications of the ACM 1976 (9); by Philip Wadler
1976	A Practitioner's Guide To Addressing Algorithms Communications of the ACM 1976 (6); by Dennis G. Severance, Richardo Duhne
1976	An Efficient List-Moving Algorithm Using Constant Workspace Communications of the ACM 1976 (6); by Douglas W. Clark
1976	Analysis of the PFF Replacement Algorithm via a Semi-Markov Model Communications of the ACM 1976 (5); by Wesley W. Chu, Holger Opderbeck
1976	VMIN-An Optimal Variable-Space Page Replacement Algorithm Communications of the ACM 1976 (5); by Barton G. Prieve, Robert S. Fabry
1976	Permutation Enumeration: Four New Permutation Algorithms Communications of the ACM 1976 (2); by F. M. Ives
1976	On Quadratic Adaptive Routing Algorithms Communications of the ACM 1976 (1); by Carson E. Agnew

1975 (22)

Computing (general) / Communications of the ACM

1975	A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract) Communications of the ACM 1975 (12); by Susan L. Graham, Mark N. Wegman
1975	A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies Communications of the ACM 1975 (6); by Vincent Y. Lum, Michael E. Senko, C. P. Wang, Huei Ling
1975	Generation of All the Cycles of a Graph from a Set of Basic Cycles [H] (Algorithm 492) Communications of the ACM 1975 (6); by Norman E. Gibbs
1975	A Linear Space Algorithm for Computing Maximal Common Subsequences Communications of the ACM 1975 (6); by Daniel S. Hirschberg
1975	Visible Surface Plotting Program (Remark on Algorithm 475) Communications of the ACM 1975 (5); by C. J. Doran
1975	Ten Subroutines for the Manipulation of Chebyshev Series (Remark and Certification on Algorithm 446) Communications of the ACM 1975 (5); by Robert Piessens, Irene Mertens
1975	Solution of an Overdetermined System of Equations in the L1 Norm (Remark on Algorithm 478) Communications of the ACM 1975 (5); by Fred N. Fritsch, Alan C. Hindmarsh
1975	Visible Surface Plotting Program (Remark on Algorithm 475) Communications of the ACM 1975 (5); by R. G. Mashburn
1975	A Syntactic Algorithm for Peak Detection in Waveforms with Applications to Cardiography Communications of the ACM 1975 (5); by Steven L. Horowitz
1975	Basic Cycle Generation [H] (Algorithm 491) Communications of the ACM 1975 (5); by Norman E. Gibbs
1975	An Algorithm for Locating Adjacent Storage Blocks in the Buddy System Communications of the ACM 1975 (4); by James A. Hinds
1975	A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations Communications of the ACM 1975 (4); by Henry S. Warren Jr.
1975	The Dilogarithm Function of a Real Argument [S22] (Algorithm 490) Communications of the ACM 1975 (4); by E. S. Ginsberg, Dorothy Zaborowski
1975	Remark on Algorithm 475 Communications of the ACM 1975 (4); by Lawrence W. Frederick
1975	A Comparison of Simulation Event List Algorithms Communications of the ACM 1975 (4); by Jean G. Vaucher, Pierre Duval
1975	The Algorithm Sequential Access Method: An Alternative to Index Sequential Communications of the ACM 1975 (3); by Jerry D. Whitt, A. Gale Sullenberger
1975	The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489) Communications of the ACM 1975 (3); by Robert W. Floyd, Ronald L. Rivest
1975	The Elementary Circuits of a Graph (Remark on Algorithm 459) Communications of the ACM 1975 (2); by Maciej M. Syslo
1975	A Minimal Spanning Tree Clustering Method (Remark on Algorithm 479) Communications of the ACM 1975 (2); by H. S. Magnuski
1975	Exact Probabilities for R x C Contingency Tables (Remark on Algorithm 434) Communications of the ACM 1975 (2); by T. W. Hancock
1975	Chi-Square Quantiles (Certification of Algorithm 451) Communications of the ACM 1975 (2); by William J. Knight
1975	Jacobi Polynomials (Remark on Algorithm 332) Communications of the ACM 1975 (2); by Ove Skovgaard

1974 (41)

Computing (general) / Communications of the ACM

1974	A Graph Formulation of a School Scheduling Algorithm Communications of the ACM 1974 (12); by Arturo Salazar, R. V. Oakford
1974	A Gaussian Pseudo-Random Number Generator (Algorithm 488) Communications of the ACM 1974 (12); by Richard P. Brent
1974	Merge Sort Algorithm (Remark on Algorithm 426) Communications of the ACM 1974 (12); by Coenraad Bron
1974	Hidden-Line Plotting Program (Remark on Algorithm 420) Communications of the ACM 1974 (12); by T. M. R. Ellis
1974	Routing Problem (Remark on Algorithm 456) Communications of the ACM 1974 (12); by Gerhard Tesch
1974	Exact Cumulative Distribution of the Kolmogorov-Smirnov Statistic for Small Samples (Algorithm 487) Communications of the ACM 1974 (12); by John Pomeranz
1974	Numerical Inversion of Laplace Transform (Algorithm 486) Communications of the ACM 1974 (10); by Francoise Veillon
1974	Hypergeometric (Certification and Remark on Algorithm 191) Communications of the ACM 1974 (10); by Henk Koppelaar
1974	Rosenbrock Function Minimization (Remark on Algorithm 450) Communications of the ACM 1974 (10); by Jiri Klemes, Jaroslav Klemsa
1974	A Computer Routine for Quadratic and Linear Programming Problems (Remark on Algorithm 431) Communications of the ACM 1974 (10); by Les G. Proll
1974	Evaluation of the Modified Bessel Functions K0(Z) and K1(Z) for Complex Arguments [S17] (Algorithm 484) Communications of the ACM 1974 (9); by Keith H. Burrell
1974	A New Integration Algorithm for Ordinary Differential Equations Based on Continued Fraction Approximations Communications of the ACM 1974 (9); by I. M. Willers
1974	Computation of g-Splines via a Factorization Method [E2] (Algorithm 485) Communications of the ACM 1974 (9); by Harold D. Eidson, Larry L. Schumaker
1974	Masked Three-Dimensional Plot Program with Rotations [J6] (Algorithm 483) Communications of the ACM 1974 (9); by Steven L. Watkins
1974	Arrow to Precedence Network Transformation [H] (Algorithm 481) Communications of the ACM 1974 (8); by Keith C. Crandall
1974	Procedures for computing Smoothing and Interpolating Natural Splines [E1] (Algorithm 480) Communications of the ACM 1974 (8); by Tom Lyche, Larry L. Schumaker
1974	Transitivity Sets [G7] (Algorithm 482) Communications of the ACM 1974 (8); by John McKay, Eric Regener
1974	The Complex Method for Constrained Optimization (Remark on Algorithm 454) Communications of the ACM 1974 (8); by Kenneth D. Shere
1974	Rosenbrock Function Minimization (Remark on Algorithm 450) Communications of the ACM 1974 (8); by Adhemar Bultheel
1974	Exact Probabilities for R x C Contingency Tables (Remark on Algorithm 434) Communications of the ACM 1974 (6); by D. M. Boulton
1974	Calculation of Fourier Integrals (Remark on Algorithm 418) Communications of the ACM 1974 (6); by Robert Piessens
1974	Modified Havie Integration (Remark on Algorithm 400) Communications of the ACM 1974 (6); by Robert Piessens
1974	Hidden-Line Plotting Program (Remark on Algorithm 420) Communications of the ACM 1974 (6); by T. M. R. Ellis
1974	Hidden-Line Plotting Program (Remark on Algorithm 420) Communications of the ACM 1974 (6); by Blaine Gaither
1974	Solution of an Overdetermined System of Equations in the L1 Norm [F4] (Algorithm 478) Communications of the ACM 1974 (6); by Ian Barrodale, F. D. K. Roberts
1974	Generation of Random Correlated Normal Variables (Remark on Algorithm 425) Communications of the ACM 1974 (6); by Rex L. Page
1974	A Minimal Spanning Tree clustering Method [Z] (Algorithm 479) Communications of the ACM 1974 (6); by Rex L. Page
1974	More on Algorithms that Reveal Properties of Floating Point Arithmetic Units Communications of the ACM 1974 (5); by W. Morven Gentleman, Scott B. Marovich
1974	An Improved Program-Synthesizing Algorithm and Its Correctness Communications of the ACM 1974 (4); by Richard C. T. Lee, Chin-Liang Chang, Richard J. Waldinger
1974	Generator of Set-Partitions to Exactly R Subsets [G7] (Algorithm 477) Communications of the ACM 1974 (4); by Gideon Ehrlich
1974	Six Subprograms for Curve Fitting Using Splines Under Tension [E2] (Algorithm 476) Communications of the ACM 1974 (4); by A. K. Cline
1974	Solution of the Transcendental Equation w*exp(x)=x (Remark on Algorithm 443) Communications of the ACM 1974 (4); by Bo Einarsson
1974	A Computer Routine for Quadratic and Linear Programming Problems (Remark on Algorithm 431) Communications of the ACM 1974 (3); by Arunachalam Ravindran
1974	Incomplete Beta Ratio (Remark on Algorithm 179) Communications of the ACM 1974 (3); by Nancy E. Bosten, E. L. Battiste
1974	Scan Conversion Algorithms for a Cell Organized Raster Display Communications of the ACM 1974 (3); by Ronald Curtis Barrett, B. W. Jordan Jr.
1974	Efficient Implementation of a Variable Projection Algorithm for Nonlinear Least Squares Problems Communications of the ACM 1974 (3); by Fred T. Krogh
1974	Visible Surface Plotting Program [J6] (Algorithm 475) Communications of the ACM 1974 (3); by Thomas J. Wright
1974	Zeros of a Complex Polynomial (Remark on Algorithm 419) Communications of the ACM 1974 (3); by David H. Withers
1974	Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures [E2] (Algorithm 474) Communications of the ACM 1974 (1); by Hiroshi Akima
1974	Computation of Legendre Series Coefficients [C6] (Algorithm 473) Communications of the ACM 1974 (1); by Robert Piessens
1974	Comments on the Algorithms of Verhelst for the Conversion of Limited-Entry Decision Tables to Flowcharts Communications of the ACM 1974 (1); by Peter J. H. King, Roger G. Johnson

1973 (63)

Computing (general) / Communications of the ACM

1973	Procedures for Natural Spline Interpolation [E1] (Algorithm 472) Communications of the ACM 1973 (12); by John G. Herriot
1973	Linear Systems with Almost Tridiagonal Matrix [F4] (Algorithm 470) Communications of the ACM 1973 (12); by Milan Kubicek
1973	Exponential Integrals [S13] (Algorithm 471) Communications of the ACM 1973 (12); by Walter Gautschi
1973	Four Combinatorial Algorithms [G6] (Algorithm 466) Communications of the ACM 1973 (11); by Gideon Ehrlich
1973	Arithmetic Overa Finite Field [A1] (Algorithm 469) Communications of the ACM 1973 (11); by Clement Wing Hong Lam, John McKay
1973	Eigenvalues of a Real, Symmetric, Tridiagonal Matrix [F2] (Algorithm 464) Communications of the ACM 1973 (11); by Christian H. Reinsch
1973	Student's t Frequency [S14] (Algorithm 465) Communications of the ACM 1973 (11); by G. W. Hill
1973	An Algorithm for the Approximate Solution of Wiener-Hopf Integral Equations Communications of the ACM 1973 (11); by Frank Stenger
1973	Algorithm for Automatic Numerical Integration Over a Finite Interval [D1] (Algorithm 468) Communications of the ACM 1973 (11); by Thomas N. L. Patterson
1973	Comment on Brent's Scatter Storage Algorithm Communications of the ACM 1973 (11); by Jerome A. Feldman, James R. Low
1973	Matrix Transposition in Place [F1] (Algorithm 467) Communications of the ACM 1973 (11); by Norman Brenner
1973	A Scan Conversion Algorithm with Reduced Storage Requirements Communications of the ACM 1973 (11); by B. W. Jordan Jr., Ronald Curtis Barrett
1973	Calculation of Optimum Parameters for Alternating Direction Implicit Procedures [D3] (Algorithm 460) Communications of the ACM 1973 (10); by Paul E. Saylor, James D. Sebastian
1973	Bivariate Normal Distribution [S15] (Algorithm 462) Communications of the ACM 1973 (10); by Thomas G. Donnelly
1973	A Class of Dynamic Memory Allocation Algorithms Communications of the ACM 1973 (10); by Daniel S. Hirschberg
1973	Discrete Linear L1 Approximation by Interval Linear Programming [E2] (Algorithm 458) Communications of the ACM 1973 (10); by P. D. Robers, S. S. Robers
1973	The Elementary Circuits of a Graph [H] (Algorithm 459) Communications of the ACM 1973 (10); by Maciej M. Syslo
1973	Algorithms SCALE1, SCALE2, and SCALE3 for Determination of Scales on Computer Generated Plots [J6] (Algorithm 463) Communications of the ACM 1973 (10); by C. R. Lewart
1973	Cubic Spline Solutions to a Class of Functional Differential Equations [D2] (Algorithm 461) Communications of the ACM 1973 (10); by Forbes J. Burkowski, W. D. Hoskins
1973	Addendum to a Multiple-Precision Division Algorithm Communications of the ACM 1973 (10); by Charles J. Mifsud, Michael J. Bohlen
1973	Generation of Permutations in Lexicographic Order (Remark on Algorithm 323) Communications of the ACM 1973 (9); by Mohit Kumar Roy
1973	Finding All Cliques of an Undirected Graph (Algorithm 457) Communications of the ACM 1973 (9); by Coenraad Bron, Joep Kerbosch
1973	Computational Algorithms for Closed Queueing Networks with Exponential Servers Communications of the ACM 1973 (9); by Jeffrey P. Buzen
1973	Analysis of Skew Representations of the Symmetric Group (Algorithm 455) Communications of the ACM 1973 (9); by D. B. Hunter, Julia M. Williams
1973	Hidden-Line Plotting Program (Remark on Algorithm 420) Communications of the ACM 1973 (9); by Hugh Williamson
1973	A Sparse Matrix Package (Remark on Algorithm 408) Communications of the ACM 1973 (9); by E. E. Lawrence
1973	Localization of the Roots of a Polynomial (Remark on Algorithm 429) Communications of the ACM 1973 (9); by H. B. Driessen, E. W. LeM. Hunt
1973	Routing Problem (Algorithm 456) Communications of the ACM 1973 (9); by Zdenek Fencl
1973	Localization of the Roots of a Polynomial (Remark on Algorithm 429) Communications of the ACM 1973 (8); by Edward J. Williams
1973	Complex Gamma Function (Remark and Certification on Algorithm 404) Communications of the ACM 1973 (8); by Gabriela Andrejková, J. Vinar
1973	Clenshaw-Curtis Quadrature (Remark on Algorithm 424) Communications of the ACM 1973 (8); by Albert J. Good
1973	Enumerating Combinations of m Out of n Objects [G6] (Algorithm 452) Communications of the ACM 1973 (8); by C. N. Liu, Donald T. Tang
1973	Chi-Square Quantiles [G1] (Algorithm 451) Communications of the ACM 1973 (8); by Richard B. Goldstein
1973	The Complex Method for Constrained Optimization [E4] (Algorithm 454) Communications of the ACM 1973 (8); by Joel A. Richardson, J. L. Kuester
1973	An Efficient Prime Number Generator (Remark on Algorithm 357) Communications of the ACM 1973 (8); by Richara M. De Morgan
1973	Gaussian Quadrature Formulas for Bromwich's Integral [D1] (Algorithm 453) Communications of the ACM 1973 (8); by Robert Piessens
1973	Graph Plotter (Remark on Algorithm 412) Communications of the ACM 1973 (8); by Richard P. Watkins
1973	Rosenbrock Function Minimization [E4] (Algorithm 450) Communications of the ACM 1973 (8); by Marek Machura, Andrzej Mulawa
1973	Hu-Tucker Minimum Redundancy Alphabetic Coding Method (Remark on Algorithm 428) Communications of the ACM 1973 (8); by J. G. Byrne
1973	DIFSUB for Solution of Ordinary Differential Equations (Certification of Algorithm 407) Communications of the ACM 1973 (7); by Paul J. Nikolai
1973	Solution of Linear Programming Problems in 0-1 Variables [H1] (Algorithm 449) Communications of the ACM 1973 (7); by Frantisek Fiala
1973	Hidden-Line Plotting Program (Remark on Algorithm 420) Communications of the ACM 1973 (7); by Iain D. G. Macleod, Allan M. Collins
1973	Minimal Spanning Tree (Remarks on Algorithm 422) Communications of the ACM 1973 (7); by Brian W. Kernighan
1973	Efficient Algorithms for Graph Manipulation [H] (Algorithm 447) Communications of the ACM 1973 (6); by John E. Hopcroft, Robert Endre Tarjan
1973	Number of Multiply-Restricted Partitions [A1] (Algorithm 448) Communications of the ACM 1973 (6); by Terry Beyer, D. F. Swinehart
1973	Coulomb Wave Functions (Remark on Algorithm 300) Communications of the ACM 1973 (5); by H. Vos
1973	Exact Solution of Linear Equations Using Residue Arithmetic (Remark on Algorithm 406) Communications of the ACM 1973 (5); by Jo Ann Howell
1973	Minit Algorithm for Linear Programming (Remark on Algorithm 333) Communications of the ACM 1973 (5); by B. Holmgren, D. Obradovic, Å. Kolm
1973	Reflection-Free Permutations, Rosary Permutations, and Adjacent Transposition Algorithms Communications of the ACM 1973 (5); by Mohit Kumar Roy
1973	A Sparse Matrix Package (Remark on Algorithm 408) Communications of the ACM 1973 (5); by Arthur H. J. Sale
1973	Maxflow (Remark on Algorithm 324) Communications of the ACM 1973 (5); by G. Bayer
1973	Minit Algorithm for Linear Programming (Remark on Algorithm 333) Communications of the ACM 1973 (5); by D. Obradovic
1973	A Nonrecursive List Moving Algorithm Communications of the ACM 1973 (5); by Edward M. Reingold
1973	Increasing the Efficiency of Quicksort (Remark on Algorithm 402) Communications of the ACM 1973 (5); by Robert E. Wheeler
1973	Greatest Common Divisor of n Integers and Multipliers (Certification of Algorithm 386) Communications of the ACM 1973 (4); by Larry C. Ragland, Donald I. Good
1973	Ten Subroutines for the Manipulation of Chebyshev Series [C1] (Algorithm 446) Communications of the ACM 1973 (4); by R. Broucke
1973	An Algorithm for Extracting Phrases in a Space-Optimal Fashion [Z] (Algorithm 444) Communications of the ACM 1973 (3); by Robert A. Wagner
1973	Binary Pattern Reconstruction from Projections [Z] (Remark on Algorithm 445) Communications of the ACM 1973 (3); by John Lau
1973	Binary Pattern Reconstruction from Projections [Z] (Algorithm 445) Communications of the ACM 1973 (3); by Shi-Kuo Chang
1973	Solution of the Transcendental Equation w*exp(w)=x [C5] (Algorithm A443) Communications of the ACM 1973 (2); by Fred N. Fritsch, R. E. Shafer, W. P. Crowley
1973	Random Deviates from the Dipole Distribution [G5] (Algorithm 441) Communications of the ACM 1973 (1); by Robert E. Knop
1973	A Multidimensional Monte Carlo Quadrature with Adaptive Stratified Sampling [D1] (Algorithm 440) Communications of the ACM 1973 (1); by L. J. Gallaher
1973	Normal Deviate [S14] (Algorithm 442) Communications of the ACM 1973 (1); by G. W. Hill, A. W. Davis

1972 (47)

Computing (general) / Communications of the ACM

1972	Least Squares Surface Fit (Remark on Algorithm 176) Communications of the ACM 1972 (12); by Ernst J. Schuegraf
1972	Product Type Trapezoidal Integration (Algorithm 436) Communications of the ACM 1972 (12); by W. Robert Boland
1972	Product Type Three-point Gauss-Legendre-Simpson's Integration [D1] (Algorithm 439) Communications of the ACM 1972 (12); by W. Robert Boland
1972	Roots of Matrix Pencils (Remark on Algorithm 405) Communications of the ACM 1972 (12); by Richard M. Heiberger
1972	Squank (Certification of Algorithm 379) Communications of the ACM 1972 (12); by P. Hallet, E. Mund
1972	Product Type Two-Point Gauss-Legendre-Simpson's Integration [D1] (Algorithm A438) Communications of the ACM 1972 (12); by W. Robert Boland
1972	Decision Table Translation (Remark on Algorithm 394) Communications of the ACM 1972 (12); by D. R. T. Marshall
1972	Pseudo-Random Numbers [G5] (Certification of Algorithm 266) Communications of the ACM 1972 (12); by Walter L. Sullins
1972	BANDSOLVE (Remark on Algorithm 195) Communications of the ACM 1972 (12); by Ernst J. Schuegraf
1972	Product Type Simpson's Integration [D1] (Algorithm 437) Communications of the ACM 1972 (12); by W. Robert Boland
1972	Remarks on Characteristic Values and Associated Solutions of Mathieus Differential Equation, Exponential Integral, and Systems of Hyperbolic P.D.E. (Remark on Algorithms 352, 385, 392) Communications of the ACM 1972 (12); by Michael J. Frisch
1972	The Conversion of Limited-Entry Decision Tables to Optimal and Near-Optimal Flowcharts: Two New Algorithms Communications of the ACM 1972 (11); by Maurice Verhelst
1972	Modified Incomplete Gamma Function [S14] (Algorithm 435) Communications of the ACM 1972 (11); by Wayne Fullerton
1972	Algorithms To Reveal Properties of Floating-Point Arithmetic Communications of the ACM 1972 (11); by Michael A. Malcolm
1972	A Highly Parallel Algorithm for Approximating All Zeros of a Polynomial with Only Real Zeros Communications of the ACM 1972 (11); by Merrell L. Patrick
1972	Exact Probabilities for R x C Contingency Tables [G2] (Algorithm 434) Communications of the ACM 1972 (11); by David L. March
1972	Interpolation and Smooth Curve Fitting Based on Local Procedures [E2] (Algorithm A433) Communications of the ACM 1972 (10); by Hiroshi Akima
1972	Tableless Date Conversion (Remark on Algorithm 398) Communications of the ACM 1972 (10); by J. Douglas Robertson
1972	Solution of the Matrix Equation AX+XB=C [F4] (Algorithm 432) Communications of the ACM 1972 (9); by Richard H. Bartels, G. W. Stewart
1972	Thinning Algorithms on Rectangular, Hexagonal, and Triangular Arrays Communications of the ACM 1972 (9); by Edward S. Deutsch
1972	Computer Routine for Quadratic and Linear Programming Problems [H] (Algorithm 431) Communications of the ACM 1972 (9); by Arunachalam Ravindran
1972	Localization of the Roots of a Polynomial [C2] (Algorithm 429) Communications of the ACM 1972 (8); by William Squire
1972	Immediate Predominators in a Directed Graph [H] (Algorithm 430) Communications of the ACM 1972 (8); by Paul Walton Purdom Jr., Edward F. Moore
1972	Ancient Babylonian Algorithms Communications of the ACM 1972 (7); by Donald E. Knuth
1972	An Integer Programming Problem (Remark on Algorithm 397) Communications of the ACM 1972 (6); by Stephen C. Johnson, Brian W. Kernighan
1972	Calculation of Fourier Integrals (Remark on Algorithm 418) Communications of the ACM 1972 (6); by Bo Einarsson
1972	Random Vectors Uniform is Solid Angle (Remark on Algorithm 381) Communications of the ACM 1972 (6); by Günther F. Schrack
1972	General Random Number Generator (Remark on Algorithm 370) Communications of the ACM 1972 (6); by Les G. Proll
1972	Special Series Summation with Arbitrary Precision (Remark on Algorithm 393) Communications of the ACM 1972 (6); by Arthur H. J. Sale
1972	Complex Error Function (Certification of Algorithm 363) Communications of the ACM 1972 (6); by Kurt Siegfried Kölbig
1972	Eigenvalues and Eigenvectors of a Real General Matrix (Remark on Algorithm 343) Communications of the ACM 1972 (6); by Herbert Niessner
1972	Clenshaw-Curtis Quadrature [D1] (Algorithm 424) Communications of the ACM 1972 (5); by W. Morven Gentleman
1972	Hu-Tucker Minimum Redundancy Alphabetic Coding Method [Z] (Algorithm 428) Communications of the ACM 1972 (5); by J. Michael Yohe
1972	Merge Sort Algorithm [M1] (Algorithm 426) Communications of the ACM 1972 (5); by Coenraad Bron
1972	Fourier Cosine Integral [D1] (Algorithm 427) Communications of the ACM 1972 (5); by Peter Linz
1972	Generation of Random Correlated Normal Variables [G5] (Algorithm 425) Communications of the ACM 1972 (5); by Rex L. Hurst, Robert E. Knop
1972	Minimal Spanning Tree [H] (Algorithm 422) Communications of the ACM 1972 (4); by V. Kevin M. Whitney
1972	Linear Equation Solver [F4] (Algorithm 423) Communications of the ACM 1972 (4); by Cleve B. Moler
1972	An Implemented Graph Algorithm for Winning Shannon Switching Games Communications of the ACM 1972 (4); by Stephen M. Chase
1972	Complex Gamma Function with Error Control [S14] (Algorithm 421) Communications of the ACM 1972 (4); by Hirondo Kuki
1972	A Note on Cheney's Nonrecursive List-Compacting Algorithm Communications of the ACM 1972 (4); by David C. Walden
1972	Optimizing Binary Trees Grown with a Sorting Algorithm Communications of the ACM 1972 (2); by William A. Martin, David N. Ness
1972	Hidden-Line Plotting Program [J6] (Algorithm 420) Communications of the ACM 1972 (2); by Hugh Williamson
1972	Zeros of a Complex Polynomial [C2] (Algorithm 419) Communications of the ACM 1972 (2); by Michael A. Jenkins, Joseph F. Traub
1972	Unitary Symmetric Polynomials [Z] (Remark on Algorithm 391) Communications of the ACM 1972 (1); by Günther F. Schrack
1972	Calculation of Fourier Integrals [D1] (Algorithm 418) Communications of the ACM 1972 (1); by Bo Einarsson
1972	In-Situ Transposition of a Rectangular Matrix [F1] (Certification of Algorithm 380) Communications of the ACM 1972 (1); by Iain D. G. Macleod

1971 (27)

Computing (general) / Communications of the ACM

1971	Rapid Computation of Weights of Interpolatory Quadrature Rules [D1] (Algorithm 417) Communications of the ACM 1971 (12); by Sven-Åke Gustafson
1971	Rapid Computation of Coefficients of Interpolation Formulas [E1] (Algorithm 416) Communications of the ACM 1971 (12); by Sven-Åke Gustafson
1971	Algorithm for the Assignment Problem (Rectangular Matrices) [H] (Algorithm 415) Communications of the ACM 1971 (12); by François Bourgeois, John-Claude Lassalle
1971	An Extension of the Munkres Algorithm for the Assignment Problem to Rectangular Matrices Communications of the ACM 1971 (12); by François Bourgeois, John-Claude Lassalle
1971	Chebyshev Approximation of Continuous Functions by a Chebyshev System of Functions [E2] (Algorithm 414) Communications of the ACM 1971 (11); by Gene H. Bolub, L. B. Smith
1971	ENTCAF and ENTCRE: Evaluation of Normalized Taylor Coefficients of an Analytic Function [C5] (Algorithm 413) Communications of the ACM 1971 (10); by James N. Lyness
1971	Comment on Cheney's List-Compaction Algorithm Communications of the ACM 1971 (9); by Robert Fenichel
1971	A Stopping Criterion for the Newton-Raphson Method in Implicit Multistep Integration Algorithms for Nonlinear Systems of Ordinary Differential Equations Communications of the ACM 1971 (9); by Werner Liniger
1971	Solution of Simultaneous Nonlinear Equations (Remark on Algorithm 316 [C5]) Communications of the ACM 1971 (7); by William J. Raduchel
1971	An Algorithm for the Blocks and Cutnodes of a Graph Communications of the ACM 1971 (7); by Keith Paton
1971	Three Procedures for the Stable Marriage Problem [H] (Algorithm 411) Communications of the ACM 1971 (7); by D. G. McVitie, L. B. Wilson
1971	Graph Plotter [J6] (Algorithm 412) Communications of the ACM 1971 (7); by Josef Cermak
1971	Numerical Properties of the Ritz-Trefftz Algorithm for Optimal Control Communications of the ACM 1971 (6); by W. E. Bosarge Jr., Olin G. Johnson
1971	Discrete Chebychev Curve Fit [E2] (Algorithm 409) Communications of the ACM 1971 (5); by H. Schmitt
1971	Partial Sorting [M1] (Algorithm 410) Communications of the ACM 1971 (5); by J. M. Chambers
1971	A Sparse Matrix Package (Part I) [F4] (Algorithm 408) Communications of the ACM 1971 (4); by John Michael McNamee
1971	Exact Solution of Linear Equations Using Residue Arithmetic [F4] (Algorithm 406) Communications of the ACM 1971 (3); by Jo Ann Howell
1971	Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm Communications of the ACM 1971 (3); by John G. Williams
1971	DIFSUB for Solution of Ordinary Differential Equations [D2] (Algorithm 407) Communications of the ACM 1971 (3); by C. William Gear
1971	A Scheduling Algorithm for a Computer Assisted Registration System Communications of the ACM 1971 (3); by William K. Winters
1971	Conversion of Limited-Entry Decision Tables to Computer Programs - A Proposed Modification to Pollack's Algorithm Communications of the ACM 1971 (2); by Keith Shwayder
1971	Roots of Matrix Pencils: The Generalized Eigenvalue Problem [F2] (Algorithm 405) Communications of the ACM 1971 (2); by Alice M. Dell, Roman L. Weil, Gerald L. Thompson
1971	Further Evidence for the Analysis of Algorithms for the Zero-One Programming Problem Communications of the ACM 1971 (1); by Les G. Proll
1971	Comment on London's Certification of Algorithm 245 Communications of the ACM 1971 (1); by K. A. Redish
1971	Minit Algorithm For Linear Programming (Remard on Algorithm 222 [H]) Communications of the ACM 1971 (1); by Å. Kolm, T. Dahlstrand
1971	Complex Gamma Function [S14] (Algorithm 404) Communications of the ACM 1971 (1); by C. W. Lucas Jr., C. W. Terrill
1971	Circular Integer Partitioning [A1] (Algorithm 403) Communications of the ACM 1971 (1); by M. W. Coleman, M. S. Taylor

1970 (73)

Computing (general) / Communications of the ACM

1970	Remark on algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix Communications of the ACM 1970 (12); by G. W. Stewart
1970	Remark on algorithm 385: exponential integral Communications of the ACM 1970 (12); by K. A. Redish
1970	Remark on algorithms 352: characteristic values and associated solutions of Mathieu's differential equation Communications of the ACM 1970 (12); by Arthur H. J. Sale
1970	An efficient search algorithm to find the elementary circuits of a graph Communications of the ACM 1970 (12); by James C. Tiernan
1970	A Nonrecursive List Compacting Algorithm Communications of the ACM 1970 (11); by Chris J. Cheney
1970	Algorithms 401: an improved algorithm to produce complex primes Communications of the ACM 1970 (11); by Paul Bratley
1970	Remark on algorithm 343: Eigenvalues and eigenvectors of a real general matrix Communications of the ACM 1970 (11); by William Knight
1970	Remarks on algorithms 372: Algorithm 401: An algorithm to produce complex primes, csieve: an improved algorithm to produce complex primes Communications of the ACM 1970 (11); by Paul Bratley
1970	A multiple-precision division algorithm Communications of the ACM 1970 (11); by Charles J. Mifsud
1970	Algorithms 402: Increasing the efficiency of quicksort Communications of the ACM 1970 (11); by Maarten H. van Emden
1970	Algorithm 399: Spanning tree Communications of the ACM 1970 (10); by Jouko J. Seppänen
1970	Remark on algorithm 304: Normal curve integral Communications of the ACM 1970 (10); by Bo Holmgren
1970	Algorithm 396: Student's t-quantiles Communications of the ACM 1970 (10); by G. W. Hill
1970	Algorithm 397: An integer programming problem Communications of the ACM 1970 (10); by S. K. Chang, Arthur Gill
1970	Algorithm 398: Tableless date conversion Communications of the ACM 1970 (10); by Richard A. Stone
1970	Algorithm 400: Modified Havie integration Communications of the ACM 1970 (10); by George C. Wallick
1970	Remark on algorithm 368: Numerical inversion of Laplace transforms Communications of the ACM 1970 (10); by Harald Stehfest
1970	Algorithm 395: Students t-distribution Communications of the ACM 1970 (10); by G. W. Hill
1970	Remark on algorithm 347: An efficient algorithm for sorting with minimal storage Communications of the ACM 1970 (10); by Richard Peto
1970	Remarks on algorithms with numerical constants Communications of the ACM 1970 (9); by Charles B. Dunham
1970	Algorithm 393: Special series summation with arbitrary precision Communications of the ACM 1970 (9); by S. Kamal Abdali
1970	Algorithm 394: Decision table translation Communications of the ACM 1970 (9); by Robert B. Dial
1970	Algorithms 392: Systems of hyperbolic p.d.e Communications of the ACM 1970 (9); by Robert R. Smith, Dennis McCall
1970	Remark on algorithm 292: Regular Coulomb wave functions Communications of the ACM 1970 (9); by William J. Cody, Kathleen A. Paciorek
1970	Algorithm 391: Unitary symmetric polynomials Communications of the ACM 1970 (8); by John McKay
1970	Remark on Algorithm 233: Simpson's rule for multiple integration Communications of the ACM 1970 (8); by Les G. Proll
1970	Algorithm 389: Binary ordered Walsh functions Communications of the ACM 1970 (8); by H. Hübner, H. Kremer, K. O. Linn, W. Schwering
1970	Algorithm 387: Function mimimization and linear search Communications of the ACM 1970 (8); by K. Fielding
1970	Algorithm 388: Rademacher function Communications of the ACM 1970 (8); by H. Hübner, H. Kremer, K. O. Linn
1970	Algorithm 390: Sequencing ordered Walsh functions Communications of the ACM 1970 (8); by H. Hübner, H. Kremer, K. O. Linn, W. Schwering
1970	Algorithm 331: Gaussian quadrature formulas Communications of the ACM 1970 (8); by William R. Wise Jr.
1970	Algorithm 385: Exponential integral Ei(x) Communications of the ACM 1970 (7); by Kathleen A. Paciorek
1970	Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance Communications of the ACM 1970 (7); by Arthur H. J. Sale
1970	Certification of algorithm 22: Ricatti-Bessel functions of first and second kind Communications of the ACM 1970 (7); by Thomas J. Bray
1970	Certification of algorithm 385: Exponential integral Ei (x) Communications of the ACM 1970 (7); by Edward W. Ng
1970	Algorithm 386: Greatest common divisor of n integers and multipliers Communications of the ACM 1970 (7); by Gordon H. Bradley
1970	Algorithm and bound for the greatest common divisor of n integers Communications of the ACM 1970 (7); by Gordon H. Bradley
1970	Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices Communications of the ACM 1970 (6); by G. W. Stewart
1970	Remark on algorithm 201 [M1]: shellsort Communications of the ACM 1970 (6); by J. P. Chandler, W. C. Harrison
1970	Remark on algorithm 361 [G6]: permanent function of a square matrix I and II Communications of the ACM 1970 (6); by Bruce D. Shriver, Patricia J. Eberlein, R. D. Dixon
1970	Algorithm 382: combinations of M out of N objects [G6] Communications of the ACM 1970 (6); by Phillip J. Chase
1970	Certification of algorithm 245 [M1]: treesort 3: proof of algorithms - a new kind of certification Communications of the ACM 1970 (6); by Ralph L. London
1970	Remark on algorithm 351 [D1]: modified Romberg quadrature Communications of the ACM 1970 (6); by George C. Wallick
1970	Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix Communications of the ACM 1970 (6); by G. W. Stewart
1970	Algorithm 383: permutations of a set with repetitions [G6] Communications of the ACM 1970 (6); by Phillip J. Chase
1970	An algorithm for the construction of bounded-context parsers Communications of the ACM 1970 (5); by Jacques Loeck
1970	Algorithm 381: random vectors uniform in solid angle Communications of the ACM 1970 (5); by Robert E. Knop
1970	Certification of algorithm 263A [H] Communications of the ACM 1970 (5); by Les G. Proll
1970	Algorithm 380: in-situ transposition of a rectangular matrix [F1] Communications of the ACM 1970 (5); by Susan Laflin, M. A. Brebner
1970	Remark on algorithm 380: subroutine to perform in-situ transposition of a rectangular matrix Communications of the ACM 1970 (5); by Ralph Lachenmaier
1970	Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration Communications of the ACM 1970 (4); by M. M. Guignard
1970	Remark on algorithm 353 [D1]: Filon quadrature Communications of the ACM 1970 (4); by Bo Einarsson
1970	Algorithm 379: Squank (Simpson Quadrature used adaptivity - noise killed) [D1] Communications of the ACM 1970 (4); by James N. Lyness
1970	Algorithm 378: discretized Newton-like method for solving a system of simultaneous nonlinear equations [C5] Communications of the ACM 1970 (4); by W. Pankiewicz
1970	Remark on algorithm 351 [D1]: modified Romberg quadrature Communications of the ACM 1970 (4); by N. D. Cook
1970	Remark on algorithm 336 [H]: Netflow Communications of the ACM 1970 (3); by T. A. Bray, Christoph Witzgall
1970	Algorithms 377: Symbolic expansion of algebraic expressions [R2] Communications of the ACM 1970 (3); by Michael J. Levine, Stanley M. Swanson
1970	On an algorithm for nonlinear minimax approximation Communications of the ACM 1970 (3); by G. A. Watson
1970	Certification of algorithm 310 [A1]: prime number generator Communications of the ACM 1970 (3); by Donald G. Rapp, Larry D. Scott
1970	Algorithm 374: Restricted partition generator [A1] Communications of the ACM 1970 (2); by John S. White
1970	Algorithm 376: Least squares fit by f(x) = A cos(Bx+C [E2] Communications of the ACM 1970 (2); by Helmuth Späth
1970	An Efficient Context-Free Parsing Algorithm Communications of the ACM 1970 (2); by Jay Earley
1970	Remark on Algorithm: Algorithm 321 [S14] t-test probabilities and Algorithm 344: students t-distribution Communications of the ACM 1970 (2); by G. W. Hill, Mary Loughhead
1970	Algorithm 375: Fitting data to one exponential [E2] Communications of the ACM 1970 (2); by Helmuth Späth
1970	Algorithm 373: Number of doubly restricted partitions [A1] Communications of the ACM 1970 (2); by John S. White
1970	Certification of algorithm 127 [F5]: Ortho Communications of the ACM 1970 (2); by Ian Barrodale
1970	Certification of algorithm 343 [F1]: eigenvalues and eigenvectors of a real general matrix Communications of the ACM 1970 (2); by H. D. Knoble
1970	Remark on algorithm 282 [S22] derivatives of ex/x, cos(x)/x, and sin (x)/x Communications of the ACM 1970 (1); by Walter Gautschi, Bruce J. Klein
1970	Remark on algorithm 347 [M1]: an efficient algorithm for sorting with minimal storage Communications of the ACM 1970 (1); by Robin Griffin, K. A. Redish
1970	Algorithm 371: Partitions in natural order [A1] Communications of the ACM 1970 (1); by J. K. S. McKay
1970	Algorithm 372: An algorithm to produce complex primes, CSIEVE [A1] Communications of the ACM 1970 (1); by K. B. Dunham
1970	Algorithm 368: Numerical inversion of Laplace transforms [D5] Communications of the ACM 1970 (1); by Harald Stehfest
1970	Algorithm 369: Generator of random numbers satisfying the Poisson distribution [G5] Communications of the ACM 1970 (1); by Henry E. Schaffer

1969 (59)

Computing (general) / Communications of the ACM

1969	Certification of algorithm 229 [B1]: elementary functions by continued fractions Communications of the ACM 1969 (12); by T. A. Bray
1969	Algorithm 364: coloring polygonal regions [Z] Communications of the ACM 1969 (12); by Robert G. Herriot
1969	Certification of algorithm 147 [S14]: PSIF Communications of the ACM 1969 (12); by Ronald G. Parson
1969	Algorithm 366: regression using certain direct product matrices [G2] Communications of the ACM 1969 (12); by P. J. Claringbold
1969	Remark on algorithm 300 [S22]: Coulomb wave functions Communications of the ACM 1969 (12); by Kurt Siegfried Kölbig
1969	Algorithm 367: analysis of variance for balanced experiments [G2] Communications of the ACM 1969 (12); by P. J. Claringbold
1969	Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration Communications of the ACM 1969 (12); by Les G. Proll
1969	Algorithm 365: complex root finding [C5] Communications of the ACM 1969 (12); by Henning Bach
1969	Remark on algorithm 178 [E4]: direct search Communications of the ACM 1969 (11); by Lyle B. Smith
1969	Certification of algorithm 296 [E2]: generalized least squares fit by orthogonal polynomials Communications of the ACM 1969 (11); by Wayne T. Watson
1969	Algorithm 363: complex error function [S15] Communications of the ACM 1969 (11); by Walter Gautschi
1969	Certification of algorithm 47 [S16]: associated Legendre functions of the first kind for real or imaginary arguments Communications of the ACM 1969 (11); by Stanley M. Cobb
1969	Remark on algorithm 178 [E4]: direct search Communications of the ACM 1969 (11); by F. K. Tomlin, Lyle B. Smith
1969	Certification of algorithm 255 [C6]: computation of Fourier coefficients Communications of the ACM 1969 (11); by Gillian Hall, Valeria A. Ray
1969	Algorithm 359: factorial analysis of variance [G1] Communications of the ACM 1969 (11); by John R. Howell
1969	Algorithm 360: shortest-path forest with topological ordering [H] Communications of the ACM 1969 (11); by Robert B. Dial
1969	Algorithm 361: permanent function of a square matrix I and II [G6] Communications of the ACM 1969 (11); by Bruce D. Shriver, Patricia J. Eberlein, R. D. Dixon
1969	Algorithm 362: generation of random permutations [G6] Communications of the ACM 1969 (11); by John Michael Robson
1969	Algorithm 355: an algorithm for generating ising configurations [Z] Communications of the ACM 1969 (10); by J. M. S. Simões-Pereira
1969	Algorithm 356: a prime number generator using the treesort principle [A1] Communications of the ACM 1969 (10); by Richard C. Singleton
1969	Remark on algorithm 304 [S15]: normal curve integral Communications of the ACM 1969 (10); by Arthur G. Adams
1969	Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5] Communications of the ACM 1969 (10); by Peter A. Businger, Gene H. Golub
1969	Algorithm 357: an efficient prime number generator [A1] Communications of the ACM 1969 (10); by Richard C. Singleton
1969	Remark on algorithm 251 [E4]: function minimization Communications of the ACM 1969 (9); by P. A. Hamilton, J. Boothroyd
1969	An algorithm for finding a fundamental set of cycles of a graph Communications of the ACM 1969 (9); by Keith Paton
1969	Certification of algorithm 323 [G6]: generation of permutations in lexicographic order Communications of the ACM 1969 (9); by I. M. Leitch
1969	Algorithm 354: generator of spanning trees [H] Communications of the ACM 1969 (9); by M. Douglas McIlroy
1969	Algorithm 353: Filon quadrature [D1] Communications of the ACM 1969 (8); by Stephen M. Chase, Lloyd D. Fosdick
1969	An algorithm for Filon quadrature Communications of the ACM 1969 (8); by Stephen M. Chase, Lloyd D. Fosdick
1969	Remark on algorithm 268 [R2]: ALGOL 60 reference language editor Communications of the ACM 1969 (7); by G. Sauer
1969	Algorithm 352: characteristic values and associated solutions of Mathieu's differential equation [S22] Communications of the ACM 1969 (7); by Donald S. Clemm
1969	Accelerating LP algorithms Communications of the ACM 1969 (7); by Bennett L. Fox
1969	Remark on algorithm 333 [H]: minit algorithm for linear programming Communications of the ACM 1969 (7); by D. K. Messham
1969	Remark on algorithm 274 [F1]: generation of Hilbert derived test matrix Communications of the ACM 1969 (7); by J. Boothroyd
1969	Certification of algorithm 302 [K2]: transpose vector stored array Communications of the ACM 1969 (6); by Iain D. G. Macleod
1969	Certification of algorithm 328 [F4]: Chebyshev solution to an overdetermined linear system Communications of the ACM 1969 (6); by Norman L. Schreyer
1969	Certification of algorithm 298 [F1]: determination of the square root of a positive definite matrix Communications of the ACM 1969 (6); by B. J. Duke
1969	Remark on algorithm 331: Gaussian quadrature formulas [D1] Communications of the ACM 1969 (5); by I. D. Hill
1969	Remark on algorithm 292 [S22]: regular coulomb wave functions Communications of the ACM 1969 (5); by Walter Gautschi
1969	Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine Communications of the ACM 1969 (5); by Albert Noltemeier
1969	Remark on algorithm 334 [G5]: normal random deviates Communications of the ACM 1969 (5); by Robert E. Knop
1969	Certification of algorithm 300 [S22]: coulomb wave functions Communications of the ACM 1969 (5); by Kurt Siegfried Kölbig
1969	Algorithm 350: simplex method procedure employing Lu decomposition [H] Communications of the ACM 1969 (5); by Richard H. Bartels, Gene H. Golub
1969	Certification of algorithm 292 [S22]: regular coulomb wave functions and of remark on algorithm 292 [S22]: regular coulomb wave functions Communications of the ACM 1969 (5); by Kurt Siegfried Kölbig
1969	An algorithm for hidden line elimination Communications of the ACM 1969 (4); by R. Galimberti
1969	Algorithm 349: polygamma functions with arbitrary precision [S14] Communications of the ACM 1969 (4); by Georges Schwachheim
1969	Algorithm 348: matrix scaling by integer programming [F1] Communications of the ACM 1969 (4); by R. R. Klimpel
1969	An algorithm for solving a special class of tridiagonal systems of linear equations Communications of the ACM 1969 (4); by Donald J. Rose
1969	Algorithm 347: an efficient algorithm for sorting with minimal storage [M1] Communications of the ACM 1969 (3); by Richard C. Singleton
1969	Remark on algorithm 339 [C6]: an algol procedure for the fast fourier transform with arbitrary factors Communications of the ACM 1969 (3); by Richard C. Singleton
1969	Algorithm 346: F-test probabilities [S14] Communications of the ACM 1969 (3); by John Morris
1969	Algorithm 345: an algol convolution procedure based on the fast fourier transform [C6] Communications of the ACM 1969 (3); by Richard C. Singleton
1969	Remark on algorithm 329 [G6]: distribution of indistinguishable objects into distinguishable slots Communications of the ACM 1969 (3); by M. Gray
1969	Remark on algorithm 314 [C5]: finding a solution of N functional equations in N unknowns Communications of the ACM 1969 (1); by James Vandergraft, Charles K. Mesztenyi
1969	Certification of algorithm 165 [S21]: complete elliptic integrals Communications of the ACM 1969 (1); by I. Farkas
1969	Remark on algorithm 337 [C1]: calculation of a polynomial and its derivative values by Horner scheme Communications of the ACM 1969 (1); by Oliver K. Smith
1969	Algorithm 344: student's t-distribution [S14] Communications of the ACM 1969 (1); by David A. Levine
1969	Certification of algorithm 322 [S14] Communications of the ACM 1969 (1); by J. B. F. Field
1969	Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm Communications of the ACM 1969 (1); by S. Y. Ku, R. J. Adler

1968 (46)

Computing (general) / Communications of the ACM

1968	An algorithm for deriving the equations of mathematical physics by symbolic manipulation Communications of the ACM 1968 (12); by James C. Howard, Howard Tashjian
1968	Remarks on algorithm 32: multint: certification of algorithm 32 Communications of the ACM 1968 (12); by Kurt Siegfried Kölbig
1968	Algorithms: Algorithm 342: generator of random numbers satisfying the Poisson distribution Communications of the ACM 1968 (12); by Richard H. Show
1968	Algorithm 343: eigenvalues and eigenvectors of a real general matrix Communications of the ACM 1968 (12); by J. Grad, M. A. Brebner
1968	Analysis of algorithms for the zero-one programming problem Communications of the ACM 1968 (12); by Ronald L. Gue, Kenneth C. Cain, John C. Liggett
1968	Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration Communications of the ACM 1968 (11); by J. L. Byrne, Les G. Proll
1968	Algorithms: Algorithm 340: roots of polynomials by a root-squaring and resultant routine Communications of the ACM 1968 (11); by Albert Noltemeier
1968	Algorithms: Algorithm 339: an algol procedure for the fast Fourier transform with arbitrary factors Communications of the ACM 1968 (11); by Richard C. Singleton
1968	Algorithms: Algorithm 338: algol procedures for the fast Fourier transform Communications of the ACM 1968 (11); by Richard C. Singleton
1968	Letters to the editor: a machine algorithm for processing calendar dates Communications of the ACM 1968 (10); by Henry F. Fliegel, Thomas C. van Flandern
1968	Numerical Analysis: A fast fourier transform algorithm for real-valued series Communications of the ACM 1968 (10); by Glenn David Bergland
1968	Algorithms: Algorithm 336: netflow Communications of the ACM 1968 (9); by T. A. Bray, Christoph Witzgall
1968	Algorithms: Remark on algorithm 248: Netflow Communications of the ACM 1968 (9); by T. A. Bray
1968	Programming Techniques: An algorithm for the probability of the union of a large number of events Communications of the ACM 1968 (9); by G. D. Miller
1968	Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix Communications of the ACM 1968 (9); by Bennett L. Fox, D. M. Landi
1968	Algorithms: Algorithm 337: calculation of a polynomial and its derivative values by Horner scheme Communications of the ACM 1968 (9); by W. Pankiewicz
1968	Algorithms: Remark on algorithm 248: netflow Communications of the ACM 1968 (9); by J. H. Henderson, R. M. Knapp, M. E. Volberding
1968	Algorithms: Remark on algorithm 217: minimum excess cost curve Communications of the ACM 1968 (8); by John F. Muth
1968	Algorithms: Algorithm 335: a set of basic input-output procedures Communications of the ACM 1968 (8); by René de Vogelaere
1968	Remark on algorithm 272: Procedure for the normal distribution functions Communications of the ACM 1968 (7); by M. Donald MacLaren
1968	Algorithm 334: Normal random deviates Communications of the ACM 1968 (7); by James R. Bell
1968	Remark on algorithm 178: Direct search Communications of the ACM 1968 (7); by René de Vogelaere
1968	Algorithms: Algorithm 328: Chebyshev solution to an overdetermined linear system Communications of the ACM 1968 (6); by Richard H. Bartels, Gene H. Golub
1968	Algorithms: Algorithm 331: Gaussian quadrature formulas Communications of the ACM 1968 (6); by Walter Gautschi
1968	Regular Expression Search Algorithm Communications of the ACM 1968 (6); by Ken Thompson
1968	Algorithms: Algorithm 329: Distribution of indistinguishable objects into distinguishable slots Communications of the ACM 1968 (6); by Robert R. Fenichel
1968	Algorithms: Algorithm 333: MINIT algorithm for linear programming Communications of the ACM 1968 (6); by Rodolfo C. Salazar, Subrata K. Sen
1968	Algorithms: Algorithm 330: Factorial analysis of variance Communications of the ACM 1968 (6); by Ian Oliver
1968	Algorithms: Algorithm 332: Jacobi polynomials Communications of the ACM 1968 (6); by Bruno F. W. Whitte
1968	Algorithms: Remark on algorithm 305: Symmetric polynomials Communications of the ACM 1968 (4); by J. K. S. McKay
1968	Algorithms: Algorithm 327: Dilogarithm Communications of the ACM 1968 (4); by Kurt Siegfried Kölbig
1968	Algorithms: Certification of algorithm 299: Chi-squared integral Communications of the ACM 1968 (4); by William M. O'Brien, Joan Wood
1968	Algorithms: Remark on algorithm 293: Transportation problem Communications of the ACM 1968 (4); by G. Bayer
1968	Algorithms: Certification of and remark on algorithm 304: Normal curve integral Communications of the ACM 1968 (4); by A. Bergson
1968	Algorithms: Algorithm 326: Roots of low-order polynomial equations Communications of the ACM 1968 (4); by Terence R. F. Nonweiler
1968	Letters to the editor: On practicality of sieving techniques vs. the sieving algorithm Communications of the ACM 1968 (3); by John E. Howland
1968	Letters to the editor: Dealing with Neely's algorithms Communications of the ACM 1968 (3); by Anton J. Van Reeken
1968	Letters to the editor: In defense of Langdon's algorithm Communications of the ACM 1968 (3); by B. E. Rodden
1968	Algorithms: Algorithm 325: Adjustment of the inverse of a symmetric matrix when two symmetric elements are changed Communications of the ACM 1968 (2); by Gerhard Zielke
1968	Algorithms: Algorithm 320: Harmonic analysis for symmetrically distributed data Communications of the ACM 1968 (2); by D. B. Hunter
1968	Algorithms: Algorithm 323: Generation of permutations in lexicographic order Communications of the ACM 1968 (2); by R. J. Ord-Smith
1968	Algorithms: Algorithm 324: Maxflow Communications of the ACM 1968 (2); by G. Bayer
1968	Remark on algorithm 291: Logarithm of gamma function Communications of the ACM 1968 (1); by M. R. Hoare
1968	Remark on algorithm 307: Symmetric group characters Communications of the ACM 1968 (1); by J. K. S. McKay
1968	Algorithms: Algorithm 319: Triangular factors of modified matrices Communications of the ACM 1968 (1); by David R. Green
1968	Certification of algorithm 196: Muller's method for finding roots of an arbitrary function Communications of the ACM 1968 (1); by Virginia W. Whitley

1967 (50)

Computing (general) / Communications of the ACM

1967	Algorithm 318: Chebyschev curve-fit Communications of the ACM 1967 (12); by J. Boothroyd
1967	Algorithms for finding a fundamental set of cycles for an undirected linear graph Communications of the ACM 1967 (12); by C. C. Gotlieb, Derek G. Corneil
1967	Algorithm 317: Permutation Communications of the ACM 1967 (11); by Charles L. Robinson
1967	Algorithm 316: Solution of simultaneous non-linear equations Communications of the ACM 1967 (11); by Kenneth M. Brown
1967	Algorithm 315: The damped Taylor's series method for minimizing a sum of squares and for solving systems of nonlinear equations Communications of the ACM 1967 (11); by Helmuth Späth
1967	Algorithm 314: Finding a solution of N functional equations in N unknowns Communications of the ACM 1967 (11); by D. B. Dulley, Michael L. V. Pitteway
1967	Remark on Langdon's algorithm Communications of the ACM 1967 (11); by R. J. Ord-Smith
1967	Algorithm 312: Absolute value and square root of a complex number Communications of the ACM 1967 (10); by Paul Friedland
1967	Algorithm 313: Multi-dimensional partition generator Communications of the ACM 1967 (10); by Paul Bratley, J. K. S. McKay
1967	Algorithm 310: Prime number generator 1 Communications of the ACM 1967 (9); by Bruce A. Chartres
1967	An algorithm for class scheduling with section preference Communications of the ACM 1967 (9); by Vincent A. Busam
1967	Algorithm 311: Prime number generator 2 Communications of the ACM 1967 (9); by Bruce A. Chartres
1967	Algorithm 309: Gamma function with arbitrary precision Communications of the ACM 1967 (8); by Antonino Machado Souza Filho, Georges Schwachheim
1967	On compiling algorithms for arithmetic expressions Communications of the ACM 1967 (8); by Ikuo Nakata
1967	Algorithm 308 Generation of the permutations in psedo-lexicographic order Communications of the ACM 1967 (7); by R. J. Ord-Smith
1967	Remarks on algorithm 87, 102, 130, 202: generation of permutations in lexicographical order Communications of the ACM 1967 (7); by R. J. Ord-Smith
1967	Algorithm 306: permutations with repetitions Communications of the ACM 1967 (7); by Paul Bratley
1967	Description of basic algorithm DETAB/65 preprocessor Communications of the ACM 1967 (7); by Michael D. Callahan, Anson E. Chapman
1967	Certification of algorithm 285: the mutual primal-dual method Communications of the ACM 1967 (7); by Helmuth Späth
1967	Remark on algorithm 301: Airy function Communications of the ACM 1967 (7); by Michael L. V. Pitteway
1967	Certification of algorithm 258: transport and algorithm 293: transportation problem Communications of the ACM 1967 (7); by Lee S. Sims
1967	Algorithms 307: Symmetric group characters Communications of the ACM 1967 (7); by J. K. S. McKay
1967	Algorithm 305: symmetric polynomial Communications of the ACM 1967 (7); by Paul Bratley, J. K. S. McKay
1967	Certification of Algorithm 253: Eigenvalues of a real symmetric matrix by the QR method Communications of the ACM 1967 (6); by John H. Welsch
1967	Remarks on Algorithm 123: Real error function, ERF (x) Communications of the ACM 1967 (6); by Martin Crawford, Robert Techo
1967	Algorithm 304: Normal curve integral Communications of the ACM 1967 (6); by I. D. Hill, S. A. Joyce
1967	A generalized Bairstow algorithm Communications of the ACM 1967 (6); by Gene H. Golub, T. N. Robertson
1967	Certification of Algorithm 254: Eigenvalues and Eigenvectors of a real symmetric matrix by the QR method Communications of the ACM 1967 (6); by John H. Welsch
1967	Remarks on Algorithm 181: Complementary error function - large X Communications of the ACM 1967 (6); by Henry C. Thacher Jr.
1967	Remarks on Algorithm 180: Error function - large X Communications of the ACM 1967 (6); by Henry C. Thacher Jr.
1967	Remarks on Algorithm 296: Generalized least squares fit by orthogonal polynomials Communications of the ACM 1967 (6); by G. J. Makinson
1967	Algorithm 303: An adaptive quadrature procedure with random panel sizes Communications of the ACM 1967 (6); by L. J. Gallaher
1967	Remarks on Algorithm 209: Gauss Communications of the ACM 1967 (6); by D. Ibbetson
1967	Remarks on Algorithm 226: Normal distribution function Communications of the ACM 1967 (6); by Sven J. Cyvin
1967	Algorithm 304: Normal curve integral Communications of the ACM 1967 (6); by I. D. Hill, S. A. Joyce
1967	Algorithm 272: Procedure for the normal distribution function Communications of the ACM 1967 (6); by M. Donald MacLaren
1967	Remark on Algorithm 179: Incomplete Beta ratio Communications of the ACM 1967 (6); by Malcolm C. Pike, I. D. Hill
1967	Algorithm 302: Transpose vector stored array Communications of the ACM 1967 (5); by J. Boothroyd
1967	Remark on Algorithm 28: Least squares fit by orthogonal polynomials Communications of the ACM 1967 (5); by G. J. Makinson
1967	Algorithm 301: Airy function Communications of the ACM 1967 (5); by Gillian Bond, Michael L. V. Pitteway
1967	An algorithm for generating permutations Communications of the ACM 1967 (5); by Glen G. Langdon Jr.
1967	Certification of Algorithm 30: Numerical solution of the polynomial equation Communications of the ACM 1967 (5); by John J. Kohfeld
1967	Certification of Algorithm 279: Chebyshev quadrature Communications of the ACM 1967 (5); by Kenneth E. Hillstrom
1967	Algorithm 300: Coulomb wave functions Communications of the ACM 1967 (4); by J. H. Gunn
1967	Algorithm 299: Chi-squared integral Communications of the ACM 1967 (4); by I. D. Hill, Malcolm C. Pike
1967	An algorithm for generating root locus diagrams Communications of the ACM 1967 (3); by Allan M. Krall, Robert Fornaro
1967	Remark on Algorithm 281: Abscissas and weights for Romberg quadrature Communications of the ACM 1967 (3); by J. Boothroyd
1967	Algorithm 297: Eigenvalues and Eigenvectors of the symmetric system Communications of the ACM 1967 (3); by J. Boothroyd
1967	Algorithm 296: Generalized least squares fit by orthogonal polynomials Communications of the ACM 1967 (2); by G. J. Makinson
1967	Algorithm 295: Exponential curve fit Communications of the ACM 1967 (2); by Helmuth Späth

1966 (49)

Computing (general) / Communications of the ACM

1966	Algorithm 293: transportation problem Communications of the ACM 1966 (12); by G. Bayer
1966	Certification of algorithm 257: Havie integrator Communications of the ACM 1966 (11); by Kenneth E. Hillstrom
1966	Algorithm 292: regular Coulomb wave functions Communications of the ACM 1966 (11); by Walter Gautschi
1966	Remark on algorithm 286: examination scheduling Communications of the ACM 1966 (11); by R. Williams
1966	Certification of algorithm 251: function minimisation Communications of the ACM 1966 (9); by R. Fletcher
1966	Certification of algorithm 41: evaluation of determinant and algorithm 269: determinant evaluation Communications of the ACM 1966 (9); by A. Bergson
1966	Algorithm 290: linear equations, exact solutions Communications of the ACM 1966 (9); by J. Boothroyd
1966	Algorithm 291: logarithm of gamma function Communications of the ACM 1966 (9); by Malcolm C. Pike, I. D. Hill
1966	Remark on algorithm 256: modified Graeffe method Communications of the ACM 1966 (9); by G. Stern
1966	Remark on algorithm 178 [E4] direct search Communications of the ACM 1966 (9); by M. Bell, Malcolm C. Pike
1966	Remark on algorithm 266: pseudo-random numbers Communications of the ACM 1966 (9); by Malcolm C. Pike, I. D. Hill
1966	Remarks on: algorithms 34, 54, 80, 221, and 291 Communications of the ACM 1966 (9); by Malcolm C. Pike, I. D. Hill
1966	Remark on algorithm 266: psuedo-random numbers Communications of the ACM 1966 (9); by L. Hansson
1966	Experience with FORMAC algorithm design Communications of the ACM 1966 (8); by Robert G. Tobey
1966	Algorithm 288: solution of simultaneous linear Diophantine equations [F4] Communications of the ACM 1966 (7); by W. A. Blankinship
1966	Algorithm 287: matrix triangulation with integer arithmetic [F1] Communications of the ACM 1966 (7); by W. A. Blankinship
1966	Algorithm 289: confidence interval for a ratio [G1] Communications of the ACM 1966 (7); by I. D. Hill, Malcolm C. Pike
1966	An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system Communications of the ACM 1966 (7); by Eugene D. Homer
1966	Convergence of the Q-R algorithm for Hessenberg matrices Communications of the ACM 1966 (7); by Beresford N. Parlett
1966	Comparison of several algorithms for computation of means, standard deviations and correlation coefficients Communications of the ACM 1966 (7); by Peter M. Neely
1966	An algorithm for retrieving indexed documents and its application Communications of the ACM 1966 (7); by Allan J. Humphrey, Shelby L. Brumelle
1966	Remark on Algorithm 279: Chebyshev quadrature Communications of the ACM 1966 (6); by F. R. A. Hopgood, C. Litherland
1966	Algorithm 286: Examination scheduling Communications of the ACM 1966 (6); by John E. L. Peck, Michael R. Williams
1966	A Monte Carlo algorithm for assigning students to classes Communications of the ACM 1966 (5); by Nathaniel Macon, E. E. Walker
1966	A simple algorithm for computing the generalized inverse of a matrix Communications of the ACM 1966 (5); by B. Rust, W. R. Burrus, C. Schneeberger
1966	Certification of Algorithm 271: Quickersort Communications of the ACM 1966 (5); by Charles R. Blair
1966	Corrections to numerical data on Q-D algorithm Communications of the ACM 1966 (5); by Richard F. Thomas, Peter Henrici
1966	Algorithm 285: The mutual primal-dual method Communications of the ACM 1966 (5); by Thomas J. Aird
1966	A note on linear programming algorithm design: a combinatorial problem Communications of the ACM 1966 (5); by P. B. M. Roes
1966	Algorithm 284: Interchange of two blocks of data Communications of the ACM 1966 (5); by William Fletcher, Roland Silver
1966	ACM Algorithm 284: Interchange of Two Blocks of Data Communications of the ACM 1966 (5); by William Fletcher
1966	Algorithms for scientific computation Communications of the ACM 1966 (4); by George E. Forsythe
1966	Algorithm 281: Abscissas and weights for Romberg quadrature Communications of the ACM 1966 (4); by John H. Welsch
1966	Remark on Algorithm 218: Kutta-Merson Communications of the ACM 1966 (4); by G. Bayer
1966	Certification of Algorithm 9: Runge-Kutta integration Communications of the ACM 1966 (4); by Henry C. Thacher Jr.
1966	An algorithm for generating projective reduction formulas for matrix elements of many-electron wavefunctions Communications of the ACM 1966 (4); by C. M. Reeves
1966	Algorithm 282: Derivatives of e x /x, cos (x)/x, AND sin (x)/x Communications of the ACM 1966 (4); by Walter Gautschi
1966	Algorithm 280: Abscissas and weights for Gregory quadrature Communications of the ACM 1966 (4); by John H. Welsch
1966	Algorithm 283: Simultaneous displacement of polynomial roots if real and simple Communications of the ACM 1966 (4); by Immo O. Kerner
1966	Algorithms section policy Communications of the ACM 1966 (4); by John G. Herriot
1966	Algorithm 279: Chebyshev quadrature Communications of the ACM 1966 (4); by F. R. A. Hopgood, C. Litherland
1966	On comparison of the algorithms for linear programming Communications of the ACM 1966 (3); by Reginald P. Tewarson
1966	Algorithm 277: Computation of Chebyshev series coefficients Communications of the ACM 1966 (2); by Lyle B. Smith
1966	Algorithm 275: Exponential curve fit Communications of the ACM 1966 (2); by Gerhard R. Deily
1966	Algorithm 276: constrained exponential curve fit Communications of the ACM 1966 (2); by Gerhard R. Deily
1966	Algorithm 278: Graph plotter Communications of the ACM 1966 (2); by P. Lloyd
1966	Algorithm 273: Serrev Communications of the ACM 1966 (1); by Henry C. Thacher Jr.
1966	Certification of algorithm 56: Complete elliptic integral of the second kind Communications of the ACM 1966 (1); by Gerhard Meidell Larssen
1966	Algorithm 274: Generation of Hilbert derived test matrix Communications of the ACM 1966 (1); by J. Boothroyd

1965 (50)

Computing (general) / Communications of the ACM

1965	Algorithm 272: procedure for the normal distribution functions Communications of the ACM 1965 (12); by M. Donald MacLaren
1965	Algorithm 271: quickersort Communications of the ACM 1965 (11); by Roger S. Scowen
1965	Algorithm 269: determinant evaluation [F3] Communications of the ACM 1965 (11); by Jaroslav Pfann, Josef Straka
1965	Remark on algorithm 250 [G6]: inverse permutation Communications of the ACM 1965 (11); by C. W. Medlock
1965	An algorithm for minimizing backboard wiring functions Communications of the ACM 1965 (11); by Tomaso Pomentale
1965	Algorithm 270: finding eigenvectors by Gaussian elimination [F2] Communications of the ACM 1965 (11); by Albert Newhouse
1965	A comparison of the primal-simplex and primal-dual algorithms for linear programming Communications of the ACM 1965 (11); by R. K. Mueller, Leon Cooper
1965	Algorithm 268: ALGOL 60 reference language editor [R2] Communications of the ACM 1965 (11); by William M. McKeeman
1965	Algorithm 265: find precedence functions [L2] Communications of the ACM 1965 (10); by Niklaus Wirth
1965	Algorithm 267: random normal deviate [G5] Communications of the ACM 1965 (10); by Malcolm C. Pike
1965	Letters to the editor: on procedures for constructing structural descriptions for three parsing algorithms Communications of the ACM 1965 (10); by Timothy V. Griffiths
1965	Algorithm 263 Gomory 1 [H] Communications of the ACM 1965 (10); by Hans Langmaack
1965	Algorithm 264: interpolation in a table [E1] Communications of the ACM 1965 (10); by James Stafford
1965	Algorithm 266: pseudo-random numbers [G5] Communications of the ACM 1965 (10); by Malcolm C. Pike, I. D. Hill
1965	Certification of algorithm 200 [G5] normal random Communications of the ACM 1965 (9); by Malcolm C. Pike
1965	Certification of algorithm 202 [G6] generation of permutations in lexicographical order Communications of the ACM 1965 (9); by Roger W. Elliott
1965	Finding zeros of a polynomial by the Q-D algorithm Communications of the ACM 1965 (9); by Peter Henrici, Bruce O. Watkins
1965	Certification of algorithm 121 [G5] Normdev Communications of the ACM 1965 (9); by Malcolm C. Pike
1965	Algorithms: ACM Algorithm 259: Legendre Functions for arguments larger than one Communications of the ACM 1965 (8); by Walter Gautschi
1965	Algorithm 264: Map of partitions into integers Communications of the ACM 1965 (8); by J. K. S. McKay
1965	Algorithm 259: Legendre functions for arguments larger than one Communications of the ACM 1965 (8); by John G. Herriot
1965	Algorithm 263: Partition generator Communications of the ACM 1965 (8); by J. K. S. McKay
1965	Algorithm 261: 9-J symbols Communications of the ACM 1965 (8); by J. H. Gunn
1965	Algorithm 262: Number of restricted partitions of N Communications of the ACM 1965 (8); by J. K. S. McKay
1965	Algorithm 260: 6-J symbols Communications of the ACM 1965 (8); by J. H. Gunn
1965	Remark on algorithm 235 [G6]: random permutation Communications of the ACM 1965 (7); by Malcolm C. Pike
1965	Remark on algorithm 258 [H]: transport Communications of the ACM 1965 (7); by G. Bayer
1965	Certification of algorithm 245 [M1]: TREESORT Communications of the ACM 1965 (7); by Philip S. Abrams
1965	Certification of algorithm 246: graycode Communications of the ACM 1965 (6); by William D. Allen
1965	Algorithm 257: Havie integrator Communications of the ACM 1965 (6); by Robert N. Kubik
1965	Algorithm 256: modified Graeffe method [C2] Communications of the ACM 1965 (6); by Albert A. Grau
1965	Algorithm 258: transport Communications of the ACM 1965 (6); by G. Bayer
1965	Certification of algorithm 243 [B3]: logarithm of a complex number Communications of the ACM 1965 (5); by J. Boothroyd
1965	Algorithm 255: computation of Fourier coefficients Communications of the ACM 1965 (5); by Linda Teijelo
1965	Certification of algorithm 21 [S17]: Bessel function for a set of integer orders Communications of the ACM 1965 (4); by James Stafford
1965	Algorithm 253 [F2]: eigenvalues of real symmetric matrix by the QR method Communications of the ACM 1965 (4); by Peter A. Businger
1965	Algorithm 254 [F2]: eigenvalues and eigenvectors of a real symmetric matrix by the QR method Communications of the ACM 1965 (4); by Peter A. Businger
1965	Remark on algorithm 231 [F1]: matrix inversion Communications of the ACM 1965 (4); by Mats Ferring
1965	Remark on algorithm 145 [D1]: adaptive numerical integration by Simpson's rule Communications of the ACM 1965 (3); by Malcolm C. Pike
1965	Remark on algorithm 205 [E4]: ATIVE Communications of the ACM 1965 (3); by E. J. Wasscher
1965	Algorithm 251: function minimisation [E4] Communications of the ACM 1965 (3); by M. Wells
1965	Certification of algorithm 139 [A1]: solutions of the diophantine equation Communications of the ACM 1965 (3); by Henry J. Bowlden
1965	Certification of algorithm 203 [E4]: STEEP1 Communications of the ACM 1965 (3); by James M. Varah
1965	Remark on algorithm 206 [B1]: arccossin Communications of the ACM 1965 (2); by Henry J. Bowlden
1965	Algorithm 248: netflow [H] Communications of the ACM 1965 (2); by William A. Briggs
1965	Certification of algorithm 234 [S23]: Poisson-Charlier polynomials Communications of the ACM 1965 (2); by Paul A. Samet
1965	Remark on algorithm 135 [F4]: CROUT with equilibration and iteration Communications of the ACM 1965 (2); by Loren P. Meissner
1965	Certification of algorithm 236 [S17]: Bessel functions of the first kind Communications of the ACM 1965 (2); by Walter Gautschi
1965	Algorithm 250: inverse permutation [G6] Communications of the ACM 1965 (2); by B. H. Boonstra
1965	Algorithm 249: outreal N [15] Communications of the ACM 1965 (2); by Niklaus Wirth

1964 (55)

Computing (general) / Communications of the ACM

1964	Algorithm 247: Radical-inverse quasi-random point sequence Communications of the ACM 1964 (12); by J. H. Halton, G. B. Smith
1964	ACM Algorithm 246: Graycode Communications of the ACM 1964 (12); by J. Boothroyd
1964	Certification of algorithm 181: Complementary error function - large X Communications of the ACM 1964 (12); by I. Clausen, L. Hansson
1964	Certification of algorithm 237: Greatest common divisor Communications of the ACM 1964 (12); by T. A. Bray
1964	Certification of algorithm 224: Evaluation of determinant Communications of the ACM 1964 (12); by Vic Hasselblad, Jeff Rulifson
1964	Algorithm 245: Treesort Communications of the ACM 1964 (12); by Robert W. Floyd
1964	On an algorithm for minimum-cost procedures Communications of the ACM 1964 (11); by James R. Slagle
1964	Certification of algorithm 199: conversions between calendar date and Julian day number Communications of the ACM 1964 (11); by David K. Oppenheim
1964	Algorithm 243: Logarithm of a complex number[B3] rewrite of algorithm 48 Communications of the ACM 1964 (11); by David S. Collens
1964	Algorithm 244: Fresnel integrals Communications of the ACM 1964 (11); by Helmut Lotsch, Malcolm D. Gray
1964	Certification of algorithm 213: Fresnel integrals Communications of the ACM 1964 (11); by Malcolm D. Gray
1964	Algorithm 242: Permutations of a set with repetitions Communications of the ACM 1964 (10); by T. W. Sag
1964	Certification algorithm 225: Gamma function with controlled accuracy Communications of the ACM 1964 (10); by T. A. Bray
1964	Certification of Algorithm 207: Stringsort Communications of the ACM 1964 (10); by Charles R. Blair
1964	Certification of algorithm 221: Gamma function Communications of the ACM 1964 (10); by Van K. McCombs
1964	Certification of algorithm 203: Steep1 Communications of the ACM 1964 (10); by Philip Wallack
1964	Certification of algorithm 218: Kutta Merson Communications of the ACM 1964 (10); by Karen Boreman Priebe
1964	Algorithm 240: Coordinates on an ellipsoid Communications of the ACM 1964 (9); by Egon Dorrer
1964	Algorithm 241: Arctangent Communications of the ACM 1964 (9); by K. W. Mills
1964	ACM Algorithm 236: Bessel Functions of the First Kind Communications of the ACM 1964 (8); by Walter Gautschi
1964	Remark on remarks on algorithm 48: of a complex number Communications of the ACM 1964 (8); by David S. Collens
1964	Algorithm 237: Greatest common divisor Communications of the ACM 1964 (8); by John E. L. Peck
1964	In defense of the equivalence algorithm Communications of the ACM 1964 (8); by Bernard A. Galler, Michael J. Fischer
1964	Remark on algorithm 162: Near-minimax polynomial approximations and partitioning of intervals Communications of the ACM 1964 (8); by W. Fraser, J. F. Hart
1964	Remark on algorithm 162: XY move plotting Communications of the ACM 1964 (8); by D. K. Cavin
1964	Algorithm 239: Free field read Communications of the ACM 1964 (8); by William M. McKeeman
1964	Certification of algorithm 209: Gauss Communications of the ACM 1964 (8); by Malcolm C. Pike
1964	Algorithm 238: Conjugate gradient method Communications of the ACM 1964 (8); by C. M. Reeves
1964	Algorithm 235: Random permutation Communications of the ACM 1964 (7); by Richard Durstenfeld
1964	Remark on algorithm 135: Crout with equilibration and iteration Communications of the ACM 1964 (7); by William M. McKeeman
1964	Algorithm 234: Poisson-Charlier polynomials Communications of the ACM 1964 (7); by J. M. S. Simões-Pereira
1964	Certification on algorithm 128: Summation of Fourier series Communications of the ACM 1964 (7); by Henry C. Thacher Jr.
1964	Remark on algorithm 60: Romberg integration Communications of the ACM 1964 (7); by Henry C. Thacher Jr.
1964	Algorithms Communications of the ACM 1964 (6); by George E. Forsythe
1964	Algorithm 227: Chebyshev polynomial coefficients Communications of the ACM 1964 (5); by Sven J. Cyvin
1964	Remarks on algorithm 91: Chebyshev curve fit Communications of the ACM 1964 (5); by Peter Naur
1964	Algorithm 226: Normal distribution function Communications of the ACM 1964 (5); by Sven J. Cyvin
1964	Algorithm 229: Elementary functions by continued fractions Communications of the ACM 1964 (5); by James C. Morelock
1964	Certification of Algorithm 215: Shanks Communications of the ACM 1964 (5); by Larry L. Schumaker
1964	Remark on algorithm 175: Shuttle sort Communications of the ACM 1964 (5); by Otto C. Juelich
1964	An improved equivalence algorithm Communications of the ACM 1964 (5); by Bernard A. Galler, Michael J. Fischer
1964	Algorithm 225: Gamma function with controlled accuracy Communications of the ACM 1964 (5); by Sven J. Cyvin, Bjørg N. Cyvin
1964	Certification of algorithm 146: Multiple integration Communications of the ACM 1964 (5); by Niklaus Wirth
1964	Algorithm 223: Prime twins Communications of the ACM 1964 (4); by M. Shimrat
1964	Algorithm 224: Evaluation of determinant Communications of the ACM 1964 (4); by Leo J. Rotenberg
1964	Certification of algorithm 222: Incomplete beta function ratios Communications of the ACM 1964 (4); by Walter Gautschi
1964	An algorithm for converting integers from base a to base b Communications of the ACM 1964 (4); by Harmon T. Galdwin
1964	Certification of algorithm 182: Nonrecursive adaptive integration Communications of the ACM 1964 (4); by William M. McKeeman, Lawrence G. Tesler, Harold S. Butler
1964	Certification of algorithm 122: Tridiagonal matrix Communications of the ACM 1964 (3); by Peter Naur
1964	Remark on algorithm 123 Communications of the ACM 1964 (3); by Stephen P. Barton, John F. Wagner
1964	A note on some compiling algorithms Communications of the ACM 1964 (3); by James P. Anderson
1964	Certification of algorithm 197: Matrix division Communications of the ACM 1964 (3); by Mark B. Wells
1964	Algorithm 221: Gamma functions Communications of the ACM 1964 (3); by Walter Gautschi
1964	Algorithm 222: Incomplete beta functions ratios Communications of the ACM 1964 (3); by Walter Gautschi
1964	Certification of algorithm 150: SYMINV2 Communications of the ACM 1964 (3); by Peter Naur

1963 (134)

Computing (general) / Communications of the ACM

1963	Algorithm 216: SMOOTH Communications of the ACM 1963 (11); by Richard George
1963	Certification of algorithm 8: Euler summation Communications of the ACM 1963 (11); by Henry C. Thacher Jr.
1963	An error-correcting parse algorithm Communications of the ACM 1963 (11); by Edgar T. Irons
1963	Remark on algorithm 77: interpolation, differentiation, and integration Communications of the ACM 1963 (11); by Paul E. Hennion
1963	Certification of algorithm 27: assignment Communications of the ACM 1963 (10); by Albert Newhouse
1963	Certification of algorithm 173: assign Communications of the ACM 1963 (10); by Roger S. Scowen
1963	Remark on algorithms 88, 89, and 90 evaluation of the Fresnel integrals Communications of the ACM 1963 (10); by Malcolm D. Gray
1963	Remark on algorithm 123: ERF Communications of the ACM 1963 (10); by D. Ibbetson
1963	Algorithm 213: Fresnel integrals Communications of the ACM 1963 (10); by Malcolm D. Gray
1963	Partioning algorithms for finite sets Communications of the ACM 1963 (10); by George Hutchinson
1963	Certification of algorithm 173: assign Communications of the ACM 1963 (10); by Z. Filsak, L. Vrchoveká
1963	Algorithm 211: Hermite interpolation Communications of the ACM 1963 (10); by George R. Schubert
1963	Algorithm 208: discrete convolution Communications of the ACM 1963 (10); by William T. Foreman Jr.
1963	Certification of algorithm 210: Hermite interpolation Communications of the ACM 1963 (10); by Thomas A. Dwyer
1963	Algorithm 207: stringsort Communications of the ACM 1963 (10); by J. Boothroyd
1963	Remark on algorithm 157: Fourier series approximation Communications of the ACM 1963 (10); by George R. Schubert
1963	Certification of algorithm 175: shuttlesort Communications of the ACM 1963 (10); by George R. Schubert
1963	Algorithm 212: frequency distribution Communications of the ACM 1963 (10); by Malcolm D. Gray
1963	Certification of algorithm 161: combinatorial of M things taken one at a time, two at a time, up to N at time Communications of the ACM 1963 (10); by David H. Collins
1963	Algorithm 209: Gauss Communications of the ACM 1963 (10); by D. Ibbetson
1963	Certification of algorithm 160 combinatorial of M things taken N at a time Communications of the ACM 1963 (10); by Robert F. Blakely
1963	Algorithm 210: Lagrangian interpolation Communications of the ACM 1963 (10); by George R. Schubert
1963	Algorithm 204: STEEP2 Communications of the ACM 1963 (9); by E. J. Wasscher
1963	Remark on algorithm 129 minifun : minifun Communications of the ACM 1963 (9); by E. J. Wasscher
1963	Certification of algorithm 41: evaluation of determinant Communications of the ACM 1963 (9); by Bruce H. Freed
1963	Certification of algorithm 158: exponentiation of series Communications of the ACM 1963 (9); by J. Dennis Lawrence
1963	Certification of algorithm 163: modified Hankel function Communications of the ACM 1963 (9); by Henry C. Thacher Jr.
1963	Remark on algorithm 157: Fourier series approximation Communications of the ACM 1963 (9); by Richard George
1963	Algorithm 202: generation of permutations in lexicographical order Communications of the ACM 1963 (9); by Mok-Kong Shen
1963	Algorithm 206: ARCCOSIN Communications of the ACM 1963 (9); by Misako Konda
1963	Algorithm 203: STEEP1 Communications of the ACM 1963 (9); by E. J. Wasscher
1963	Algorithm 205: ATIVE Communications of the ACM 1963 (9); by J. G. A. Haubrich
1963	Algorithm 41, revision evaluation of determinant Communications of the ACM 1963 (9); by Bruce H. Freed
1963	Remark on algorithm 166: MonteCarlo inverse Communications of the ACM 1963 (9); by Robert D. Rodman
1963	Certification of algorithm 167: calculation of confluent divided differences Communications of the ACM 1963 (9); by Henry C. Thacher Jr.
1963	Certification of algorithm 45: interest Communications of the ACM 1963 (9); by Carl B. Wright
1963	Certification of algorithm 169: Newton interpolation with forward divided differences Communications of the ACM 1963 (9); by Henry C. Thacher Jr.
1963	Certification of algorithm 168: Newton interpolation with backward divided differences Communications of the ACM 1963 (9); by Henry C. Thacher Jr.
1963	Certification of algorithm 43: crout II Communications of the ACM 1963 (8); by Carlos Domingo, F. Rodriquez-Gil
1963	Certification of algorithm 140: matrix inversion Communications of the ACM 1963 (8); by Richard George
1963	Certification of algorithm 47: associated Legendre functions of the first kind for real or imaginary arguments Communications of the ACM 1963 (8); by Richard George
1963	Certification of algorithm 153: GOMORY Communications of the ACM 1963 (8); by B. Lefkowitz
1963	Certification of algorithm 162: xymove plotting Communications of the ACM 1963 (8); by William E. Fletcher
1963	Certification of algorithm 38: telescope 2 Communications of the ACM 1963 (8); by James F. Bridges
1963	Remark on algorithm 170: reduction of a matrix containing polynomial elements Communications of the ACM 1963 (8); by Paul E. Hennion
1963	Algorithm 195: BANDSOLVE Communications of the ACM 1963 (8); by Donald H. Thurnau
1963	Algorithm 198: adaptive integration and multiple integration Communications of the ACM 1963 (8); by William M. McKeeman
1963	Remark on algorithm 77: interpolation, differentiation, and integration Communications of the ACM 1963 (8); by Paul E. Hennion
1963	Certification of algorithm 85: Jacobi Communications of the ACM 1963 (8); by Peter Naur
1963	Algorithm 196: Muller's method for finding roots of an abitrary function Communications of the ACM 1963 (8); by Robert D. Rodman
1963	Certification of algorithm 164: orthogonal polynomial least squares surface fit Communications of the ACM 1963 (8); by C. V. Bitterli
1963	Additional remarks on algorithm 52: a set of test matrices Communications of the ACM 1963 (8); by Peter Naur
1963	Certification of algorithms 63, 64 and 65, partition, quicksort, and find Communications of the ACM 1963 (8); by Brian Randell, L. J. Russell
1963	Certification of algorithm 156: algebra of sets Communications of the ACM 1963 (8); by K. M. Bosworth
1963	Correction to earlier remarks on algorithm 42 invert, alg. 107 Gauss's method, alg 120 inversion II, and gjr Communications of the ACM 1963 (8); by Peter Naur
1963	Algorithm 199: conversions between calendar date and Julian day number Communications of the ACM 1963 (8); by Robert G. Tantzen
1963	Algorithm 194: ZERSOL Communications of the ACM 1963 (8); by Carlos Domingo
1963	Algorithm 197: matrix division Communications of the ACM 1963 (8); by Mark B. Wells
1963	Certification of algorithm 155: combination in any order Communications of the ACM 1963 (8); by K. M. Bosworth
1963	Certification of algorithm 154: combination in lexicographical order Communications of the ACM 1963 (8); by K. M. Bosworth
1963	Remark on algorithm 150: Syminv2 Communications of the ACM 1963 (7); by Arthur Evans Jr.
1963	Remark on algorithm 150: Syminv2 Communications of the ACM 1963 (7); by Heinz Rutishauser
1963	Algorithm 192: confluent hypergeometric Communications of the ACM 1963 (7); by A. P. Relph
1963	Certification of algorithms 134 and 158 exponentiation of series Communications of the ACM 1963 (7); by Henry C. Thacher Jr.
1963	Remark on algorithm 177: least squares solution with constraints Communications of the ACM 1963 (7); by Michael J. Synge
1963	Certification of algorithm 105: Newton Maehly Communications of the ACM 1963 (7); by Joanne Kondo
1963	Algorithm 190: complex power Communications of the ACM 1963 (7); by A. P. Relph
1963	Algorithm 185: normal probability for curve fitting Communications of the ACM 1963 (7); by A. Colker
1963	Algorithm 193: reversion of series Communications of the ACM 1963 (7); by Henry E. Fettis
1963	Algorithm 187: differences and derivatives Communications of the ACM 1963 (7); by Reind P. van de Riet
1963	Algorithm 186: complex arithmetic Communications of the ACM 1963 (7); by Reind P. van de Riet
1963	Algorithm 189: smoothing 2 Communications of the ACM 1963 (7); by F. Rodriguez-Gil
1963	Algorithm 152: Nexcom Communications of the ACM 1963 (7); by John Hopley
1963	Algorithm 184: Erlang probalility for curve fitting Communications of the ACM 1963 (7); by A. Colker
1963	Algorithm 188: smoothing 1 Communications of the ACM 1963 (7); by F. Rodriguez-Gil
1963	Algorithm 191: hypergeometric Communications of the ACM 1963 (7); by A. P. Relph
1963	Certification of algorithm 74: curve fitting with constraints Communications of the ACM 1963 (6); by Kazuo Isoda
1963	Certification of algorithm 123: real error function, ERF (x) Communications of the ACM 1963 (6); by Henry C. Thacher Jr.
1963	Algorithm 177: least squares solution with constraints Communications of the ACM 1963 (6); by Michael J. Synge
1963	Algorithm 180: error function - large X Communications of the ACM 1963 (6); by Henry C. Thacher Jr.
1963	Algorithm 181: complementary error function - large X Communications of the ACM 1963 (6); by Henry C. Thacher Jr., Paul Shaman
1963	Algorithm 179: incomplete beta ratio Communications of the ACM 1963 (6); by Oliver G. Ludwig
1963	Algorithm 176: least squares surface fit Communications of the ACM 1963 (6); by T. D. Arthurs
1963	Algorithm 182: nonrecursive adaptive integration Communications of the ACM 1963 (6); by William M. McKeeman, Lawrence G. Tesler
1963	Algorithm 178: direct search Communications of the ACM 1963 (6); by Arthur F. Kaupe Jr.
1963	Algorithm 183: reduction of a symmetric bandmatrix to triple diagonal form Communications of the ACM 1963 (6); by Hans Rudolf Schwarz
1963	Algorithm 174: a posteriori bounds on a zero of a polynomial Communications of the ACM 1963 (6); by Allan Gibb
1963	Algorithm 175: shuttle sort Communications of the ACM 1963 (6); by Christopher J. Shaw, T. N. Trimble
1963	Algorithm 173: assign Communications of the ACM 1963 (6); by Otomar Hájek
1963	Algorithm 166: MonteCarlo Communications of the ACM 1963 (4); by Robert D. Rodman
1963	Algorithm 160: combinatorial of M things taken N at a time Communications of the ACM 1963 (4); by M. L. Wolfson, H. V. Wright
1963	Algorithm 164: orthogonal polynomial least squares surface fit Communications of the ACM 1963 (4); by R. E. Clark, Robert N. Kubik, L. P. Phillips
1963	Certification of algorithm 91: Chebyshev curvefit Communications of the ACM 1963 (4); by Robert P. Hale
1963	Certification of algorithm 147: PSIF Communications of the ACM 1963 (4); by Henry C. Thacher Jr.
1963	Algorithm 161: combinatorial of M things taken one at a time, two at a time, up to N at a time Communications of the ACM 1963 (4); by H. V. Wright, M. L. Wolfson
1963	Algorithm 167: calculation of confluent divided differences Communications of the ACM 1963 (4); by William Kahan, I. Farkas
1963	Algorithm 169: Newton interpolation with forward divided differences Communications of the ACM 1963 (4); by William Kahan, I. Farkas
1963	Certification of algorithm 55: complete elliptic integral of the first kind Communications of the ACM 1963 (4); by Henry C. Thacher Jr.
1963	Certification of algorithm 145: adaptive numerical integration by Simpson's rule Communications of the ACM 1963 (4); by William M. McKeeman
1963	Certification of algorithm 148: term of magic square Communications of the ACM 1963 (4); by J. N. R. Barnecut
1963	Algorithm 170: reduction of a matrix containing polynomial elements Communications of the ACM 1963 (4); by Paul E. Hennion
1963	Algorithm 165: complete elliptic integrals Communications of the ACM 1963 (4); by Henry C. Thacher Jr.
1963	Certification of algorithm 133: random Communications of the ACM 1963 (4); by Jesse H. Poore Jr.
1963	Certification of algorithm 148: term of magic square Communications of the ACM 1963 (4); by Dmitri Thoro
1963	Algorithm 162: XYmove plotting Communications of the ACM 1963 (4); by Fred G. Stockton
1963	Certification of algorithm 73: incomplete elliptic integrals Communications of the ACM 1963 (4); by Reind P. van de Riet
1963	Certification of algorithm 149: complete elliptic integral Communications of the ACM 1963 (4); by Henry C. Thacher Jr.
1963	Algorithm 168: Newton interpolation with backward divided differences Communications of the ACM 1963 (4); by William Kahan, I. Farkas
1963	Algorithm 163: modified Hankel function Communications of the ACM 1963 (4); by Henry E. Fettis
1963	Algorithm 154: combination in lexicographical order Communications of the ACM 1963 (3); by Charles J. Mifsud
1963	Algorithm 157: Fourier series approximation Communications of the ACM 1963 (3); by Charles J. Mifsud
1963	Algorithm 159: determinant Communications of the ACM 1963 (3); by David W. Digby
1963	Algorithm 155: combination in any order Communications of the ACM 1963 (3); by Charles J. Mifsud
1963	Algorithm 156: algebra of sets Communications of the ACM 1963 (3); by Charles J. Mifsud
1963	Algorithm 158 (algorithm 134, revised) exponention of series Communications of the ACM 1963 (3); by Henry E. Fettis
1963	Certification of algorithm 79: difference expression coefficients Communications of the ACM 1963 (3); by Eva S. Clark
1963	Certifications of algorithms 117 and 118 magic square (odd and even orders)2 Communications of the ACM 1963 (3); by K. M. Bosworth
1963	Certification of algorithm 96: ancestor Communications of the ACM 1963 (3); by Henry C. Thacher Jr.
1963	Remark on algorithm 133: random Communications of the ACM 1963 (3); by Donald L. Laughlin
1963	Certification of algorithm 73: incomplete elliptic integrals Communications of the ACM 1963 (2); by Noelle A. Meyer
1963	Algorithm 152: Nexcom Communications of the ACM 1963 (2); by John Hopley
1963	Algorithm 151: location of a vector in a lexicographically ordered list Communications of the ACM 1963 (2); by Henry F. Walter
1963	Algorithm 153: gomory Communications of the ACM 1963 (2); by Friedrich L. Bauer
1963	Certification of algorithm 32: multint Communications of the ACM 1963 (2); by Henry C. Thacher Jr.
1963	Algorithm 150: syminv2 Communications of the ACM 1963 (2); by Heinz Rutishauser
1963	Remarks on and certification of algorithm 50: inverse of a finite segment of the Hilbert matrix Communications of the ACM 1963 (1); by Peter Naur
1963	Remarks on algorithm 42: invert Communications of the ACM 1963 (1); by Peter Naur
1963	Certification of algorithms 120 and matrix inversion by Gauss-Jordan inversion II Communications of the ACM 1963 (1); by Peter Naur
1963	Certification of algorithm for calculating primes by means of GPS Communications of the ACM 1963 (1); by Peter Naur
1963	Remarks on and certification of algorithm 52: a set of test matrices Communications of the ACM 1963 (1); by Peter Naur
1963	Certification of algorithms 117 and 118 magic squares (even and odd orders) Communications of the ACM 1963 (1); by Peter Naur
1963	Revised report on the algorithm language ALGOL 60 Communications of the ACM 1963 (1); by John W. Backus, Friedrich L. Bauer, Julien Green, C. Katz, John McCarthy, Alan J. Perlis, Heinz Rutishauser, Klaus Samelson, Bernard Vauquois, Joseph Henry Wegstein, Adriaan van Wijngaarden, Michael Woodger, Peter Naur
1963	Certification of algorithm 31: gamma function Communications of the ACM 1963 (1); by Peter G. Behrenz
1963	Remark on algorithm 107: Gauss's method Communications of the ACM 1963 (1); by Peter Naur

1962 (138)

Computing (general) / Communications of the ACM

1962	Certification of Algorithm 112: Position of point relative to polygon Communications of the ACM 1962 (12); by Richard Hacker
1962	ACM Algorithm 149: Complete Elliptic Integral Communications of the ACM 1962 (12); by Jack N. Merner
1962	Algorithm 148: Term of magic square Communications of the ACM 1962 (12); by D. M. Collison
1962	Certification of Algorithm 31: Gamma function Communications of the ACM 1962 (12); by Peter G. Behrenz
1962	Algorithm 143: Treesort 1 Communications of the ACM 1962 (12); by Arthur F. Kaupe Jr.
1962	Remark on Algorithm 133: Random Communications of the ACM 1962 (12); by Peter G. Behrenz
1962	Algorithm 142: Triangular regression Communications of the ACM 1962 (12); by W. L. Hafley, J. S. Lewis
1962	Certification of Algorithm 94: Combination Communications of the ACM 1962 (12); by R. E. Grench
1962	Certification of Algorithm 118: Magic square (odd order) Communications of the ACM 1962 (12); by Henry C. Thacher Jr.
1962	Remark on Algorithm 58: Matrix inversion Communications of the ACM 1962 (12); by Peter G. Behrenz
1962	Algorithm 144: Treesort 2: Communications of the ACM 1962 (12); by Arthur F. Kaupe Jr.
1962	Algorithm 147: PSIF Communications of the ACM 1962 (12); by D. Amit
1962	Algorithm 145: Adaptive numerical integration by Simpson's rule Communications of the ACM 1962 (12); by William M. McKeeman
1962	Certification of Algorithm 115: Perm Communications of the ACM 1962 (12); by E. S. Phillips
1962	Algorithm 146: Multiple integration Communications of the ACM 1962 (12); by William M. McKeeman
1962	Algorithm 136: Enlargement of a group Communications of the ACM 1962 (11); by M. Wells
1962	Algorithm 141: Path matrix Communications of the ACM 1962 (11); by Peter Zilahy Ingerman
1962	Algorithm 139: Solutions of the diophantine equation Communications of the ACM 1962 (11); by John E. L. Peck
1962	Certification of Algorithm 94: Combination Communications of the ACM 1962 (11); by Ronald W. May
1962	Algorithm 138: Nesting of for statement II Communications of the ACM 1962 (11); by David M. Dahm, M. Wells
1962	Algorithm 129: Minifun Communications of the ACM 1962 (11); by Virginia W. Whitley
1962	Algorithm 135: Crout with equilibration and iteration Communications of the ACM 1962 (11); by William M. McKeeman
1962	Algorithm 134: Exponentiation of series Communications of the ACM 1962 (11); by Henry E. Fettis
1962	Algorithm 137: Nesting of for statement I Communications of the ACM 1962 (11); by David M. Dahm, M. Wells
1962	Remark on algorithm 99: Evaluation of Jacobi symbol Communications of the ACM 1962 (11); by Ronald W. May
1962	Algorithm 140: Matrix inversion Communications of the ACM 1962 (11); by Peter Zilahy Ingerman
1962	Certification of Algorithm 135: Crout with equilibration and iteration Communications of the ACM 1962 (11); by William M. McKeeman
1962	Algorithm 133: Random Communications of the ACM 1962 (11); by Peter G. Behrenz
1962	Certification of Algorithm 84: Simpson's integration Communications of the ACM 1962 (11); by Peter G. Behrenz
1962	Algorithm 132: Quantum mechanical integrals over all Slater-type integrals Communications of the ACM 1962 (11); by James C. Browne
1962	Algorithm 131: Coefficient determination Communications of the ACM 1962 (11); by V. H. Smith, M. L. Allen
1962	Remark on Algorithm 106: Complex number to a real power Communications of the ACM 1962 (11); by Grant W. Erwin Jr.
1962	Algorithm 130: Permute Communications of the ACM 1962 (11); by B. Curtis Eaves
1962	Algorithm 125: Weightcoeff Communications of the ACM 1962 (10); by Heinz Rutishauser
1962	Certification of Algorithm 115: Perm Communications of the ACM 1962 (10); by Günther F. Schrack
1962	Certification of Algorithm 87: Permutation generator Communications of the ACM 1962 (10); by Günther F. Schrack, M. Shimrat
1962	Certification of Algorithm 93: General order arithmetic Communications of the ACM 1962 (10); by Richard George
1962	Algorithm 127: Ortho Communications of the ACM 1962 (10); by Philip J. Walsh
1962	Algorithm 126: Gauss' method Communications of the ACM 1962 (10); by Jay W. Counts
1962	A dispersion pass algorithm for the polyphase merge Communications of the ACM 1962 (10); by Armando G. Mendoza
1962	Certification of Algorithm 40: Critical path scheduling Communications of the ACM 1962 (10); by Lars Hellberg
1962	Remark on Algorithm 73: Incomplete elliptic integrals Communications of the ACM 1962 (10); by David K. Jefferson
1962	Algorithm 128: Summation of Fourier series Communications of the ACM 1962 (10); by M. Wells
1962	Algorithm 121: Normdev Communications of the ACM 1962 (9); by David Shafer
1962	Algorithm 122: Tridiagonal matrix Communications of the ACM 1962 (9); by Gerard F. Dietzel
1962	Algorithm 124: Hankel function Communications of the ACM 1962 (9); by Luis J. Schaefer
1962	Certification of Algorithm 52: A set of test matrices Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Certification of Algorithm 57: Ber or bei function Communications of the ACM 1962 (8); by Henry C. Thacher Jr.
1962	Algorithm 112: Position of point relative to polygon Communications of the ACM 1962 (8); by M. Shimrat
1962	Algorithm 118: Magic square (odd order) Communications of the ACM 1962 (8); by D. M. Collison
1962	Certification of Algorithm 72: Composition generator Communications of the ACM 1962 (8); by D. M. Collison
1962	Algorithm 117: Magic square (even order) Communications of the ACM 1962 (8); by D. M. Collison
1962	Certification of Algorithm 75: Factors Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Remark on Algorithm 78: Rational roots of polynomials with integer coefficients Communications of the ACM 1962 (8); by D. M. Collison
1962	Certification of Algorithm 35: Sieve Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Certification of Algorithm 58: Matrix inversion Communications of the ACM 1962 (8); by Richard George
1962	Algorithm 113: Treesort Communications of the ACM 1962 (8); by Robert W. Floyd
1962	Certification of Algorithm 71: Permutation Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Certification of Algorithm 87: Permutation generator Communications of the ACM 1962 (8); by D. M. Collison
1962	Remark on Algorithm 58: Matrix inversion Communications of the ACM 1962 (8); by George W. Struble
1962	Certification of Algorithm 18: Rational interpolation by continued fractions Communications of the ACM 1962 (8); by Henry C. Thacher Jr.
1962	Certification of Algorithm 117 and 118: Magic square (odd and, even orders) Communications of the ACM 1962 (8); by D. M. Collison
1962	Algorithm 116: Complex division Communications of the ACM 1962 (8); by Robert L. Smith
1962	Certification of Algorithm 86: Permute Communications of the ACM 1962 (8); by D. M. Collison
1962	Remark on Algorithm 84: Simpson's integration Communications of the ACM 1962 (8); by Richard George
1962	Certification of Algorithm 19: Binomial coefficients Communications of the ACM 1962 (8); by Richard George
1962	Algorithm 119: Evaluation of a pert network Communications of the ACM 1962 (8); by Burton Eisenman, Martin Shapiro
1962	Algorithm 115: Perm Communications of the ACM 1962 (8); by Hale F. Trotter
1962	Algorithm 114: Generation of partitions with constraints Communications of the ACM 1962 (8); by Frank Stockmal
1962	Certification of Algorithms 63, 64, 65: Partition, quicksort, find Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Algorithm 120: Matrix inversion II Communications of the ACM 1962 (8); by Richard George
1962	Certification of Algorithm 85: Jacobi Communications of the ACM 1962 (8); by J. S. Hillmore
1962	Certification of Algorithm 37: Telescope 1 Communications of the ACM 1962 (8); by Henry C. Thacher Jr.
1962	Certification of Algorithm 57: Ber or bei function Communications of the ACM 1962 (7); by A. P. Relph
1962	Algorithm 108: Definite exponential integrals A Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Algorithm 111: Molecular-orbital calculation of molecular interactions Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Certification of Algorithm 75: Factors Communications of the ACM 1962 (7); by A. P. Relph
1962	Certification of Algorithm 108: Definite exponential integrals A Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Certification of Algorithm 84: Simpson's integration Communications of the ACM 1962 (7); by A. P. Relph
1962	Algorithm 110: Quantum mechanical integrals of Slater-type orbitals Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Certification of Algorithm 70: Interpolation by Aitken Communications of the ACM 1962 (7); by A. P. Relph
1962	Certification of Algorithm 110: Quantum mechanical integrals of Slater-type orbitals Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Algorithm 104: Reduction to Jacobi Communications of the ACM 1962 (7); by Heinz Rutishauser
1962	Algorithm 107: Gauss's method Communications of the ACM 1962 (7); by Jay W. Counts
1962	Certification of Algorithm 109: Definite exponential integrals B Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Certification of Algorithm 51: Adjust inverse of a matrix when an element is perturbed Communications of the ACM 1962 (7); by Richard George
1962	Algorithm 106: Complex number to a real power Communications of the ACM 1962 (7); by Margaret L. Johnson, Ward C. Sangren
1962	Algorithm 109: Definite exponential integrals B Communications of the ACM 1962 (7); by Yuri A. Kruglyak, Donald R. Whitman
1962	Remark on Algorithm 34: Gamma function Communications of the ACM 1962 (7); by Margaret L. Johnson, Ward C. Sangren
1962	Remark on Algorithm 48: Logarithm of a complex number Communications of the ACM 1962 (7); by Margaret L. Johnson, Ward C. Sangren
1962	Algorithm 105: Newton Maehly Communications of the ACM 1962 (7); by Friedrich L. Bauer, Josef Stoer
1962	Algorithm 100: Add item to chain-linked list Communications of the ACM 1962 (6); by Philip J. Kiviat
1962	Algorithm 102: Permutation in lexicographical order Communications of the ACM 1962 (6); by Günther F. Schrack, M. Shimrat
1962	Algorithm 93: General order arithmetic Communications of the ACM 1962 (6); by Millard H. Perstein
1962	Certification of Algorithm 67: Cram Communications of the ACM 1962 (6); by A. P. Relph
1962	Certification of Algorithm 77: Avint Communications of the ACM 1962 (6); by Victor E. Whittier
1962	Certification of Algorithm 66: Invrs Communications of the ACM 1962 (6); by John Caffrey
1962	Algorithm 95: Generation of partitions in part-count form Communications of the ACM 1962 (6); by Frank Stockmal
1962	Certification of Algorithm 58: Matrix inversion Communications of the ACM 1962 (6); by Richard A. Conger
1962	Algorithm 98: Evaluation of definite complex line integrals Communications of the ACM 1962 (6); by John L. Pfaltz
1962	Algorithm 101: Remove item from chain-linked list Communications of the ACM 1962 (6); by Philip J. Kiviat
1962	Algorithm 99: Evaluation of Jacobi symbol Communications of the ACM 1962 (6); by Stephen J. Garland, Anthony W. Knapp
1962	Algorithm 96: Ancestor Communications of the ACM 1962 (6); by Robert W. Floyd
1962	Algorithm 103: Simpson's rule integrator Communications of the ACM 1962 (6); by Guy F. Kuncir
1962	Algorithm 94: Combination Communications of the ACM 1962 (6); by Jerome M. Kurtzberg
1962	Remark on Algorithm 76: Sorting procedures Communications of the ACM 1962 (6); by Brian Randell
1962	Algorithm 97: Shortest path Communications of the ACM 1962 (6); by Robert W. Floyd
1962	Certification of Algorithm 48: Logarithm of a complex number Communications of the ACM 1962 (6); by A. P. Relph
1962	Certification of Algorithm 46: Exponential of a complex number Communications of the ACM 1962 (6); by A. P. Relph
1962	Remark on Algorithm 19: Rinomial coefficients Communications of the ACM 1962 (6); by Bichard Steck
1962	Algorithm 89: Evaluation of the fresnal sine integral Communications of the ACM 1962 (5); by John L. Cundiff
1962	Algorithm 92: Simultaneous system of equations and matrix inversion routine Communications of the ACM 1962 (5); by Derek Johann Roek
1962	Certification of Algorithm 60: Romberg integration Communications of the ACM 1962 (5); by Karl Heinz Buchner
1962	Algorithm 91: Chebyshev curve-fit Communications of the ACM 1962 (5); by Albert Newhouse
1962	Algorithm 90: Evaluation of the fresnal cosine integral Communications of the ACM 1962 (5); by John L. Cundiff
1962	Algorithm 88: Evaluation of asymptotic expression for the fresnel sine and cosine integrals Communications of the ACM 1962 (5); by John L. Cundiff
1962	Certification of Algorithm 71: Permutation Communications of the ACM 1962 (4); by P. J. Brown
1962	Certification of Algorithm 35: Sieve Communications of the ACM 1962 (4); by P. J. Brown
1962	Algorithm 85: Jacobi Communications of the ACM 1962 (4); by Thomas G. Evans
1962	Algorithm 86: Permute Communications of the ACM 1962 (4); by John E. L. Peck, Günther F. Schrack
1962	Algorithm 84: Simpson's integration Communications of the ACM 1962 (4); by Paul E. Hennion
1962	Algorithm 87: Permutation generator Communications of the ACM 1962 (4); by John R. Howell
1962	Certification of Algorithm 71: Permutation Communications of the ACM 1962 (4); by John E. L. Peck, Günther F. Schrack
1962	Algorithm 83: Optimal classification of objects Communications of the ACM 1962 (3); by Brian H. Mayoh
1962	Algorithm 80: Reciprocal gamma function of real argument Communications of the ACM 1962 (3); by William Holsten
1962	Algorithm 81: Economising a sequence 1 Communications of the ACM 1962 (3); by Brian H. Mayoh
1962	Certification of Algorithm 78: Ratfact Communications of the ACM 1962 (3); by Maurice H. Halstead
1962	Certification of Algorithm 60: Romberg integration Communications of the ACM 1962 (3); by Henry C. Thacher Jr.
1962	Algorithm 82: Economising a sequence 2 Communications of the ACM 1962 (3); by Brian H. Mayoh
1962	Algorithm 77: Interpolation, differentiation, and integration Communications of the ACM 1962 (2); by Paul E. Hennion
1962	SURGE: a recoding of the COBOL merchandise control algorithm Communications of the ACM 1962 (2); by Leonard F. Longo
1962	Algorithm 79: Difference expression coefficients Communications of the ACM 1962 (2); by Thomas P. Giammo
1962	Algorithm 78: Rational roots of polynomials with integer coefficients Communications of the ACM 1962 (2); by C. Perry
1962	Algorithm 76: Sorting procedures Communications of the ACM 1962 (1); by Ivan Flores
1962	Algorithm 75: Factors Communications of the ACM 1962 (1); by John E. L. Peck
1962	Certification of Algorithm 30: Numerical solution of the polynomial equation Communications of the ACM 1962 (1); by Kalman J. Cohen
1962	Certification of Algorithm 66: INVRS Communications of the ACM 1962 (1); by Brian Randell, C. G. Broyden
1962	Certification of Algorithm 50: Inverse of a finite segment of the Hilbert matrix Communications of the ACM 1962 (1); by Brian Randell

1961 (67)

Computing (general) / Communications of the ACM

1961	Remark on algorithm 28: least-squares fit by orthogonal polynomials Communications of the ACM 1961 (12); by D. B. MacMillan
1961	Remark on algorithm 62: a set of associate Legendre polynomials of the second kind Communications of the ACM 1961 (12); by John R. Herndon
1961	Algorithm 73: incompleter elliptic integrals Communications of the ACM 1961 (12); by David K. Jefferson
1961	Algorithm 71: permutation Communications of the ACM 1961 (11); by R. R. Coveyou, J. G. Sullivan
1961	Algorithm 72: composition generator Communications of the ACM 1961 (11); by Leo Hellerman, S. Ogden
1961	Remark on algorithm 52: a set of test matrices Communications of the ACM 1961 (11); by G. H. Dubay
1961	Certification of algorithm 42: invert Communications of the ACM 1961 (11); by Anthony W. Knapp
1961	Certification of algorithm 68: augmentation Communications of the ACM 1961 (11); by Lawrence M. Breed
1961	On a program for Ray-Chaudhuri's algorithm for a minimum cover of an abstract complex Communications of the ACM 1961 (11); by Dominique Foata
1961	Techniques for storage allocation algorithms Communications of the ACM 1961 (10); by James E. Kelley Jr.
1961	Certification of algorithm 40: critical path scheduling Communications of the ACM 1961 (9); by Neal L. Alexander
1961	Algorithm 69: Chain tracing Communications of the ACM 1961 (9); by Brian H. Mayoh
1961	Certification of algorithm 52: a set of test matrices Communications of the ACM 1961 (8); by H. E. Gilbert
1961	Algorithm 68: augmentation Communications of the ACM 1961 (8); by H. Gordon Rice
1961	A generalized polyphase merge algorithm Communications of the ACM 1961 (8); by Samuel W. Reynolds
1961	Algorithm 67: CRAM Communications of the ACM 1961 (7); by John Caffrey
1961	Algorithm 63: partition Communications of the ACM 1961 (7); by C. A. R. Hoare
1961	Algorithm 64: Quicksort Communications of the ACM 1961 (7); by C. A. R. Hoare
1961	Remark on algorithm 53: Nth roots of a complex number Communications of the ACM 1961 (7); by C. W. Nestor Jr.
1961	Algorithm 62: a set of associative Legendre polynomials of the second kind Communications of the ACM 1961 (7); by John R. Herndon
1961	An algorithm for equivalence declarations Communications of the ACM 1961 (7); by Bruce W. Arden, Bernard A. Galler, Robert M. Graham
1961	Algorithm 61: procedures for range arithmetic Communications of the ACM 1961 (7); by Allan Gibb
1961	Algorithm 65: find Communications of the ACM 1961 (7); by C. A. R. Hoare
1961	Algorithm 66: Invrs Communications of the ACM 1961 (7); by John Caffrey
1961	Algorithm 60: Romberg integration Communications of the ACM 1961 (6); by Friedrich L. Bauer
1961	Algorithm 59: zeros of a real polynomial by resultant procedure Communications of the ACM 1961 (5); by Erwin H. Bareiss, Mary Anne Fisherkeller
1961	Algorithm 58: matrix inversion Communications of the ACM 1961 (5); by Donald Cohen
1961	Certification of algorithm 30: numerical solution of the polynomial equation Communications of the ACM 1961 (5); by William J. Alexander
1961	Certification of algorithm 23: MATHSORT Communications of the ACM 1961 (5); by Russell W. Ranshaw
1961	Algorithms 41: Evaluation of determinant Communications of the ACM 1961 (4); by Josef G. Solomon
1961	Algorithm 43: CROUT with pivoting II Communications of the ACM 1961 (4); by Henry C. Thacher Jr.
1961	Algorithm 44: Bessel Functions computed recursively Communications of the ACM 1961 (4); by Maria E. Wojcicki
1961	Algorithm 57: BER or BEI function Communications of the ACM 1961 (4); by John R. Herndon
1961	Certification of algorithm 20: real exponential integral Communications of the ACM 1961 (4); by William J. Alexander
1961	Algorithm 50: Inverse of a finite segment of the Hilbert matrix Communications of the ACM 1961 (4); by John R. Herndon
1961	Certification of algorithm 3: solution of polynomial equation by Barstow-Hitchcock Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 55: complete elliptic integral of the first kind Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 48: logarithm of a complex number Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 47: associated Legendre functions of the first kind for real or imaginary arguments Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 45: interest Communications of the ACM 1961 (4); by Peter Zilahy Ingerman
1961	Algorithm 42: invert Communications of the ACM 1961 (4); by T. C. Wood
1961	ACM Algorithm 49: Spherical Neumann Function Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 52: a set of test matrices Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 56: complete elliptic integral of the second kind Communications of the ACM 1961 (4); by John R. Herndon
1961	Certification of algorithm 43: CROUT II Communications of the ACM 1961 (4); by Henry C. Thacher Jr.
1961	Algorithm 51: adjust inverse of a matrix when an element is perturbed Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 54: Gamma function for range 1 to 2 Communications of the ACM 1961 (4); by John R. Herndon
1961	Certification of algorithm 13: Legendre polynomial Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 46: exponential of a complex number Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 53: Nth roots of a complex number Communications of the ACM 1961 (4); by John R. Herndon
1961	Algorithm 40: critical path scheduling Communications of the ACM 1961 (3); by Burt M. Leavenworth
1961	Certification of algorithm 4: bisection routine Communications of the ACM 1961 (3); by Patty Jane Rader
1961	Algorithm 36: tchebycheff Communications of the ACM 1961 (3); by A. J. Gianni
1961	Algorithm 35: Sieve Communications of the ACM 1961 (3); by T. C. Wood
1961	Remarks on algorithms 2 and 3 Communications of the ACM 1961 (3); by James Hardy Wilkinson
1961	Algorithm 39: correlation coefficients with matrix multipliation Communications of the ACM 1961 (3); by Papken Sassouni
1961	Remark on algorithm 16: CROUT with pivoting Communications of the ACM 1961 (3); by Henry C. Thacher Jr.
1961	Algorithm 38: telescope 2 Communications of the ACM 1961 (3); by K. A. Brons
1961	Remark on algorithm 25: real zeros of an arbitrary function Communications of the ACM 1961 (3); by Robert M. Collinge
1961	Algorithm 37: telescope 1 Communications of the ACM 1961 (3); by K. A. Brons
1961	Certification of Algorithm 3: Solution of polynomial equations by Bairstow Hitchcock method Communications of the ACM 1961 (2); by James Vandergraft
1961	Algorithm 32: MULTINT Communications of the ACM 1961 (2); by R. Don Freeman Jr.
1961	Certification of Algorithm 13: Complex exponential integral Communications of the ACM 1961 (2); by P. J. Rader, Henry C. Thacher Jr.
1961	Algorithm 34: Gamma function Communications of the ACM 1961 (2); by M. F. Lipp
1961	Algorithm 31: Gamma functions Communications of the ACM 1961 (2); by Robert M. Collinge
1961	Remark on Algorithm 20: Real exponential integral Communications of the ACM 1961 (2); by S. Peavy
1961	An algorithm for coding efficient arithmetic operations Communications of the ACM 1961 (1); by Robert W. Floyd

1960 (35)

Computing (general) / Communications of the ACM

1960	Algorithm 30: numerical solution of the polynomial equation Communications of the ACM 1960 (12); by Kenneth W. Ellenberger
1960	Algorithm 26: rootfinder III Communications of the ACM 1960 (11); by John G. Herriot
1960	Algorithm 28: least squares fit by orthogonal polynomials Communications of the ACM 1960 (11); by John G. Mackinney
1960	Algorithm 27: assignment Communications of the ACM 1960 (11); by Roland Silver
1960	An algorithm for the assignment problem Communications of the ACM 1960 (11); by Roland Silver
1960	Remark on algorithm 15: rootfinder II Communications of the ACM 1960 (11); by George E. Forsythe, John G. Herriot
1960	Algorithm 25: real zeros of an arbitrary function Communications of the ACM 1960 (11); by Burt M. Leavenworth
1960	Algorithm 23: MATH SORT Communications of the ACM 1960 (11); by Wallace Feurzeig
1960	Algorithm 22: Riccati-Bessel functions of first and second kind Communications of the ACM 1960 (11); by Hans J. Oser
1960	Algorithms 21: Bessel function for a set of integer orders Communications of the ACM 1960 (11); by W. Börsch-Supan
1960	Algorithm 29: polynomial transformer Communications of the ACM 1960 (11); by John G. Mackinney
1960	Algorithm 24: solution of tri-diagonal linear equations Communications of the ACM 1960 (11); by Burt M. Leavenworth
1960	Algorithm 20: real exponential integral Communications of the ACM 1960 (10); by S. Peavy
1960	Remark on algorithm 16: crout with pivoting Communications of the ACM 1960 (10); by George E. Forsythe
1960	Algorithm 19: binomial coefficients Communications of the ACM 1960 (10); by Richard R. Kenyon
1960	A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm Communications of the ACM 1960 (9); by J. C. Dickson, F. P. Frederick
1960	Algorithm 16: crout with pivoting Communications of the ACM 1960 (9); by George E. Forsythe
1960	Algorithm 17: trdiag Communications of the ACM 1960 (9); by C. F. Sprague
1960	Remark on algorithm 2: rootfinder Communications of the ACM 1960 (8); by Henry C. Thacher Jr.
1960	Algorithm 15: rootfinder II Communications of the ACM 1960 (8); by Henry C. Thacher Jr.
1960	Certification of algorithm 15: rootfinder II Communications of the ACM 1960 (8); by Henry C. Thacher Jr.
1960	Algorithms 13: complex exponential integral Communications of the ACM 1960 (7); by A. Beam
1960	Multiprogram Scheduling Parts 3 and 4: Scheduling Algorithm and External Constraints Communications of the ACM 1960 (7); by E. F. Codd
1960	Algorithms: evaluation of the Legendre polynomial P n (X) by recursion Communications of the ACM 1960 (6); by G. M. Galler
1960	Algorithms: evaluation of the Hermite polynomial H n (X) by recursion Communications of the ACM 1960 (6); by G. M. Galler
1960	Algorithms: evaluation of the Laguerre polynomial L n (X) by recursion Communications of the ACM 1960 (6); by G. M. Galler
1960	Algorithms: evaluation of the Chebyshev polynomial T n (X) by recursion Communications of the ACM 1960 (6); by G. M. Galler
1960	Bessel Funtion I, Series Expansion (Algorithm 5) Communications of the ACM 1960 (4); by Dorothea S. Clarke
1960	Bessel Function I, Asymptotic Expansion (Algorithm 6) Communications of the ACM 1960 (4); by Dorothea S. Clarke
1960	Euclidian Algorithm (Algorithm 7) Communications of the ACM 1960 (4); by Robert Claussen
1960	An Algorithm Defining ALGOL Assignment Statements Communications of the ACM 1960 (3); by Robert W. Floyd
1960	Bisection Routine (Algorithm 4) Communications of the ACM 1960 (3); by Saul Gorn
1960	Solution of Polynomial Equation by Bairstow-Hitchcock Method (Algorithm 3) Communications of the ACM 1960 (2); by Albert A. Grau
1960	QuadI (Algorithm 1) Communications of the ACM 1960 (2); by R. J. Herbold
1960	Rottfinder (Algorithm 2) Communications of the ACM 1960 (2); by Joseph Henry Wegstein

1958 (2)

Computing (general) / Communications of the ACM

1958	Need for an Algorithm Communications of the ACM 1958 (4); by W. Selden
1958	Algorithm for Analyzing Logical Statements to Produce a Truth Function Table Communications of the ACM 1958 (3); by Harold Wolpe