Information and Computation, Volume 61

Volume 61, Number 1, 1984

Edward G. Coffman Jr., Edgar N. Gilbert: Dynamic, First-Fit Packings in Two or More Dimensions. 1-14
Leonid A. Levin: Randomness Conservation Inequalities; Information and Independence in Mathematical Theories. 15-37
C. Mohan, Donald S. Fussell, Abraham Silberschatz: Compatibility and Commutativity of Lock Modes. 38-64
Yuri Gurevich, Harry R. Lewis: A Logic for Constant-Depth Circuits. 65-74

Catriel Beeri, Moshe Y. Vardi: On Acyclic Database Decompositions. 75-84
P. S. Thiagarajan, K. Vos: A Fresh Look at Free Choice Nets. 85-113
Ernst-Erich Doberkat: An Average Case Analysis of Floyd's Algorithm to Construct Heaps. 114-131
Gui Liang Feng, Kenneth K. Tzeng: On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding. 132-146
Peter H. Schmitt: Diamond Formulas: A Fragment of Dynamic Logic with Recursively Enumerable Validity Problem. 147-158
Shimon Even, Alan L. Selman, Yacov Yacobi: The Complexity of Promise Problems with Applications to Public-Key Cryptography. 159-173
Susumu Yamasaki, Shuji Doshita: Erratum: The Satisfiability Problem for a Class Consisting of Horn Sentences and Non-Horn Sentences in Proportional Logic. 174

E. Allen Emerson, A. Prasad Sistla: Deciding Full Branching Time Logic. 175-201
Manfred Broy: Semantics of Communicating Processes. 202-246
Damian Niwinski: Fixed-Point Characterization of Context-Free \infty-Languages. 247-276