Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg
Proceedings of the Fourth Annual ACM Symposium on Theory of Computing
STOC, 1972.

@proceedings{STOC-1972,
	address       = "Denver, Colorado, USA",
	editor        = "Patrick C. Fischer and H. Paul Zeiger and Jeffrey D. Ullman and Arnold L. Rosenberg",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Fourth Annual ACM Symposium on Theory of Computing}",
	year          = 1972,
}

Contents (29 items)

4 ×#bound
3 ×#algorithm
3 ×#recursion
2 ×#complexity
2 ×#equivalence
2 ×#on the
2 ×#performance
2 ×#problem
2 ×#similarity

STOC-1972-ConstableM #decidability #equivalence #problem #recursion

Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.

STOC-1972-WalkerS #recursion

Characterization of Flowchartable Recursions (SAW, HRS), pp. 18–34.

STOC-1972-Morris #recursion

Recursion Schemes with Lists (JHMJ), pp. 35–43.

STOC-1972-Plaisted

Flowchart Schemata with Counters (DAP), pp. 44–51.

STOC-1972-ChandraM #similarity

Program Schemas with Equality (AKC, ZM), pp. 52–64.

STOC-1972-GarlandL #equivalence #on the

On the Equivalence of Schemes (SJG, DCL), pp. 65–72.

STOC-1972-CookR #bound #random

Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.

STOC-1972-WarkentinF

Predecessor Machines and Regressing Functions (JCW, PCF), pp. 81–87.

STOC-1972-Fiduccia #algorithm #evaluation #fourier #performance #polynomial #revisited

Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited (CMF), pp. 88–93.

STOC-1972-Kirkpatrick #on the

On the Additions Necessary to Compute Certain Functions (DGK), pp. 94–101.

STOC-1972-Kung #bound #multi #performance

A Bound on the Multiplication Efficiency of Iteration (HTK), pp. 102–107.

STOC-1972-Horowitz #algorithm

Algorithms for Rational Function Arithmetic Operations (EH), pp. 108–118.

STOC-1972-BlumFPRT #bound #linear

Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.

STOC-1972-KarpMR #agile #array #identification #string

Rapid Identification of Repeated Patterns in Strings, Trees and Arrays (RMK, REM, ALR), pp. 125–136.

STOC-1972-NievergeltR #bound

Binary Search Trees of Bounded Balance (JN, EMR), pp. 137–142.

STOC-1972-GareyGU #algorithm #analysis #memory management #worst-case

Worst-Case Analysis of Memory Allocation Algorithms (MRG, RLG, JDU), pp. 143–150.

STOC-1972-Savitch #automaton

Maze Recognizing Automata (WJS), pp. 151–156.

STOC-1972-JonesS #first-order #similarity #turing machine

Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.

STOC-1972-Schnorr #complexity #effectiveness #process #random testing #testing

The Process Complexity and Effective Random Tests (CPS), pp. 168–176.

STOC-1972-Symes #finite

The Computation of Finite Functions (DMS), pp. 177–182.

STOC-1972-MeyerB

Program Size and Economy of Descriptions: Preliminary Report (ARM, AB), pp. 183–186.

STOC-1972-Cook #complexity #nondeterminism

A Hierarchy for Nondeterministic Time Complexity (SAC), pp. 187–192.

STOC-1972-Hamlet #independence #problem #programming language

A Patent Problem for Abstract Programming Languages: Machine-Independent Computations (RGH), pp. 193–197.

STOC-1972-OgdenR #composition #transducer

Compositions of n Tree Transducers (WFO, WCR), pp. 198–206.

STOC-1972-Carlyle-GreibachGG

Uniformly Erasable AFL (SCG, SG, JG), pp. 207–213.

STOC-1972-LindenmayerR

Developmental Systems and Languages (AL, GR), pp. 214–221.

STOC-1972-Sethi #source code #validation

Validating Register Allocations for Straight Line Programs (RS), pp. 222–237.

STOC-1972-HechtU #graph

Flow Graph Reducibility (MSH, JDU), pp. 238–250.

STOC-1972-AhoU #lr #parsing

A Technique for Speeding Up LR(k) Parsers (AVA, JDU), pp. 251–263.