Table Of Content

Index to Volume 27 ANDERSON, R. J.: Primitives for Asynchronous List Compression ATTIYA, H.: Efficiency of Semisynchronous Versus Asynchronous Networks BAR-NOY, A.: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems BARRINGTON, D. A. M.: see Frandsen, G. S. BEREND, D.: Computability by Finite Automata and Pisot Bases .. . BHATT, S. N.: Editor’s Foreword BIN FU: An Application of the Translational Method BOOK, R. V.: An Observation on Probability Versus Randomness with Applications to Complexity Classes CHAMBERLAIN, R. F.: Universality of Iterated Networks EHRENFEUCHT, A.: Semantics of Trees EVEN, S.: On the Capabilities of Systolic Systems FIDUCCIA, C. M.: see Chamberlain, R. F. FRANDSEN, G. S.: Some Results on Uniform Arithmetic Circuit Complexity FROUGNY, C.: see Berend, D. GAVALDA, R.: see Watanabe, O. GENG LIN: Parallel Algorithms for Routing in Nonblocking Networks HEMASPAANDRA, L. A.: see Kratsch,D. ................. HERMO, M.: A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity HERTZ, A.: A New Polynomial-Time Algorithm for the Maximum Weighted (y(G) — 1)-Coloring Problem in Comparability Graphs . . HONG-ZHOU LI: see Bin Fu KAKLAMANIS, C.: Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors ee ee MI Ps sk ts wd ne ele ek ee KRATSCH, D.: On the Complexity of Graph Reconstruction LITMAN, A.: see Even, S. LUTZ, J. H.: see Book, R. V. MAVRONICOLAS, M.: see Attiya, H MAYORDOMO, E.: see Hermo, M. MING LI: Statistical Properties of Finite Sequences with High Kolmogorov Complexity OBRENIC, B.: An Approach To Emulating Separable Graphs OGIWARA, M.: Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes PAPAEFTHYMIOU, M. C.: Understanding Retiming Through Maximum Average-Delay Cycles PERSIANO, G.: see Kaklamanis, C. PIPPENGER, N.: see Geng Lin 576 Index to Volume 27 PLAXTON, C. G.: A Lower Bound for Sorting Networks Based on the Shuffle Permutation RANADE, A.: Optimal Speedup for Backtrack Search on a Butterfly ROSENBERG, A. L.: Editor’s Foreword ROZENBERG, G.: see Ehrenfeucht, A. SALOMAA, K.: see Ehrenfeucht, A. SEIDL, H.: Equivalence of Finite-Valued Tree Transducers Is Decidable STEWART, I. A.: On Completeness for NP via Projection Translations SUEL, T.: see Plaxton, C. G. VALENCE, M.: see Frandsen, G. S. VIJAY-SHANKER, K.: The Equivalence of Four Extensions of Context-Free Grammars VITANYI, P. M. B.: see Ming Li WAGNER, K. W.: see Book, R. V. WATANABE, O.: A_ Framework for Polynomial-Time Query Learnability WATANABE, O.: Structural Analysis of Polynomial-Time Query Learnability Wen, Ge ot Oe We, Bie ee eee Re aee YONG ZHONG: see Bin Fu