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=71
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Communication complexity of PRAMs
Alok Aggarwal
,
Ashok K. Chandra
,
Marc Snir
Theoretical Computer Science
71
, 1990, pp. 3-28
New techniques for proving the decidability of equivalence problems
Karel Culik II
Theoretical Computer Science
71
, 1990, pp. 29-45
Synthesis, structure and power of systolic computations
Jozef Gruska
Theoretical Computer Science
71
, 1990, pp. 47-77
New developments in structural complexity theory
J. Hartmanis
Theoretical Computer Science
71
, 1990, pp. 79-93
A complexity theory of efficient parallel algorithms
Clyde P. Kruskal
,
Larry Rudolph
,
Marc Snir
Theoretical Computer Science
71
, 1990, pp. 95-132
Some behavioural aspects of net theory
P.S. Thiagarajan
Theoretical Computer Science
71
, 1990, pp. 133-153
Semantics for logic programs without occur check
W.P. Weijland
Theoretical Computer Science
71
, 1990, pp. 155-174
Principles of plasma pattern and alternative structure compilation
Jean-Paul Arcangeli
,
Christian Pomian
Theoretical Computer Science
71
, 1990, pp. 177-191
Simple operational and denotational semantics for prolog with cut
Michel Billaud
Theoretical Computer Science
71
, 1990, pp. 193-208
Mixed computation and compilation: New approaches to old problems
Mikhail Bulyonkov
Theoretical Computer Science
71
, 1990, pp. 209-226
Constructive system for automatic program synthesis
Didier Galmiche
Theoretical Computer Science
71
, 1990, pp. 227-239
Computational and attribute models of formal languages
Jaan Penjam
Theoretical Computer Science
71
, 1990, pp. 241-264
An algorithm deciding functional equivalence in a new class of program schemes
Victor K. Sabelfeld
Theoretical Computer Science
71
, 1990, pp. 265-279
Some decision problems about controlled rewriting systems
GĂ©raud SĂ©nizergues
Theoretical Computer Science
71
, 1990, pp. 281-346
Combining data type and recursive process specifications using projection algebras
Hartmut Ehrig
,
Francesco Parisi-Presicce
,
Paul Boehm
,
Catharina Rieckhoff
,
Cristian Dimitrovici
,
Martin Grosse-Rhode
Theoretical Computer Science
71
, 1990, pp. 347-380
Sur les facteurs des suites de Sturm
S. Dulucq
,
D. Gouyou-Beauchamps
Theoretical Computer Science
71
, 1990, pp. 381-400
Optimally edge-colouring outerplanar graphs in NC
Alan Gibbons
,
Wojciech Rytter
Theoretical Computer Science
71
, 1990, pp. 401-411
A transformational characterization of if-then-else
E.G. Manes
Theoretical Computer Science
71
, 1990, pp. 413-417
A data structure useful for finding Hamiltonian cycles
M. Chrobak
,
T. Szymacha
,
A. Krawczyk
Theoretical Computer Science
71
, 1990, pp. 419-424
Non-recursiveness of the operations on real numbers
Kostas Skandalis
Theoretical Computer Science
71
, 1990, pp. 425-429