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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Restructuring hierarchical database objects
Serge Abiteboul
,
Richard Hull
Theoretical Computer Science
62
, 1988, pp. 3-38
Set containment inference and syllogisms
Paolo Atzeni
,
D. Stott Parker
Theoretical Computer Science
62
, 1988, pp. 39-65
On the desirability of
\gamma
-acyclic BCNF database schemes
Edward P.F. Chan
,
Héctor J. Hernández
Theoretical Computer Science
62
, 1988, pp. 67-104
Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers
V.S. Lakshmanan
Theoretical Computer Science
62
, 1988, pp. 105-122
Introduction to the theory of nested transactions
Nancy Lynch
,
Michael Merritt
Theoretical Computer Science
62
, 1988, pp. 123-185
The generalized counting method for recursive logic queries
Domenico Saccà
,
Carlo Zaniolo
Theoretical Computer Science
62
, 1988, pp. 187-220
Interaction-free multivalued dependency sets
Dirk Van Gucht
Theoretical Computer Science
62
, 1988, pp. 221-233
A representation of recursively enumerable languages by two homomorphisms and a quotient
Villiam Geffert
Theoretical Computer Science
62
, 1988, pp. 235-249
An average-case analysis of MAT and inverted file
Nageswara S.V. Rao
,
S.S. Iyengar
,
R.L. Kashyap
Theoretical Computer Science
62
, 1988, pp. 251-266
A pumping result for 2-context-free languages
Kai Salomaa
Theoretical Computer Science
62
, 1988, pp. 267-287
On the power of recursive optimizers
Thomas Zeugmann
Theoretical Computer Science
62
, 1988, pp. 289-310
Resolution proofs of generalized pigeonhole principles
Samuel R. Buss
,
György Turán
Theoretical Computer Science
62
, 1988, pp. 311-317
The power of nondeterminism in polynomial-size bounded-width branching programs
Christoph Meinel
Theoretical Computer Science
62
, 1988, pp. 319-325
A generalization of automatic sequences
Jeffrey Shallit
Theoretical Computer Science
61
, 1988, pp. 1-16
Critical classes for the
\alpha_0
-product
Pál Dömösi
,
Zoltán ésik
Theoretical Computer Science
61
, 1988, pp. 17-24
On a subclass of
\infty
-regular languages
Ivan Mezník
Theoretical Computer Science
61
, 1988, pp. 25-32
A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
Xin He
Theoretical Computer Science
61
, 1988, pp. 33-47
An optimistic ternary simulation of gate races
C.-J. Seger
,
J.A. Brzozowski
Theoretical Computer Science
61
, 1988, pp. 49-66
Comparison of two graph-rewrite systems
P.M. van den Broek
Theoretical Computer Science
61
, 1988, pp. 67-81
Implementing first-order rewriting with constructor systems
Satish Thatte
Theoretical Computer Science
61
, 1988, pp. 83-92
2-Asynchronous automata
Robert Cori
,
Eric Sopena
,
Michel Latteux
,
Yves Roos
Theoretical Computer Science
61
, 1988, pp. 93-102
The structure of generalized complexity cores
Ronald V. Book
,
Ding-Zhu Du
Theoretical Computer Science
61
, 1988, pp. 103-119
Parallel construction of perfect matchings and Hamiltonian cycles of dense graphs
Elias Dahlhaus
,
Marek Karpinski
Theoretical Computer Science
61
, 1988, pp. 121-136
Accepting conditions for automata on
\omega
-languages
Tetsuo Moriya
,
Hideki Yamasaki
Theoretical Computer Science
61
, 1988, pp. 137-147
Alternating multihead finite automata
K.N. King
Theoretical Computer Science
61
, 1988, pp. 149-174
Seiten 1
2
3
4
>