%A C. Morgan
%T A prime decomposition result for parallel systems
%J SIGACT News
%K theory
%V 8
%N 3
%D July/September 1976
%P 14-20

%A M-C. van Leunen
%A R. Lipton
%T How to have your abstract rejected
%J SIGACT News
%K theory
%V 8
%N 3
%D July/September 1976
%P 21-23

%A G. Yuval
%T The geometric mean distance
%J SIGACT News
%K theory
%V 8
%N 3
%D July/September 1976
%P 24-25

%A J. Hartmanis
%A J.E. Hopcroft
%T Independence results in computer science
%J SIGACT News
%K theory
%V 8
%N 4
%D October/December 1976
%P 13-23

%A J. van Leeuwen
%T A regularity condition for parallel rewriting systems
%J SIGACT News
%K theory
%V 8
%N 4
%D October/December 1976
%P 24-27

%A S.A. Cook
%T A short proof of the pigeon hole principle using extended resolution
%J SIGACT News
%K theory
%V 8
%N 4
%D October/December 1976
%P 28-32

%A D. Knuth
%T The Samson-Mueller algorithm
%J SIGACT News
%K theory
%V 9
%N 1
%D January/March 1977
%P 8

%A D. Knuth
%T The complexity of songs
%J SIGACT News
%K theory
%V 9
%N 2
%D Summer 1977
%P 17-24

%A L. Goldschlager
%T The monotone and planar circuit value problems
are log space complete for P
%J SIGACT News
%K theory
%V 9
%N 2
%D Summer 1977
%P 25-29

%A D.E. Britton
%A R.B. McLaughlin
%A R.J. Orgass
%T A note concerning intermittent assertions
%J SIGACT News
%K theory
%V 9
%N 2
%D Summer 1977
%P 30-34

%A L. Carter
%T A four-gadget
%J SIGACT News
%K theory
%V 9
%N 2
%D Summer 1977
%P 36

%A K.S. Booth
%T Boolean matrix multiplication
%J SIGACT News
%K theory
%V 9
%N 3
%D Fall 1977
%P 23

%A M.S. Krishnamoorthy
%T A note on "Some simplified NP-complete graph problems"
%J SIGACT News
%K theory
%V 9
%N 3
%D Fall 1977
%P 24

%A B.K. Rosen
%T Arcs in graphs are not pairs of nodes
%J SIGACT News
%K theory
%V 9
%N 3
%D Fall 1977
%P 25-27

%A Y. Nisselbaum
%T On merging n ordered element with three elements
%J SIGACT News
%K theory
%V 9
%N 4
%D Winter 1978
%P 14-16

%A M.R. Garey
%A D.S. Johnson
%T A note on "A note on 'Some simplified NP-complete graph problems'"
%J SIGACT News
%K theory
%V 9
%N 4
%D Winter 1978
%P 17

%A R.K. Shyamasundar
%T A note on the transitive closure of a boolean matrix
%J SIGACT News
%K theory
%V 9
%N 4
%D Winter 1978
%P 18-20

%A J. van Leeuwen
%T Evaluating a polynomial and its reverse
%J SIGACT News
%K theory
%V 10
%N 1
%D Spring 1978
%P 18-21

%A Z. Galil
%T Killing two birds with one stone
%J SIGACT News
%K theory
%V 10
%N 1
%D Spring 1978
%P 22-24

%A M.J. Colbourn
%A C.J. Colbourn
%T Graph isomorphism and self complementary sets
%J SIGACT News
%K theory
%V 10
%N 1
%D Spring 1978
%P 25-29

%A L. Yelowitz
%T A note on "A note on the transitive closure of a boolean matrix"
%J SIGACT News
%K theory
%V 10
%N 1
%D Spring 1978
%P 30

%A R.K. Shyamasundar
%T A note on the multiplication of 4x4 matrices
%J SIGACT News
%K theory
%V 10
%N 1
%D Spring 1978
%P 31-32

%A J.E. Burns
%T Mutual exclusion with linear waiting using binary shared variables
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 42-47

%A J. Jaffe
%T A necessary and sufficient pumping lemma for regular languages
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 48-49

%A D. Kozen
%T A clique problem equivalent to graph isomorphism
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 50-52

%A B. Litow
%A I.H. Sudborough
%T On non-erasing oracle tapes in space bounded reducibility
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 53-57

