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.
Graphical versus logical specifications
GĂ©rard Boudol
,
Kim G. Larsen
Theoretical Computer Science
106
, 1992, pp. 3-20
More efficient bottom-up multi-pattern matching in trees
J. Cai
,
R. Paige
,
R. Tarjan
Theoretical Computer Science
106
, 1992, pp. 21-60
On the regular structure of prefix rewriting
Didier Caucal
Theoretical Computer Science
106
, 1992, pp. 61-86
Testing for the ground (co-)reducibility property in term-rewriting systems
Emmanuel Kounalis
Theoretical Computer Science
106
, 1992, pp. 87-117
Interpretations of recursively defined types
Michael I. Schwartzbach
Theoretical Computer Science
106
, 1992, pp. 119-134
Single-valuedness of tree transducers is decidable in polynomial time
Helmut Seidl
Theoretical Computer Science
106
, 1992, pp. 135-181
Confluent linear numeration systems
Christiane Frougny
Theoretical Computer Science
106
, 1992, pp. 183-219
Complexity of logical theories involving coprimality
Pascal Michel
Theoretical Computer Science
106
, 1992, pp. 221-241
Deterministic analysis of queueing systems with heterogeneous servers
Muhammad El-Taha
,
Shaler, Jr. Stidham
Theoretical Computer Science
106
, 1992, pp. 243-264
Fast geometric approximation techniques and geometric embedding problems
Marshall W. Bern
,
Howard J. Karloff
,
Prabhakar Raghavan
,
Baruch Schieber
Theoretical Computer Science
106
, 1992, pp. 265-281
Complexity in left-associative grammar
Roland Hausser
Theoretical Computer Science
106
, 1992, pp. 283-308
The complexity of coloring games on perfect graphs
Hans L. Bodlaender
,
Dieter Kratsch
Theoretical Computer Science
106
, 1992, pp. 309-326
More languages of generalised star height 1
J.M. Robson
Theoretical Computer Science
106
, 1992, pp. 327-335
The theory of
\langle N, +, V_k, V_l \rangle
is undecidable
Roger Villemaire
Theoretical Computer Science
106
, 1992, pp. 337-349
Separating complexity classes related to
\Omega
-decision trees
Carsten Damm
,
Christoph Meinel
Theoretical Computer Science
106
, 1992, pp. 351-360
A sublinear parallel algorithm for some dynamic programming problems
Shou-Hsuan Stephen Huang
,
Hongfei Liu
,
Venkatraman Viswanathan
Theoretical Computer Science
106
, 1992, pp. 361-371
Lyndon trees
K.G. Subramanian
,
Rani Siromoney
,
Lisa Mathew
Theoretical Computer Science
106
, 1992, pp. 373-383
On the distributional complexity of disjointness
A.A. Razborov
Theoretical Computer Science
106
, 1992, pp. 385-390
Comments on ``On the balance property of Patricia tries: External path length viewpoint''
Arne Andersson
Theoretical Computer Science
106
, 1992, pp. 391-393
Probabilistic modeling of data structures on words-A reply to Professor Andersson's letter
Peter Kirschenhofer
,
Helmut Prodinger
,
Wojciech Szpankowski
Theoretical Computer Science
106
, 1992, pp. 395-400
On the relations between stable and well-founded semantics of logic programs
Phan Minh Dung
Theoretical Computer Science
105
, 1992, pp. 7-25
Transforming normal logic programs to constraint logic programs
Kanchana Kanchanasut
,
Peter J. Stuckey
Theoretical Computer Science
105
, 1992, pp. 27-56
Equivalence-preserving first-order unfold/fold transformation systems
Taisuke Sato
Theoretical Computer Science
105
, 1992, pp. 57-84
Unfolding and fixpoint semantics of concurrent constraint logic programs
Maurizio Gabbrielli
,
Giorgio Levi
Theoretical Computer Science
105
, 1992, pp. 85-128
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Dieter Hofbauer
Theoretical Computer Science
105
, 1992, pp. 129-140
Seiten 1
2
3
4
5
6
7
8
9
>