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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for plane representations of acyclic digraphs
Giuseppe Di Battista
,
Roberto Tamassia
Theoretical Computer Science
61
, 1988, pp. 175-198
The equational theory of pomsets
Jay L. Gischer
Theoretical Computer Science
61
, 1988, pp. 199-224
Extraction and verification of programs by analysis of formal proofs
Werner Alexi
Theoretical Computer Science
61
, 1988, pp. 225-258
Determinism and looping in combinatory PDL
George Gargov
,
Solomon Passy
Theoretical Computer Science
61
, 1988, pp. 259-277
Ein Satz über die Entropie von Untermonoiden (A theorem on the entropy of submonoids)
Ludwig Staiger
Theoretical Computer Science
61
, 1988, pp. 279-282
A closure property of regular languages
Thomas Kretschmer
Theoretical Computer Science
61
, 1988, pp. 283-287
Logical definability of fixed points
André Arnold
Theoretical Computer Science
61
, 1988, pp. 289-297
Bilinear mincing rank
Edward G. Belaga
Theoretical Computer Science
61
, 1988, pp. 299-306
On finding a minimum dominating set in a tournament
Nimrod Megiddo
,
Uzi Vishkin
Theoretical Computer Science
61
, 1988, pp. 307-316
Designing equivalent semantic models for process creation
Pierre America
,
Jaco de Bakker
Theoretical Computer Science
60
, 1988, pp. 109-176
The laws of Occam programming
A.W. Roscoe
,
C.A.R. Hoare
Theoretical Computer Science
60
, 1988, pp. 177-229
Matching patterns in strings subject to multi-linear transformations
Tali Eilam-Tzoreff
,
Uzi Vishkin
Theoretical Computer Science
60
, 1988, pp. 231-254
Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée
Jean-Pierre Duval
Theoretical Computer Science
60
, 1988, pp. 255-283
On synchronizing unambiguous automata
Arturo Carpi
Theoretical Computer Science
60
, 1988, pp. 285-296
Towards a computation system based on set theory
Micheal J. Beeson
Theoretical Computer Science
60
, 1988, pp. 297-340
La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire
Jean-Claude Spehner
Theoretical Computer Science
60
, 1988, pp. 341-381
Narrowing vs.\ SLD-resolution
Pier Giorgio Bosco
,
Elio Giovannetti
,
Corrado Moiso
Theoretical Computer Science
59
, 1988, pp. 3-23
Concurrency and atomicity
G. Boudol
,
I. Castellani
Theoretical Computer Science
59
, 1988, pp. 25-84
Extensional models for polymorphism
Val Breazu-Tannen
,
Thierry Coquand
Theoretical Computer Science
59
, 1988, pp. 85-114
Characterizing finite Kripke structures in propositional temporal logic
M.C. Browne
,
E.M. Clarke
,
O. Grümberg
Theoretical Computer Science
59
, 1988, pp. 115-131
Inductive assertion method for logic programs
Wlodzimierz Drabent
,
Jan Maluszyński
Theoretical Computer Science
59
, 1988, pp. 133-155
The linear abstract machine
Y. Lafont
Theoretical Computer Science
59
, 1988, pp. 157-180
Principal type scheme and unification for intersection type discipline
Simona Ronchi della Rocca
Theoretical Computer Science
59
, 1988, pp. 181-209
Interpretations of recursion under unbounded nondeterminacy
Wim H. Hesselink
Theoretical Computer Science
59
, 1988, pp. 211-234
Deadlock and fairness in morphisms of transition systems
Wim H. Hesselink
Theoretical Computer Science
59
, 1988, pp. 235-257
Seiten
<
1
2
3
4
>