Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Bulletin of the EATCS, Volume 64

> Home > Journals > Bulletin of the EATCS

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 64, February 1998

The Computational Complexity Column

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/ClementiRT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/ClementiRT98
Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Recent Advances Towards Proving P = BPP. Bull. EATCS 64 (1998)

Formal Specification Column

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/BergerH98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/BergerH98
Egon Börger, James K. Huggins:
Abstract State Machines 1988-1998: Commented ASM Bibliography. Bull. EATCS 64 (1998)

The Logic in Computer Science Column

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Urquhart98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Urquhart98
Alasdair Urquhart:
The Complexity of Propositional Proofs. Bull. EATCS 64 (1998)

The Concurrency Column

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/NestmannV98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/NestmannV98
Uwe Nestmann, Björn Victor:
Calculi for Mobile Processes - Bibliography and Web Pages. Bull. EATCS 64 (1998)

The Formal Language Theory Column

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Honkala98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Honkala98
Juha Honkala:
On Slender Languages. Bull. EATCS 64 (1998)

Technical Contributions

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Ben-Amram98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Ben-Amram98
Amir M. Ben-Amram:
Introducing: Reasonable Complete Programming Languages. Bull. EATCS 64 (1998)
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/KreinovichL98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/KreinovichL98
Vladik Kreinovich, Luc Longpré:
Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS 64 (1998)
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Martin-VideMP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Martin-VideMP98
Carlos Martín-Vide, Alexandru Mateescu, Gheorghe Paun:
Hybrid Grammars: The Chomsky-Marcus Case. Bull. EATCS 64 (1998)
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Tomescu98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Tomescu98
Ioan Tomescu:
A Threshold Property Concerning Words Containing All Short Factors. Bull. EATCS 64 (1998)

Surveys and Tutorials

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/Pisanti98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Pisanti98
Nadia Pisanti:
DNA Computing: A Survey. Bull. EATCS 64: 188-216 (1998)

a service of

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.