Bulletin of the EATCS, Volume 82

Volume 82, February 2004

Columns

Kazuo Iwama: Worst-Case Upper Bounds for kSAT (Column: Algorithmics). 61-71
William I. Gasarch:
A Survey on Private Information Retrieval (Column: Computational Complexity). 72-107
Wan Fokkink, Jan Friso Groote, Michel A. Reniers:
Process Algebra Needs Proof Methodology (Columns: Concurrency). 109-125
Sotiris E. Nikoletseas, Paul G. Spirakis: The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing). 126-169
Solomon Marcus: Quasiperiodic Infinite Words (Columns: Formal Language Theory). 170-174
Hartmut Ehrig: Attributed Graphs and Typing: Reationshi between Different Representations (Column: Formal Specification). 175-190
Per F. V. Hasle, Peter Øhrstrøm: The Flow of Time into Logic - and Computer Science (Column: Logic in Computer Science). 191-226
Tero Harju, Ion Petre, Grzegorz Rozenberg: Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing). 227-241
Joshua D. Guttman: A New Column: Information Security. 242-252

Technical Contributions

Samee Ullah Khan: Integers, Game Trees and some Unknowns. 255-262
Andrzej Szepietowski, Monika Targan: The Counterfeit Coin Problem. 263-268
Sándor Vágvölgyi: Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. 269-285
Benedek Nagy: The Languages of SAT and n-SAT over Finitely Many Variables are Regular. 286-297

Education Matters

Hans J. Schneider: Introducing the parallel Random Access Machine together with FORTARN 90/95. 299-314