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=103
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting classes: thresholds, parity, mods, and fewness
Richard Beigel
,
John Gill
Theoretical Computer Science
103
, 1992, pp. 3-23
On games of incomplete information
Jin-yi Cai
,
Anne Condon
,
Richard J. Lipton
Theoretical Computer Science
103
, 1992, pp. 25-38
Semicommutations and algebraic languages
M. Clerbout
,
Y. Roos
Theoretical Computer Science
103
, 1992, pp. 39-49
An algebraic semantics for structured transition systems and its application to logic programs
Andrea Corradini
,
Ugo Montanari
Theoretical Computer Science
103
, 1992, pp. 51-106
Minimum vertex hulls for polyhedral domains
Gautam Das
,
Deborah Joseph
Theoretical Computer Science
103
, 1992, pp. 107-135
Sorting the sums
(x_i + y_j)
in
O(n^2)
comparisons
Jean-Luc Lambert
Theoretical Computer Science
103
, 1992, pp. 137-141
Infinite trees and automaton-definable relations over
\omega
-words
Wolfgang Thomas
Theoretical Computer Science
103
, 1992, pp. 143-159
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