default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 26
Volume 26, June 1985
- Leonidas J. Guibas, John Hershberger:
Computing the visibility graphs of n line segments in O(nn) time. Bull. EATCS 26: 13-20 (1985) - Christos H. Papadimitriou:
A note the expressive power of Prolog. Bull. EATCS 26: 21-22 (1985) - Athanasios K. Tsakalidis:
The nearest common ancestor in a dynamic tree. Bull. EATCS 26: 23-31 (1985) - Manfred Broy, Andrzej Tarlecki:
Algebraic specification of the abstract data type "Continuum". Bull. EATCS 26: 32-35 (1985) - Joost Engelfriet:
The non-computability of computability. Bull. EATCS 26: 36-39 (1985) - W. Erni, R. Geibel:
Recognition of EOL by polynomial Boolean circuits. Bull. EATCS 26: 40-42 (1985) - Haim Gaifman, Moshe Y. Vardi:
A simple proof that connectivity of finite graphs is not first-order definable. Bull. EATCS 26: 43-44 (1985) - Marian Gheorghe:
Descriptional complexity measures suggested by Hartmann's error recovery scheme. Bull. EATCS 26: 45-54 (1985) - Klaus-Jörn Lange:
Addendum to "A note on the closure of EOL languages under erasing homomorphismus". Bull. EATCS 26: 55 (1985) - Jean-Jacques Pansiot:
Subword complexities and iteration. Bull. EATCS 26: 55-62 (1985) - K. G. Subramanian:
Regular control on NLC grammars. Bull. EATCS 26: 63-64 (1985) - Moshe Y. Vardi:
A responce to "A complete axiomatisation for full join dependencies in relations". Bull. EATCS 26: 65-66 (1985) - Jozef Vyskoc:
Pigeon-hole principle and Booleanmatrix multipication. Bull. EATCS 26: 67-68 (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 2024-11-30 00:19 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
