default search action
Bulletin of the EATCS, Volume 37
Volume 37, February 1989
- Herbert Edelsbrunner:
The Computation Geometry Column. Bull. EATCS 37: 109-116 (1989)
- Juris Hartmanis:
The Structural Complexity Column. Bull. EATCS 37: 117-126 (1989)
- Jean Berstel:
Langford strings are square free. Bull. EATCS 37: 127-128 (1989) - Wilfried Brauer:
A remark on a note by M. A. Bednarczyk. Bull. EATCS 37: 129 (1989) - Janusz A. Brzozowski:
Minimization by reversal is not new. Bull. EATCS 37: 130 (1989) - Lothar Budach, Ernst-Günter Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel, Burkhard Molzan, Uwe Schäfer, Peter Zienicke:
Recursive VLSI design theory and application. Bull. EATCS 37: 131-150 (1989) - Ernst L. Leiss:
More on minimal finite automata. Bull. EATCS 37: 151 (1989) - Nalinakshi Nirmal, Raghavan Rama:
Note on (EOL-EOL) array systems. Bull. EATCS 37: 152-159 (1989) - Mark H. Overmars, Bertha Scholten, Ingrid Vincent:
Sets without emtpy convex 6-gons. Bull. EATCS 37: 160-167 (1989) - Peter Padawitz:
Can inductive proofs be automated? Part II. Bull. EATCS 37: 168-174 (1989) - Leonid Ya. Rosenblum, Alexandre Yakovlev, Vladimir Yakovlev:
A look at concurrency semantics through "lattice glasses". Bull. EATCS 37: 175-180 (1989) - Viorica Sofronie:
Formula-handling computer solution of Boolean equations, I. Ring equations. Bull. EATCS 37: 181-185 (1989) - Edith Spaan, Leen Torenvliet, Peter van Emde Boas:
Nondeterminism fairness and a fundamental analogy. Bull. EATCS 37: 186-193 (1989)
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.