Bulletin of the EATCS, Volume 26

Volume 26, June 1985

• Leonidas J. Guibas, John Hershberger: Computing the visibility graphs of n line segments in O(n_n) time. 13-20 BibTeX
• Christos H. Papadimitriou: A note the expressive power of Prolog. 21-22 BibTeX
• Athanasios K. Tsakalidis: The nearest common ancestor in a dynamic tree. 23-31 BibTeX
• Manfred Broy, Andrzej Tarlecki: Algebraic specification of the abstract data type "Continuum". 32-35 BibTeX
• Joost Engelfriet: The non-computability of computability. 36-39 BibTeX
• W. Erni, R. Geibel: Recognition of EOL by polynomial Boolean circuits. 40-42 BibTeX
• Haim Gaifman, Moshe Y. Vardi: A simple proof that connectivity of finite graphs is not first-order definable. 43-44 BibTeX
• Marian Gheorghe: Descriptional complexity measures suggested by Hartmann's error recovery scheme. 45-54 BibTeX
• Klaus-Jörn Lange: Addendum to "A note on the closure of EOL languages under erasing homomorphismus". 55 BibTeX
• Jean-Jacques Pansiot: Subword complexities and iteration. 55-62 BibTeX
• K. G. Subramanian: Regular control on NLC grammars. 63-64 BibTeX
• Moshe Y. Vardi: A responce to "A complete axiomatisation for full join dependencies in relations". 65-66 BibTeX
• Jozef Vyskoc: Pigeon-hole principle and Booleanmatrix multipication. 67-68 BibTeX