default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 25
Volume 25, February 1985
- Stefan Arnborg, Andrzej Proskurowski:
Problems on graphs with bounded decomposability. Bull. EATCS 25: 7-10 (1985) - José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Examples of CFI-BI-immune and CF-levelable sets in logspace. Bull. EATCS 25: 11-13 (1985) - Serban Buzeteanu:
Some generalizations of Kleene's second fixed-point theorem. Bull. EATCS 25: 14-18 (1985) - Joaquim Gabarró:
Some applications of the interchange lemma. Bull. EATCS 25: 19-21 (1985) - Klaus-Jörn Lange:
A note on the closure of EDL-languages under erasing homomorphisms. Bull. EATCS 25: 22-23 (1985) - Thomas Ottmann, Michael Schrapp, Derick Wood:
Weight-balanced trees are not stratified. Bull. EATCS 25: 24-30 (1985) - Mark H. Overmars, Emo Welzl:
A simple method for solving 2-dimensional static range searching. Bull. EATCS 25: 31-33 (1985) - Gheorghe Paun:
On Pariki-boundedness of matrix languages. Bull. EATCS 25: 34-36 (1985) - Paul M. B. Vitányi:
Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bull. EATCS 25: 37-39 (1985) - Paavo Turakainen:
A note on test sets for IR-rational languages. Bull. EATCS 25: 40-41 (1985)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-03 22:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
