Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=64
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the representation of rational functions of bounded complexity
Hans-Jörg Stoß
Theoretical Computer Science
64
, 1989, pp. 1-13
Lower bounds for the complexity of polynomials
Hans-Jörg Stoß
Theoretical Computer Science
64
, 1989, pp. 15-23
On interleaving behaviour of PT-nets
K. Jojczyk
,
J. Konieczny
,
T. Kuzak
Theoretical Computer Science
64
, 1989, pp. 25-38
A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
Etsuji Tomita
,
Kazushi Seino
Theoretical Computer Science
64
, 1989, pp. 39-53
E-CCC: Between CCC and topos
Hiroyuki Sato
Theoretical Computer Science
64
, 1989, pp. 55-66
Semi-commutations and Petri nets
Dang Van Hung
,
Elöd Knuth
Theoretical Computer Science
64
, 1989, pp. 67-81
Communication aspects of networks based on geometric incidence relations
Eli Shamir
,
Assaf Schuster
Theoretical Computer Science
64
, 1989, pp. 83-96
BCK-combinators and linear
\gamma
-terms have types
J. Roger Hindley
Theoretical Computer Science
64
, 1989, pp. 97-105
Speeding up dynamic programming with applications to molecular biology
Zvi Galil
,
Raffaele Giancarlo
Theoretical Computer Science
64
, 1989, pp. 107-118
On the number of arithmetical operations for finding Fibonacci numbers
Marco Protasi
,
Maurizio Talamo
Theoretical Computer Science
64
, 1989, pp. 119-124
Optimal lower bounds for some distributed algorithms for a complete network of processors
E. Korach
,
S. Moran
,
S. Zaks
Theoretical Computer Science
64
, 1989, pp. 125-132
Techniques for parallel manipulation of sparse matrices
Clyde P. Kruskal
,
Larry Rudolph
,
Marc Snir
Theoretical Computer Science
64
, 1989, pp. 135-157
Optimal scheduling algorithms for parallel Gaussian elimination
Yves Robert
,
Denis Trystram
Theoretical Computer Science
64
, 1989, pp. 159-173
Design factors for parallel processing benchmarks
Gordon Lyon
Theoretical Computer Science
64
, 1989, pp. 175-189
Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
J.C. Bermond
,
J.M. Fourneau
Theoretical Computer Science
64
, 1989, pp. 191-201
Exact solutions for open, closed and mixed queueing networks with rejection blocking
I.F. Akyldiz
,
H. von Brand
Theoretical Computer Science
64
, 1989, pp. 203-219
Concurrent transition systems
Eugene W. Stark
Theoretical Computer Science
64
, 1989, pp. 221-269
Programs over aperiodic monoids
Denis Therien
Theoretical Computer Science
64
, 1989, pp. 271-280
Concurrent systems and inevitability
Antoni Mazurkiewicz
,
Edward Ochmański
,
Wojciech Penczek
Theoretical Computer Science
64
, 1989, pp. 281-304
Problems concerning fairness and temporal logic for conflict-free Petri nets
Rodney R. Howell
,
Louis E. Rosier
Theoretical Computer Science
64
, 1989, pp. 305-329
On Nec̑iporuk's theorem for branching programs
Noga Alon
,
Uri Zwick
Theoretical Computer Science
64
, 1989, pp. 331-342
Projections of vector addition system reachability sets are semilinear
Hans Kleine Büning
,
Theodor Lettmann
,
Ernst W. Mayr
Theoretical Computer Science
64
, 1989, pp. 343-350