


default search action
SIGACT News (ACM), Volume 9
Volume 9, Number 1, January - March 1977
- John C. Cherniavsky:

Book review department. 15 - Gabor T. Herman:

Review of "Automata, languages, development" by A. Lindenmayer and G. Rozenberg. North Holland Publishing Co. 1976. 16-18 - Recent technical reports. 19-34

Volume 9, Number 2, Summer 1977
- Donald E. Knuth:

The complexity of songs. 17-24 - Leslie M. Goldschlager:

The monotone and planar circuit value problems are log space complete for P. 25-29 - Dianne E. Britton, Ralph B. McLaughlin, Richard J. Orgass:

A note concerning intermittent assertions. 30-35 - Larry Carter:

A four-gadget. 36 - Recent technical reports. 37-44

Volume 9, Number 3, Fall 1977
- Larry H. Reeker:

Review of "Programs, machines, and computation: an introduction to the theory of computing" by K. L. Clark and D. F. Cowell. 20-22 - Kellogg S. Booth:

Boolean matrix multiplication using only O(nlog27 log n) bit operations. 23 - M. S. Krishnamoorthy:

A note on "Some simplified NP-complete graph problems". 24 - Barry K. Rosen:

Arcs in graphs are NOT pairs of nodes. 25-27 - Recent technical reports. 28-32

Volume 9, Number 4, Winter 1978
- Harry R. Lewis:

Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires: introduction à l'analyze mathématique des algorithmes" by Donald E. Knuth. Les Presses de l'Université de Montréal. 13-14 - Y. Nisselbaum:

On merging N ordered elements with three elements. 14-16 - Michael R. Garey, David S. Johnson:

A note on "A note on 'Some simplified NP-complete graph problems'". 17 - R. K. Shyamasundar:

A note on the transitive closure of a boolean matrix. 18-21 - Howard P. Katseff:

From the recursive function theory newsletter. 22-23 - Recent technical reports. 24-28


manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














