Volume 64,
Number 1,
1989
- Hans-Jörg Stoß:
On the Representation of Rational Functions of Bounded Complexity.
1-13
- Hans-Jörg Stoß:
Lower Bounds for the Complexity of Polynomials.
15-23
- K. Jojczyk, J. Konieczny, T. Kuzak:
On Interleaving Behaviour of PT-Nets.
25-38
- Etsuji Tomita, Kazushi Seino:
A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict.
39-53
- Hiroyuki Sato:
E-CCC: Between CCC and Topos.
55-66
- Dang Van Hung, Elöd Knuth:
Semi-Commutations and Petri Nets.
67-81
- Eli Shamir, Assaf Schuster:
Communication Aspects of Networks Based on Geometric Incidence Relations.
83-96
- J. Roger Hindley:
BCK-Combinators and Linear lambda-Terms have Types.
97-105
- Zvi Galil, Raffaele Giancarlo:
Speeding up Dynamic Programming with Applications to Molecular Biology.
107-118
- Marco Protasi, Maurizio Talamo:
On the Number of Arithmetical Operations for Finding Fibonacci Numbers.
119-124
- Ephraim Korach, Shlomo Moran, Shmuel Zaks:
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
125-132
Volume 64,
Number 2,
1989
Volume 64,
Number 3,
1989
Copyright © Fri Dec 4 20:36:06 2009
by Michael Ley (ley@uni-trier.de)