%A J. Velu
%T Tests for primality under the Riemann hypothesis
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 58-59

%A D. Wood
%T One-sided height-balanced search trees
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 60-62

%A D. Wood
%T Bibliography of grammatical similarity
%J SIGACT News
%K theory
%V 10
%N 2
%D Summer 1978
%P 63-70

%A A.K. Dewdney
%T Logic circuits in the plane: minimal crossovers
%J SIGACT News
%K theory
%V 10
%N 3
%D Winter 1979
%P 38-48

%A M.S. Krishnamoorthy
%A S. Biswas
%T The generalized towers of Hanoi
%J SIGACT News
%K theory
%V 10
%N 3
%D Winter 1979
%P 49

%A K.H. Derus
%A J.C. Hansen
%T Logics of truth and disposition
%J SIGACT News
%K theory
%V 11
%N 1
%D Summer 1979
%P 36-43

%A H. Ehrig
%A H.J. Kreowski
%A P. Padawitz
%T Algebraic implementation of abstract data types: an announcement
%J SIGACT News
%K theory
%V 11
%N 2
%D Fall 1979
%P 25-29

%A K.H. Derus
%A J.C. Hansen
%T Propositions with multiple dispositions and multiple truth values
%J SIGACT News
%K theory
%V 11
%N 2
%D Fall 1979
%P 30-35

%A J.L. Bentley
%A J.B. Saxe
%T Algorithms on vectors sets
%J SIGACT News
%K theory
%V 11
%N 2
%D Fall 1979
%P 36-39

%A S.A. Greibach
%T Comments on the roots of theorems and languages both easy and hard
%J SIGACT News
%K theory
%V 13
%N 1
%D Winter 1981
%P 26-29

%A U. Schoning
%T A note on complete sets for the polynomial-time hierarchy
%J SIGACT News
%K theory
%V 13
%N 1
%D Winter 1981
%P 30-34

%A C.P. Kruskal
%A E. Weixelbaum
%T A note on the worst case of heapsort
%J SIGACT News
%K theory
%V 13
%N 1
%D Winter 1981
%P 35-38

%A J.L. Bentley
%A D. Haken
%A J.B. Saxe
%T A general method for solving divide-and-conquer recurrences
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 36-44

%A H. Gaifman
%A E. Shamir
%T Roots of the hardest context free language and other constructs
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 45-51

%A G. Gens
%A E. Levner
%T Complexity of approximation algorithms for combinatorial problems:
a survey
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 52-65

%A A. Gottleib
%A C.P. Kruskal
%T A note on sorting integers from a bounded range
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 66-67

%A D. Harel
%T On folk theorems
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 68-80

%A E. Leiss
%T Constructing a finite automation for a given regular expression
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 81-87

%A F. Nourani
%T A note on constructors of the computable universe
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 88-89

%A A.G. Porto
%A A.B. Matos
%T Ackerman and the superpowers
%J SIGACT News
%K theory
%V 12
%N 3
%D Fall 1980
%P 90-95

%A Zvi Galil
%T Improved string matching with k mismatches
%J SIGACT News
%K theory
%V 17
%N 4
%D Spring 1986
%P 52-54

%A Leona F. Fass
%T On the inference of canonical context-free grammars (an amplification)
%J SIGACT News
%K theory
%V 17
%N 4
%D Spring 1986
%P 55-60

%A Yuri Gurevich
%T What does O(n) mean ?
%J SIGACT News
%K theory
%V 17
%N 4
%D Spring 1986
%P 61-63

%A K.L. Williams
%A M.R. Meybodi
%T Representing problems as string transformations
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 29-30

%A Rod McBeth
%T A proof of generalized induction
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 31-36

%A Charles B. Dunham
%T Pessimization is unsolvable
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 37
%K humor

%A David Eppstein
%T On the NP-completeness of cryptarithms
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 38-40

%A Anthony J. Dos Reis
%T Regular languages under F-gsm mappings
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 41-45

%A Anthony J. Dos Reis
%T Regular languages do not form a lattice under GSM mappings
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 46-47

%A Leslie Burkholder
%T The halting problem
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 48-60

%A Edmund Staples
%T The tower of Hanoi problem with arbitrary start and end positions
%J SIGACT News
%K theory
%V 18
%N 3
%D Spring 1987
%P 61-64