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=97
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded linear logic: A modular approach to polynomial-time computability
Jean-Yves Girard
,
Andre Scedrov
,
Philip J. Scott
Theoretical Computer Science
97
, 1992, pp. 1-66
Semantics and reasoning with free procedures
Steven M. German
Theoretical Computer Science
97
, 1992, pp. 67-81
Operational semantics of a kernel of the language ELECTRE
Jean Perraud
,
Olivier Roux
,
Marc Huou
Theoretical Computer Science
97
, 1992, pp. 83-103
Integer programs for logic constraint satisfaction
Angelo Monfroglio
Theoretical Computer Science
97
, 1992, pp. 105-130
Fairness, distances and degrees
Philippe Darondeau
,
Doris Nolte
,
Lutz Priese
,
Serge Yoccoz
Theoretical Computer Science
97
, 1992, pp. 131-142
A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
Stefano Baratella
Theoretical Computer Science
97
, 1992, pp. 143-156
Extension of combinatory logic to a theory of combinatory representation
Trudy Weibel
Theoretical Computer Science
97
, 1992, pp. 157-173
A slight strengthening of a theorem of Blair and Kunen
Kees Doets
Theoretical Computer Science
97
, 1992, pp. 175-181
Generalizations of Opt P to the polynomial hierarchy
Mark W. Krentel
Theoretical Computer Science
97
, 1992, pp. 183-198
On polynomial-time Turing and many-one completeness in PSPACE
Osamu Watanabe
,
Shouwen Tang
Theoretical Computer Science
97
, 1992, pp. 199-215
Extended regular expressions of arbitrary star degrees
Heekeun Yoo
,
Kosaburo Hashiguchi
Theoretical Computer Science
97
, 1992, pp. 217-231
Alternating automata, the weak monadic theory of trees and its complexity
David E. Muller
,
Ahmed Saoudi
,
Paul E. Schupp
Theoretical Computer Science
97
, 1992, pp. 233-244
Nivat's theorem for pushdown transducers
Georg Karner
Theoretical Computer Science
97
, 1992, pp. 245-262
The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
Richard A. Shore
,
Theodore A. Slaman
Theoretical Computer Science
97
, 1992, pp. 263-284
Lower bounds on the area complexity of Boolean circuits
Juraj Hromkovic̑
,
Sergej A. Loz̑kin
,
Andrej I. Rybko
,
Alexander A. Sapoz̑enko
,
Nadez̑da A. S̑kalikova
Theoretical Computer Science
97
, 1992, pp. 285-300
Star-free trace languages
Giovanna Guaiana
,
Antonio Restivo
,
Sergio Salemi
Theoretical Computer Science
97
, 1992, pp. 301-311