Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong
Proceedings of the Fifth Annual ACM Symposium on Theory of Computing
STOC, 1973.

@proceedings{STOC-1973,
	address       = "Austin, Texas, USA",
	editor        = "Alfred V. Aho and Allan Borodin and Robert L. Constable and Robert W. Floyd and Michael A. Harrison and Richard M. Karp and H. Raymond Strong",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Fifth Annual ACM Symposium on Theory of Computing}",
	year          = 1973,
}

Contents (30 items)

4 ×#algorithm
4 ×#complexity
3 ×#algebra
3 ×#analysis
3 ×#on the
3 ×#problem
3 ×#set
2 ×#evaluation
2 ×#fault
2 ×#multi

STOC-1973-StockmeyerM #exponential #problem #word

Word Problems Requiring Exponential Time: Preliminary Report (LJS, ARM), pp. 1–9.

STOC-1973-Hunt #complexity #on the

On the Time and Tape Complexity of Languages I (HBHI), pp. 10–19.

STOC-1973-Greibach #context-free grammar #polynomial

Jump PDA’s, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract (SAG), pp. 20–28.

STOC-1973-Cook

An Observation on Time-Storage Trade Off (SAC), pp. 29–33.

STOC-1973-Oppen #bound

Elementary Bounds for Presburger Arithmetic (DCO), pp. 34–37.

STOC-1973-Johnson #algorithm #approximate #combinator #problem

Approximation Algorithms for Combinatorial Problems (DSJ), pp. 38–49.

STOC-1973-Miller #fault #towards #verification

Toward Mechanical Verification of Properties of Roundoff Error Propagation (WM), pp. 50–58.

STOC-1973-Wand

An Unusual Application of Program-Proving (MW), pp. 59–66.

STOC-1973-FischerS #integer #multi #online #performance

Fast On-Line Integer Multiplication (MJF, LJS), pp. 67–72.

STOC-1973-HopcroftM #complexity #matrix #multi

Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms (JEH, JM), pp. 73–87.

STOC-1973-BrockettD #evaluation #on the #set

On the Optimal Evaluation of a Set of Bilinear Forms (RWB, DPD), pp. 88–95.

STOC-1973-Tarjan #graph #testing

Testing Flow Graph Reducibility (RET), pp. 96–107.

STOC-1973-Constable #complexity

Type Two Computational Complexity (RLC), pp. 108–121.

STOC-1973-Ladner #polynomial

Polynomial Time Reducibility (REL), pp. 122–129.

STOC-1973-LynchMF #set

Sets that Don’t Help (NAL, ARM, MJF), pp. 130–134.

STOC-1973-GentlemanJ #algorithm #analysis #case study

Analysis of Algorithms, a Case Study: Determinants of Polynomials (WMG, SCJ), pp. 135–141.

STOC-1973-Moenck #performance

Fast Computation of GCDs (RTM), pp. 142–151.

STOC-1973-Kung #algebra #complexity

The Computational Complexity of Algebraic Numbers (HTK), pp. 152–159.

STOC-1973-LewisRS

Attributed Translations (PMLI, DJR, RES), pp. 160–171.

STOC-1973-Pager #algorithm #lr #parsing

The Lane Tracing Algorithm for Constructing LR(k) Parsers (DP), pp. 172–181.

STOC-1973-Sethi #problem

Complete Register Allocation Problems (RS), pp. 182–195.

STOC-1973-Teitelbaum #algebra #analysis #evaluation #fault

Context-Free Error Analysis by Evaluation of Algebraic Power Series (RT), pp. 196–199.

STOC-1973-Baker #product line

Tree Transductions and Families of Tree Languges (BSB), pp. 200–206.

STOC-1973-WeinerSB #algorithm

Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.

STOC-1973-Wagner #algebra #programming language

From Algebras to Programming Languages (EGW), pp. 214–223.

STOC-1973-Vuillemin #implementation #programming language #recursion

Correct and Optimal Implementations of Recursion in a Simple Programming Language (JV), pp. 224–239.

STOC-1973-Kosaraju #analysis #source code

Analysis of Structured Programs (SRK), pp. 240–252.

STOC-1973-AhoHU #on the

On Finding Lowest Common Ancestors in Trees (AVA, JEH, JDU), pp. 253–265.

STOC-1973-Eilenberg #set

Classes of Semigroups and Classes of Sets (SE), pp. 266–267.

STOC-1973-Pratt #parallel #permutation

Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues (VRP), pp. 268–277.