Abstract is missing.
- Word Problems Requiring Exponential Time: Preliminary ReportLarry J. Stockmeyer, Albert R. Meyer. 1-9
- On the Time and Tape Complexity of Languages IHarry B. Hunt III. 10-19
- Jump PDA s, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended AbstractSheila A. Greibach. 20-28
- An Observation on Time-Storage Trade OffStephen A. Cook. 29-33
- Elementary Bounds for Presburger ArithmeticDerek C. Oppen. 34-37
- Approximation Algorithms for Combinatorial ProblemsDavid S. Johnson. 38-49
- Toward Mechanical Verification of Properties of Roundoff Error PropagationWebb Miller. 50-58
- An Unusual Application of Program-ProvingMitchell Wand. 59-66
- Fast On-Line Integer MultiplicationMichael J. Fischer, Larry J. Stockmeyer. 67-72
- Duality Applied to the Complexity of Matrix Multiplications and other Bilinear FormsJohn E. Hopcroft, J. Musinski. 73-87
- On the Optimal Evaluation of a Set of Bilinear FormsRoger W. Brockett, David P. Dobkin. 88-95
- Testing Flow Graph ReducibilityRobert Endre Tarjan. 96-107
- Type Two Computational ComplexityRobert L. Constable. 108-121
- Polynomial Time ReducibilityRichard E. Ladner. 122-129
- Sets that Don t HelpNancy A. Lynch, Albert R. Meyer, Michael J. Fischer. 130-134
- Analysis of Algorithms, a Case Study: Determinants of PolynomialsW. Morven Gentleman, Stephen C. Johnson. 135-141
- Fast Computation of GCDsRobert T. Moenck. 142-151
- The Computational Complexity of Algebraic NumbersH. T. Kung. 152-159
- Attributed TranslationsPhilip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns. 160-171
- The Lane Tracing Algorithm for Constructing LR(k) ParsersDavid Pager. 172-181
- Complete Register Allocation ProblemsRavi Sethi. 182-195
- Context-Free Error Analysis by Evaluation of Algebraic Power SeriesRay Teitelbaum. 196-199
- Tree Transductions and Families of Tree LangugesBrenda S. Baker. 200-206
- Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be InefficientPeter Weiner, S. L. Savage, A. Bagchi. 207-213
- From Algebras to Programming LanguagesEric G. Wagner. 214-223
- Correct and Optimal Implementations of Recursion in a Simple Programming LanguageJean Vuillemin. 224-239
- Analysis of Structured ProgramsS. Rao Kosaraju. 240-252
- On Finding Lowest Common Ancestors in TreesAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. 253-265
- Classes of Semigroups and Classes of SetsSamuel Eilenberg. 266-267
- Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel QueuesVaughan R. Pratt. 268-277