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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinite hypergraphs. II. Systems of recursive equations
Michel Bauderon
Theoretical Computer Science
103
, 1992, pp. 165-190
\infty
-regular temporal logic and its model checking problem
Kiyoharu Hamaguchi
,
Hiromi Hiraishi
,
Shuzo Yajima
Theoretical Computer Science
103
, 1992, pp. 191-204
Testing logic programs for local stratification
Luigi Palopoli
Theoretical Computer Science
103
, 1992, pp. 205-234
The revised report on the syntactic theories of sequential control and state
Matthias Felleisen
,
Robert Hieb
Theoretical Computer Science
103
, 1992, pp. 235-271
Modularity of simple termination of term rewriting systems with shared constructors
Masahito Kurihara
,
Azuma Ohuchi
Theoretical Computer Science
103
, 1992, pp. 273-282
A new subsumption method in the connection graph proof procedure
Byeong Man Kim
,
Jung Wan Cho
Theoretical Computer Science
103
, 1992, pp. 283-309
The mixed powerdomain
Carl A. Gunter
Theoretical Computer Science
103
, 1992, pp. 311-334
Towards an algebra for timed behaviours
Andrea Maggiolo-Schettini
,
Józef Winkowski
Theoretical Computer Science
103
, 1992, pp. 335-363
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
W. Marek
,
V.S. Subrahmanian
Theoretical Computer Science
103
, 1992, pp. 365-386
A simple proof of a theorem of Statman
Harry G. Mairson
Theoretical Computer Science
103
, 1992, pp. 387-394
Independence of the induction principle and the axiom of choice in the pure calculus of constructions
Thomas Streicher
Theoretical Computer Science
103
, 1992, pp. 395-408
Simulation of Turing machines by a regular rewrite rule
Max Dauchet
Theoretical Computer Science
103
, 1992, pp. 409-420
Map theory
Klaus Grue
Theoretical Computer Science
102
, 1992, pp. 1-133
Complete restrictions of the intersection type discipline
Steffen van Bakel
Theoretical Computer Science
102
, 1992, pp. 135-163
Maximality preserving bisimulation
Raymond Devillers
Theoretical Computer Science
102
, 1992, pp. 165-183
A polynomial-time algorithm to decide liveness of bounded free choice nets
Javier Esparza
,
Manuel Silva
Theoretical Computer Science
102
, 1992, pp. 185-205
Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic
Kosta Dos̑en
Theoretical Computer Science
102
, 1992, pp. 207-214
Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets
Danilo Bruschi
Theoretical Computer Science
102
, 1992, pp. 215-252
Binary periodic synchronizing sequences
Marcin Skubiszewski
Theoretical Computer Science
102
, 1992, pp. 253-281
Approximating the permanent of graphs with large factors
Paul Dagum
,
Michael Luby
Theoretical Computer Science
102
, 1992, pp. 283-305
The multiplicative complexity of quadratic boolean forms
R. Mirwald
,
C.P. Schnorr
Theoretical Computer Science
102
, 1992, pp. 307-328
A classification of minimal standard-path
2\times 2
switching networks
Liam Halpenny
,
Christopher J. Smyth
Theoretical Computer Science
102
, 1992, pp. 329-354
An asymptotic equality for the number of necklaces in a shuffle-exchange network
Lakshman Prasad
,
S.S. Iyengar
Theoretical Computer Science
102
, 1992, pp. 355-365
The monadic second-order logic of graphs VII: Graphs as relational structures
Bruno Courcelle
Theoretical Computer Science
101
, 1992, pp. 3-33
Capturing complexity classes by fragments of second-order logic
Erich Grädel
Theoretical Computer Science
101
, 1992, pp. 35-57
Seiten
<
1
2
3
4
5
6
7
8
9
>