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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rationality of the Möbius function of subword order
Anders Björner
,
Christophe Reutenauer
Theoretical Computer Science
98
, 1992, pp. 53-63
Attribute grammars are useful for combinatorics
M.P. Delest
,
J.M. Fedou
Theoretical Computer Science
98
, 1992, pp. 65-76
Séries de Malcev-Neumann sur le groupe libre et questions de rationalité
G. Cauchon
Theoretical Computer Science
98
, 1992, pp. 79-97
Skew power series rings with general commutation formula
François Dumas
Theoretical Computer Science
98
, 1992, pp. 99-114
Computable identities in the algebra of formal matrices
Bernard Mourrain
Theoretical Computer Science
98
, 1992, pp. 115-133
Differential-algebraic decision methods and some applications to system theory
Sette Diop
Theoretical Computer Science
98
, 1992, pp. 137-161
The ring of
k
-regular sequences
Jean-Paul Allouche
,
Jeffrey Shallit
Theoretical Computer Science
98
, 1992, pp. 163-197
The context-freeness of the languages associated with vector addition systems is decidable
Sylviane R. Schwer
Theoretical Computer Science
98
, 1992, pp. 199-247
The impact of the number of cooperating grammars on the generative power
Lila Santean
,
Jarkko Kari
Theoretical Computer Science
98
, 1992, pp. 249-262
A multiparameter analysis of domino tiling with an application to concurrent systems
Hsu-Chung Yen
Theoretical Computer Science
98
, 1992, pp. 263-287
Upper bounds on recognition of a hierarchy of non-context-free languages
Michael A. Palis
,
Sunil M. Shende
Theoretical Computer Science
98
, 1992, pp. 289-319
Varieties of finite monoids and Büchi-McNaughton theorem
Do Long Van
,
Phan Trung Huy
Theoretical Computer Science
98
, 1992, pp. 321-337
HARMONIC is 3-competitive for two servers
Marek Chrobak
,
Lawrence L. Larmore
Theoretical Computer Science
98
, 1992, pp. 339-346
Partial memorization for obtaining linear time behavior of a 2DPDA
Torben Amtoft
,
Jesper Larsson Träff
Theoretical Computer Science
98
, 1992, pp. 347-356
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
Seiten
<
1
2
3
4
5
6
7
8
9
>