Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison
Proceedings of the First Annual ACM Symposium on Theory of Computing
STOC, 1969.

@proceedings{STOC-1969,
	address       = "Marina del Rey, California, USA",
	editor        = "Patrick C. Fischer and Seymour Ginsburg and Michael A. Harrison",
	publisher     = "{ACM}",
	title         = "{Proceedings of the First Annual ACM Symposium on Theory of Computing}",
	year          = 1969,
}

Contents (31 items)

5 ×#on the
4 ×#complexity
4 ×#context-free grammar
4 ×#formal method
3 ×#automaton
2 ×#algorithm
2 ×#problem
2 ×#product line
2 ×#programming language
2 ×#realtime

STOC-1969-PetersR #analysis #context-free grammar #revisited

Context-Sensitive Immediate Constituent Analysis — Context-Free Languages Revisited (PSPJ, RWR), pp. 1–8.

STOC-1969-Rose #product line

Abstract Families of Processors (GFR), pp. 9–14.

STOC-1969-BookG #realtime

Quasi-Realtime Languages (RVB, SAG), pp. 15–18.

STOC-1969-Ullian #algorithm #ambiguity #context-free grammar #problem

The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages (JSU), pp. 19–20.

STOC-1969-Chandler #product line

Abstract Families of Deterministic Languages (WJC), pp. 21–30.

STOC-1969-Ogden #stack #theorem

Intercalation Theorems for Stack Languages (WFO), pp. 31–42.

STOC-1969-Blum #algorithm #effectiveness #on the

On Effective Procedures for Speeding Up Algorithms (MB), pp. 43–53.

STOC-1969-Basu #on the

On Classes of Computable Functions (SKB), pp. 55–59.

STOC-1969-Loveland #complexity #metric #on the

On Minimal-Program Complexity Measures (DWL), pp. 61–65.

STOC-1969-Borodin #complexity #recursion

Complexity Classes of Recursive Functions and the Existence of Complexity Gaps (AB), pp. 67–78.

STOC-1969-McCreightM #bound

Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report (EMM, ARM), pp. 79–88.

STOC-1969-Young #order #set

Speed-Ups by Changing the Order in Which Sets are Enumerated (PRY), pp. 89–92.

STOC-1969-AhoU #context-free grammar

Translations on a Context Free Grammar (AVA, JDU), pp. 93–112.

STOC-1969-Johansen #regular expression

Free Groups and Regular Expressions (PJ), pp. 113–128.

STOC-1969-Thatcher #automaton #finite

Transformations and Translations from the Point of View of Generalized Finite Automata Theory (JWT), pp. 129–142.

STOC-1969-Rounds #context-free grammar

Context-Free Grammars on Trees (WCR), pp. 143–148.

STOC-1969-HermanI

Computability over Arbitrary Fields (GTH, SDI), pp. 149–153.

STOC-1969-Shepard #algebra

Languages in General Algebras (CDS), pp. 155–163.

STOC-1969-RosenkrantzS #top-down

Properties of Deterministic Top Down Grammars (DJR, RES), pp. 165–180.

STOC-1969-Fischer #precedence

Some Properties of Precedence Languages (MJF), pp. 181–190.

STOC-1969-Korenjak #lr #performance

Efficient LR(1) Processor Construction (AJK), pp. 191–200.

STOC-1969-MannaP #formal method #recursion

Formalization of Properties of Recursively Defined Functions (ZM, AP), pp. 201–210.

STOC-1969-Zeiger #formal method #modelling #programming language

Formal Models for Some Features of Programming Languages (HPZ), pp. 211–215.

STOC-1969-Blum69a #compilation #formal method #programming language #semantics #towards

Towards a Theory of Semantics and Compilers for Programming Languages (EKB), pp. 217–227.

STOC-1969-Cook #automaton

Variations on Pushdown Machines (SAC), pp. 229–231.

STOC-1969-Cole #automaton #realtime

Pushdown Store Machines and Real-Time Computation (SNC), pp. 233–245.

STOC-1969-Savitch #nondeterminism #simulation #turing machine

Deterministic Simulation of Non-Deterministic Turing Machines (WJS), pp. 247–248.

STOC-1969-Hodes #complexity #geometry #logic

The Logical Complexity of Geometric Properties in the Plane (LH), pp. 249–254.

STOC-1969-Avizienis #complexity #on the #problem

On the Problem of Computational Time and Complexity of Arithmetic Functions (AA), pp. 255–258.

STOC-1969-AmorosoLY #array #formal method #framework

A Unifying Framework for the Theory of Iterative Arrays of Machines (SA, EL, HY), pp. 259–269.

STOC-1969-Spira #on the

On the Computation Time of Certain Classes of Boolean Functions (PMS), pp. 271–272.