Journal: J. Comput. Syst. Sci.

Volume 33, Issue 3

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

Volume 33, Issue 2

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

Volume 33, Issue 1

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