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 YEAR=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some nonstandard Ramsey like applications
J. Nes̑etȓil
Theoretical Computer Science
34
(1,2), 1984, pp. 3-15
Computation times of NP sets of different densities
J. Hartmanis
,
Y. Yesha
Theoretical Computer Science
34
(1,2), 1984, pp. 17-32
Synchronization trees
G. Winskel
Theoretical Computer Science
34
(1,2), 1984, pp. 33-82
Testing equivalences for processes
R. de Nicola
,
M.C.B. Hennessy
Theoretical Computer Science
34
(1,2), 1984, pp. 83-133
Linear time and branching time semantics for recursion with merge
J.W. de Bakker
,
J.A. Bergstra
,
J.W. Klop
,
J.-J.Ch. Meyer
Theoretical Computer Science
34
(1,2), 1984, pp. 135-156
On the simulation of many storage heads by one
P.M.B. Vitányi
Theoretical Computer Science
34
(1,2), 1984, pp. 157-168
Algebraic languages and polyominoes enumeration
M.-P. Delest
,
G. Viennot
Theoretical Computer Science
34
(1,2), 1984, pp. 169-206
Factoring multivariate integral polynomials
A.K. Lenstra
Theoretical Computer Science
34
(1,2), 1984, pp. 207-213
Symmetric and economical solutions to the mutual exclusion problem in a distributed system
S. Cohen
,
D. Lehmann
,
A. Pnueli
Theoretical Computer Science
34
(1,2), 1984, pp. 215-225
Enumeration of success patterns in logic programs
T. Sato
,
H. Tamaki
Theoretical Computer Science
34
(1,2), 1984, pp. 227-240
Partial commutations and faithful rational transductions
M. Clerbout
,
M. Latteux
Theoretical Computer Science
34
(3), 1984, pp. 241-254
New families of non real time dpda's and their decidability results
Y. Itzhaik
,
A. Yehudai
Theoretical Computer Science
34
(3), 1984, pp. 255-274
Total objects of domains
T. Kamimura
,
A. Tang
Theoretical Computer Science
34
(3), 1984, pp. 275-288
Algebraic and operational semantics of specifications allowing exceptions and errors
M. Gogolla
,
K. Drosten
,
U. Lipeck
,
H.-D. Ehrich
Theoretical Computer Science
34
(3), 1984, pp. 289-313
Membership problems for data dependencies in relational expressions
M. Ito
,
M. Iwasaki
,
K. Taniguchi
,
T. Kasami
Theoretical Computer Science
34
(3), 1984, pp. 315-335
On small generators
U. Schöning
Theoretical Computer Science
34
(3), 1984, pp. 337-341
A sound and complete axiomatization of embedded cross dependencies
F. Bancilhon
,
Ph. Richard
Theoretical Computer Science
34
(3), 1984, pp. 343-350
Infinite arrays and controlled deterministic table OL array systems
R. Siromoney
,
K.G. Subramanian
,
V.R. Dare
Theoretical Computer Science
33
(1), 1984, pp. 3-11
Homomorphic images of sentential form languages defined by semi-Thue systems
M. Jantzen
,
M. Kudlek
Theoretical Computer Science
33
(1), 1984, pp. 13-43
Parametric channels via label expressions in CCS
E. Astesiano
,
E. Zucca
Theoretical Computer Science
33
(1), 1984, pp. 45-63
Fair termination revisited -- with delay
K.R. Apt
,
A. Pnueli
,
J. Stavi
Theoretical Computer Science
33
(1), 1984, pp. 65-84
Coping with known patterns of lies in a search game
B. Ravikumar
,
K.B. Lakshmanan
Theoretical Computer Science
33
(1), 1984, pp. 85-94
Some results on the deductive structure of join dependencies
P. Dybjer
Theoretical Computer Science
33
(1), 1984, pp. 95-105
Secondary attribute retrieval using tree data structures
C.E. Veni Madhavan
Theoretical Computer Science
33
(1), 1984, pp. 107-116
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
V.Ya. Pan
Theoretical Computer Science
33
(1), 1984, pp. 117-138
Seiten 1
2
3
4
5
>