JCSS, Volume 33

Volume 33, Number 1, August 1986

• Ketan Mulmuley: Fully Abstract Submodels of Typed Lambda Calculi. 2-46
• Amos Fiat, Adi Shamir: Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. 47-65
• J. Ian Munro: An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. 66-74
• Miklos Santha, Umesh V. Vazirani: Generating Quasi-random Sequences from Semi-random Sources. 75-87
• Albert G. Greenberg, Alan Weiss: A Lower Bound for Probabilistic Algorithms for Finite State Machines. 88-105
• Ramamohan Paturi, Janos Simon: Probabilistic Communication Complexity. 106-123

Volume 33, Number 2, October 1986

• Heikki Mannila, Kari-Jouko Räihä: Design by Example: An Application of Armstrong Relations. 126-141
• Moshe Y. Vardi: Querying Logical Databases. 142-160
• Ouri Wolfson, Mihalis Yannakakis: Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. 161-178
• Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini: Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. 179-202
• Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. 203-233
• Tim Connors: Equivalence of Views by Query Capacity. 234-274
• Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking. 275-296
• Thanasis Hadzilacos, Christos H. Papadimitriou: Algorithmic Aspects of Multiversion Concurrency Control. 297-310

Volume 33, Number 3, December 1986

• Orna Grumberg, Nissim Francez, Shmuel Katz: A Complete Rule for Equifair Termination. 313-332
• Andrzej Tarlecki: Quasi-varieties in Abstract Algebraic Institutions. 333-360
• Serge Abiteboul, Nicole Bidoit: Non First Normal Form Relations: An Algebra Allowing Data Restructuring. 361-393
• Martin E. Kaliski, S. Yunkap Kwankam, Pamela Halpern, David Shulman: A Theory of Orbital Behavior in a Class of Nonlinear Systems: Chaos and a Signature-Based Approach. 394-414
• Dirk Janssens, Grzegorz Rozenberg, Emo Welzl: The Bounded Degree Problem for NLC Grammars is Decidable. 415-422
• Günter Hotz: A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory. 423-455
• Elias Dahlhaus, Manfred K. Warmuth: Membership for Growing Context-Sensitive Grammars is Polynomial. 456-472
• Howard C. Card, Adonios Thanailakis, Werner Pries, Robert D. McLeod: Analysis of Bounded Linear Cellular Automata Based on a Method of Image Charges. 473-480