5. STOC 1973: Austin, Texas, USA
Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong (Eds.):
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA.
ACM 1973 
- Larry J. Stockmeyer, Albert R. Meyer:
Word Problems Requiring Exponential Time: Preliminary Report.
1-9
- Harry B. Hunt III:
On the Time and Tape Complexity of Languages I.
10-19
- Sheila A. Greibach:
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract.
20-28
- Stephen A. Cook:
An Observation on Time-Storage Trade Off.
29-33
- Derek C. Oppen:
Elementary Bounds for Presburger Arithmetic.
34-37
- David S. Johnson:
Approximation Algorithms for Combinatorial Problems.
38-49
- Webb Miller:
Toward Mechanical Verification of Properties of Roundoff Error Propagation.
50-58
- Mitchell Wand:
An Unusual Application of Program-Proving.
59-66
- Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication.
67-72
- John E. Hopcroft, J. Musinski:
Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms.
73-87
- Roger W. Brockett, David P. Dobkin:
On the Optimal Evaluation of a Set of Bilinear Forms.
88-95
- Robert Endre Tarjan:
Testing Flow Graph Reducibility.
96-107
- Robert L. Constable:
Type Two Computational Complexity.
108-121
- Richard E. Ladner:
Polynomial Time Reducibility.
122-129
- Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer:
Sets that Don't Help.
130-134
- W. Morven Gentleman, Stephen C. Johnson:
Analysis of Algorithms, a Case Study: Determinants of Polynomials.
135-141
- Robert T. Moenck:
Fast Computation of GCDs.
142-151
- H. T. Kung:
The Computational Complexity of Algebraic Numbers.
152-159
- Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations.
160-171
- David Pager:
The Lane Tracing Algorithm for Constructing LR(k) Parsers.
172-181
- Ravi Sethi:
Complete Register Allocation Problems.
182-195
- Ray Teitelbaum:
Context-Free Error Analysis by Evaluation of Algebraic Power Series.
196-199
- Brenda S. Baker:
Tree Transductions and Families of Tree Languges.
200-206
- Peter Weiner, S. L. Savage, A. Bagchi:
Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient.
207-213
- Eric G. Wagner:
From Algebras to Programming Languages.
214-223
- Jean Vuillemin:
Correct and Optimal Implementations of Recursion in a Simple Programming Language.
224-239
- S. Rao Kosaraju:
Analysis of Structured Programs.
240-252
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees.
253-265
- Samuel Eilenberg:
Classes of Semigroups and Classes of Sets.
266-267
- Vaughan R. Pratt:
Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues.
268-277
Last update Thu May 23 07:18:06 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
