Abstract is missing.
- On Linear Characterizations of Combinatorial Optimization ProblemsRichard M. Karp, Christos H. Papadimitriou. 1-9
- On a Class of Totally Unimodular MatricesMihalis Yannakakis. 10-16
- An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General GraphsSilvio Micali, Vijay V. Vazirani. 17-27
- Some Theorems about Matrix Multiplication (Extended Abstract)T. C. Hu, M. T. Shing. 28-35
- Polynomial-Time Algorithms for Permutation GroupsMerrick L. Furst, John E. Hopcroft, Eugene M. Luks. 36-41
- Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial TimeEugene M. Luks. 42-49
- A Fast Algorithm for Multiprocessor SchedulingBarbara Simons. 50-53
- Sparse Complete Sets for NP: Solution of a Conjecture of Berman and HartmanisStephen R. Mahaney. 54-60
- Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity ClassesIvan Hal Sudborough. 62-73
- Upper and Lower Bounds for First Order ExpressibilityNeil Immerman. 74-82
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is DecidableEitan M. Gurari. 83-85
- Succinct Representation, Random Strings, and Complexity ClassesGary L. Peterson. 86-95
- Proofs by Induction in Equational Theories with ConstructorsGérard P. Huet, Jean-Marie Hullot. 96-107
- An Improved Algorithm for Computing With EquationsPaul Chew. 108-117
- Programs and TypesRobert L. Constable. 118-128
- Process Logic: Expressiveness, Decidability, CompletenessDavid Harel, Dexter Kozen, Rohit Parikh. 129-142
- A Linear History Semantics for Distributed Languages (Extended Abstract)Nissim Francez, Daniel J. Lehmann, Amir Pnueli. 143-151
- The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)Harry B. Hunt III, Daniel J. Rosenkrantz. 152-160
- On the Expressive Power of Attribute GrammarsBruno Courcelle, Paul Franchi-Zannettacci. 161-172
- Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report)A. J. Kfoury. 173-184
- Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to DijkstraNeil D. Jones, Steven S. Muchnick. 185-190
- The Inherent Complexity of Dynamic Data Structures which Accommodate Range QueriesMichael L. Fredman. 191-199
- Efficient Uses of the PastDavid P. Dobkin, J. Ian Munro. 200-206
- Exploring Binary Trees and Other Simple TreesPhilippe Flajolet, Andrew M. Odlyzko. 207-216
- A General Class of Resource Tradeoffs (Extended Abstract)Jon Louis Bentley, Donna J. Brown. 217-228
- Some Observations on the Average Behavior of Heapsort (Preliminary Report)Ernst-Erich Doberkat. 229-237
- Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract)Jeffrey Scott Vitter. 238-247
- Biased 2-3 TreesSamuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan. 248-254
- Implicit Data Structures with Fast Update (Preliminary Report)Greg N. Frederickson. 255-259
- The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract)Robert W. Floyd, Jeffrey D. Ullman. 260-269
- Area-Efficient Graph Layouts (for VLSI)Charles E. Leiserson. 270-281
- A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)Andrea S. LaPaugh. 282-293
- A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract)Jean Vuillemin. 294-300
- On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report)F. Frances Yao. 301-307
- A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract)Dov Harel. 308-319
- Parsing for Structural Editors (Extended Abstract)Mark N. Wegman. 320-327
- Algebraic Dependencies (Extended Abstract)Mihalis Yannakakis, Christos H. Papadimitriou. 328-332
- Structure and Complexity of Relational QueriesAshok K. Chandra, David Harel. 333-347
- On Similarity and Duality of Computation (Extended Abstract)Jia-Wei Hong. 348-359
- Hardware Complexity and Parallel Computation (Preliminary Version)Patrick W. Dymond, Stephen A. Cook. 360-372
- A Distributed Abstract Data Type Implemented by a Probabilistic Communication SchemeNissim Francez, Michael Rodeh. 373-379
- A Time-Luck Tradeoff in CryptographyGilles Brassard. 380-386
- On Distinguishing Prime Numbers from Composite Numbers (Abstract)Leonard M. Adleman. 387-406
- N-Process Synchronization by 4 log _2 N-Valued Shared VariablesMichael O. Rabin. 407-410
- A Recognition Algorithm for Deterministic CFLS optimal in Time and SpaceBurchard von Braunmühl, Rutger Verbeek. 411-420