Abstract is missing.
- Definability in Dynamic LogicAlbert R. Meyer, Rohit Parikh. 1-7
- Logics for Probabilistic Programming (Extended Abstract)John H. Reif. 8-13
- Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic InterpretationsGrazyna Mirkowska. 14-21
- Dynamic Algebras and the Nature of InductionVaughan R. Pratt. 22-28
- A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown AutomataEsko Ukkonen. 29-38
- On the Distribution of Independent Formulae of Number TheoryDavid A. Plaisted. 39-44
- The Consistency of P = NP and Related Problems with Fragments of Number TheoryRichard A. DeMillo, Richard J. Lipton. 45-57
- Independence Results in Computer Science? (Preliminary Version)Deborah Joseph, Paul Young. 58-69
- Fast Allocation of Nearby Resources in a Distributed SystemNancy A. Lynch. 70-81
- Local and Global Properties in Networks of Processors (Extended Abstract)Dana Angluin. 82-93
- Deadlock- and Livelock-Free Packet Switching NetworksSam Toueg. 94-99
- Kraft Storage and Access for List Implementations (Extended Abstract)Donna J. Brown. 100-107
- Vector Execution of Flow Graphs (Extended Abstract)H. Raymond Strong. 108-116
- A Complete Axiomatization for a Large Class of Dependencies in Relational DatabasesFereidoon Sadri, Jeffrey D. Ullman. 117-122
- Horn Clauses and Database Dependencies (Extended Abstract)Ronald Fagin. 123-134
- Dynamically Maintaining Configurations in the Plane (Detailed Abstract)Mark H. Overmars, Jan van Leeuwen. 135-145
- Detection is Easier than Computation (Extended Abstract)Bernard Chazelle, David P. Dobkin. 146-153
- On Translating a Set of RectanglesLeonidas J. Guibas, F. Frances Yao. 154-160
- An Optimal Solution to a Wire-Routing Problem (Preliminary Version)Martin Tompa. 161-176
- Optimal Tree Layout (Preliminary Version)Michael J. Fischer, Mike Paterson. 177-189
- The Chip Complexity of Binary ArithmeticRichard P. Brent, H. T. Kung. 190-200
- The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract)James A. Storer. 201-210
- An Approach to The k Paths ProblemAllen Cypher. 211-217
- Isomorphism for Graphs Embeddable on the Projective PlaneDavid Lichtenstein. 218-224
- Isomorphism Testing for Graphs of Bounded GenusGary L. Miller. 225-235
- A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper)I. S. Filotti, Jack N. Mayer. 236-243
- Testing Isomorphism on Cone Graphs (Extended Abstract)Christoph M. Hoffmann. 244-251
- The Orbit Problem is DecidableRavindran Kannan, Richard J. Lipton. 252-261
- Testing Polynomials which Are Easy to Compute (Extended Abstract)Joos Heintz, Claus-Peter Schnorr. 262-272
- The Complexity of the Equivalence Problem for Straight-Line ProgramsOscar H. Ibarra, Brian S. Leininger. 273-280
- Complexity of Implementations on the Level of Algebraic SpecificationsHartmut Ehrig, Bernd Mahr. 281-293
- A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationAllan Borodin, Stephen A. Cook. 294-301
- Some Connections between Nonuniform and Uniform Complexity ClassesRichard M. Karp, Richard J. Lipton. 302-309
- On Some Deterministic Space Complexity ProblemsJia-Wei Hong. 310-317
- Space-time Tradeoffs and First Order Problems in a Model of ProgramsChee-Keng Yap. 318-325
- Graph Pebbling with Many Free Pebbles can be DifficultDavid A. Carlson, John E. Savage. 326-332
- Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space ImplementationsMartin Tompa. 333-338
- Time-Space Tradeoffs for some Algebraic ProblemsJoseph JáJá. 339-350
- Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version)Nicholas Pippenger. 351-356
- An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)Wolfgang J. Paul, Joel I. Seiferas, Janos Simon. 357-367
- Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract)Richard M. Karp, Robert Endre Tarjan. 368-377
- A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)Peter A. Bloniarz. 378-384
- Random MatroidsJohn H. Reif, Paul G. Spirakis. 385-397
- Heuristics for Weighted Perfect MatchingKenneth J. Supowit, David A. Plaisted, Edward M. Reingold. 398-419
- Generalized Selection and Ranking (Preliminary Version)Greg N. Frederickson, Donald B. Johnson. 420-428
- Efficient Dynamic Programming Using Quadrangle InequalitiesF. Frances Yao. 429-435
- Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract)Errol L. Lloyd. 436-446