Michael A. Harrison, Ranan B. Banerji, Jeffrey D. Ullman
Proceedings of the Third Annual ACM Symposium on Theory of Computing
STOC, 1971.

@proceedings{STOC-1971,
	address       = "Shaker Heights, Ohio, USA",
	editor        = "Michael A. Harrison and Ranan B. Banerji and Jeffrey D. Ullman",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Third Annual ACM Symposium on Theory of Computing}",
	year          = 1971,
}

Contents (23 items)

4 ×#recursion
3 ×#algorithm
3 ×#complexity
2 ×#algebra
2 ×#automaton
2 ×#finite
2 ×#generative
2 ×#on the
2 ×#parallel
2 ×#performance

STOC-1971-Stanat #formal method

Formal Languages and Power Series (DFS), pp. 1–11.

STOC-1971-Wagner #algebra #recursion

An Algebraic Theory of Recursive Definitions and Recursive Languages (EGW), pp. 12–23.

STOC-1971-Constable

Loop Schemata (RLC), pp. 24–39.

STOC-1971-Munro #algorithm #performance

Some Results Concerning Efficient and Optimal Algorithms (JIM), pp. 40–44.

STOC-1971-Fiduccia #matrix #multi #performance

Fast Matrix Multiplication (CMF), pp. 45–49.

STOC-1971-Meyers #linear #representation

Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations (WJM), pp. 50–62.

STOC-1971-Buttelmann #automaton #finite #generative #on the #strict

On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.

STOC-1971-LevyJ #automaton

Some Results in Tree Automata (LSL, AKJ), pp. 78–85.

STOC-1971-Berry #question

Block Structure: Retention or Deletion? (DMB), pp. 86–100.

STOC-1971-Chang #on the #parallel

On the Parallel Computation of Local Operations (SKC), pp. 101–115.

STOC-1971-Boasson #theorem

An Iteration Theorem for One-Counter Languages (LB), pp. 116–120.

STOC-1971-GinsburgG #recursion

Intersection-Closed full AFL and the Recursively Enumerable Languages (SG, JG), pp. 121–131.

STOC-1971-Rajlich #finite #parallel #transducer

Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.

STOC-1971-Rosenberg #graph

Addressable Data Graphs: Extended Abstract (ALR), pp. 138–150.

STOC-1971-Cook #complexity

The Complexity of Theorem-Proving Procedures (SAC), pp. 151–158.

STOC-1971-AhoU #lr

The Care and Feeding of LR(k) Grammars (AVA, JDU), pp. 159–170.

STOC-1971-Wise #algorithm

Domolki’s Algorithm Applied to Generalized Overlap Resolvable Grammars (DSW), pp. 171–184.

STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #set

An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.

STOC-1971-McNaughton #set

A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets (RM), pp. 206–218.

STOC-1971-Santos #algebra #probability

Algebraic Structure Theory of Stochastic Machines (ESS), pp. 219–243.

STOC-1971-ConstableH #complexity

Complexity of Formal Translations and Speed-Up Results (RLC, JH), pp. 244–250.

STOC-1971-Machtey #classification #recursion

Classification of Computable Functions by Primitive Recursive Classes (MM), pp. 251–257.

STOC-1971-Robertson #complexity #recursion

Complexity Classes of Partial Recursive Functions (ELR), pp. 258–266.