Volume 37,
February 1989
The Computational Geometry Column
The Structural Complexity Column
Technical Contributions
- Jean Berstel:
Langford strings are square free.
127-128
- Wilfried Brauer:
A remark on a note by M. A. Bednarczyk.
129
- Janusz A. Brzozowski:
Minimization by reversal is not new.
130
- 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.
131-150
- Ernst L. Leiss:
More on minimal finite automata.
151
- Nalinakshi Nirmal, Raghavan Rama:
Note on (EOL-EOL) array systems.
152-159
- Mark H. Overmars, Bertha Scholten, Ingrid Vincent:
Sets without emtpy convex 6-gons.
160-167
- Peter Padawitz:
Can inductive proofs be automated? Part II.
168-174
- Leonid Ya. Rosenblum, Alexandre Yakovlev, Vladimir Yakovlev:
A look at concurrency semantics through "lattice glasses".
175-180
- Viorica Sofronie:
Formula-handling computer solution of Boolean equations, I. Ring equations.
181-185
- Edith Spaan, Leen Torenvliet, Peter van Emde Boas:
Nondeterminism fairness and a fundamental analogy.
186-193
Last update Sat May 26 06:12:55 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
