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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Universal axioms for bisimulations
Pierpaolo Degano
,
Rocco De Nicola
,
Ugo Montanari
Theoretical Computer Science
114
(1), 1993, pp. 63-91
Reachability in cyclic extended free-choice systems
Jörg Desel
,
Javier Esparza
Theoretical Computer Science
114
(1), 1993, pp. 93-118
The expressive power of implicit specifications
Kim Guldstrand Larsen
Theoretical Computer Science
114
(1), 1993, pp. 119-147
Modal logics for mobile processes
Robin Milner
,
Joachim Parrow
,
David Walker
Theoretical Computer Science
114
(1), 1993, pp. 149-171
Bisimulation and action refinement
Walter Vogler
Theoretical Computer Science
114
(1), 1993, pp. 173-200
Information systems for continuous posets
Steven Vickers
Theoretical Computer Science
114
(2), 1993, pp. 201-229
Propositional circumscription and extended closed-world reasoning are
\Pi^p_2
-complete
Thomas Eiter
,
Georg Gottlob
Theoretical Computer Science
114
(2), 1993, pp. 231-245
A relational division operator: the conjugate kernel
Jules Desharnais
,
Ali Jaoua
,
Fatma Mili
,
Noureddine Boudriga
,
Ali Mili
Theoretical Computer Science
114
(2), 1993, pp. 247-272
Higher-order unification via combinators
Daniel J. Dougherty
Theoretical Computer Science
114
(2), 1993, pp. 273-298
Terminal coalgebras in well-founded set theory
Michael Barr
Theoretical Computer Science
114
(2), 1993, pp. 299-315
A simple sequent calculus for partial functions
Morten Elvang-Gransson
,
Olaf Owe
Theoretical Computer Science
114
(2), 1993, pp. 317-330
Average-case analysis of unification algorithms
Luc Albert
,
Rafael Casas
,
François Fages
Theoretical Computer Science
113
, 1993, pp. 3-34
On the concatenation of infinite traces
Volker Diekert
Theoretical Computer Science
113
, 1993, pp. 35-54
Interactive proof systems and alternating time-space complexity
Lance Fortnow
,
Carsten Lund
Theoretical Computer Science
113
, 1993, pp. 55-73
On the power of several queues
Martin Hühne
Theoretical Computer Science
113
, 1993, pp. 75-91
Testing for unboundedness of fifo channels
Thierry Jéron
,
Claude Jard
Theoretical Computer Science
113
, 1993, pp. 93-117
On weakly confluent monadic string-rewriting systems
K. Madlener
,
P. Narendran
,
F. Otto
,
L. Zhang
Theoretical Computer Science
113
, 1993, pp. 119-165
Probabilistic polynomials,
AC^0
functions, and the polynomial-time hierarchy
Jun Tarui
Theoretical Computer Science
113
, 1993, pp. 167-183
Computability on computable metric spaces
Klaus Weihrauch
Theoretical Computer Science
113
, 1993, pp. 191-210
Analogy calculus
Bo Yi
,
Jiafu Xu
Theoretical Computer Science
113
, 1993, pp. 211-230
A true concurrency model of CCS semantics
Lu Ruqian
Theoretical Computer Science
113
, 1993, pp. 231-258
Analogical program derivation based on type theory
Jianguo Lu
,
Jiafu Xu
Theoretical Computer Science
113
, 1993, pp. 259-272
A theory of sequentiality
Antonio Bucciarelli
,
Thomas Ehrhard
Theoretical Computer Science
113
, 1993, pp. 273-291
Modular specification of process algebras
Rob van Glabbeck
,
Frits W. Vaandrager
Theoretical Computer Science
113
, 1993, pp. 293-348
Generating plans in linear logic. I. Actions as proofs
M. Masseron
,
C. Tollu
,
J. Vauzeilles
Theoretical Computer Science
113
, 1993, pp. 349-370
Seiten
<
1
2
3
4
5
6
7
8
9
10
>