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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Automatic inductive theorem proving using PROLOG
Jieh Hsiang
,
M. Srivas
Theoretical Computer Science
54
(1), 1987, September, pp. 3-28
Recursively defined domains and their induction principles
F.V. Jensen
,
K.D. Larsen
Theoretical Computer Science
54
(1), 1987, September, pp. 29-51
New protocols for the election of a leader in a ring
A. Marchetti-Spaccamela
Theoretical Computer Science
54
(1), 1987, September, pp. 53-64
Complexity of parallel matrix computations
V. Pan
Theoretical Computer Science
54
(1), 1987, September, pp. 65-85
Geometric optimization and the polynomial hierarchy
C. Bajaj
Theoretical Computer Science
54
(1), 1987, September, pp. 87-102
An algebraic theory of functional and multivalued dependencies in relational databases
V.S. Lakshmanan
,
C.E. Veni Madhavan
Theoretical Computer Science
54
(1), 1987, September, pp. 103-128
Approximation algorithms for weighted matching
S.M. Venkatesan
Theoretical Computer Science
54
(1), 1987, September, pp. 129-137
An introduction to the regular theory of fairness
L. Priese
,
R. Rehrmann
,
U. Willecke-Klemme
Theoretical Computer Science
54
(2-3), 1987, October, pp. 139-163
Construction of a family of codes associated with certain finite groups
G. Rindone
Theoretical Computer Science
54
(2-3), 1987, October, pp. 165-179
On domination problems for permutation and other graphs
A. Brandstadt
,
D. Kratsch
Theoretical Computer Science
54
(2-3), 1987, October, pp. 181-198
A complete axiomatic characterization of first-order temporal logic of linear time
A. Szalas
Theoretical Computer Science
54
(2-3), 1987, October, pp. 199-214
Discrete decision theory: manipulations
J.R.B. Cockett
Theoretical Computer Science
54
(2-3), 1987, October, pp. 215-236
An O(mn) algorithm for regular set-covering problems
P. Bertolazzi
,
A. Sassano
Theoretical Computer Science
54
(2-3), 1987, October, pp. 237-247
A comparison of polynomial time completeness notions
O. Watanabe
Theoretical Computer Science
54
(2-3), 1987, October, pp. 249-265
Alternating automata on infinite trees
D.E. Muller
,
P.E. Schupp
Theoretical Computer Science
54
(2-3), 1987, October, pp. 267-276
Asynchronous semantics and infinite behaviour in CSP
H. Fauconnier
Theoretical Computer Science
54
(2-3), 1987, October, pp. 277-298
Canonical forms for interval functions
S. Ginsburg
,
Chang-jie Tang
Theoretical Computer Science
54
(2-3), 1987, October, pp. 299-313
A function for evaluating the computing time of a bubbling system
K. Sado
,
Y. Igarashi
Theoretical Computer Science
54
(2-3), 1987, October, pp. 315-324
Simultaneous (poly-time, log-space) lower bounds
S. Iwata
,
T. Kasai
Theoretical Computer Science
54
(2-3), 1987, October, pp. 325-329
On reversal bounded alternating Turing machines
M. LiĆkiewicz
,
K. Lorys
,
M. Piotrow
Theoretical Computer Science
54
(2-3), 1987, October, pp. 331-339
On the continued fraction representation of computable real numbers
K.-I. Ko
Theoretical Computer Science
54
(2-3), 1987, October, pp. 341-343