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=J. Comput.~Syst.~Sci. AND Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The implication and finite implication problems for typed template dependencies
M.Y. Vardi
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 3-28
Inclusion dependencies and their interaction with functional dependencies
M.A. Casanova
,
R. Fagin
,
C.H. Papadimitriou
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 29-59
The tree projection theorem and relational query processing
N. Goodman
,
O. Shmueli
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 60-79
The relational model of data and cylindric algebras
T. Imieliński
,
W., Jr. Lipski
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 80-102
Independent database schemas
M.H. Graham
,
M. Yannakakis
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 121-141
Database relations with null values
C. Zaniolo
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 142-166
Testing containment of conjunctive queries under functional and inclusion dependencies
D.S. Johnson
,
A. Klug
Journal of Computer and System Sciences
28
(1), 1984, February, pp. 167-189
A probabilistic dynamic logic
Y.A. Feldman
,
D. Harel
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 193-215
Space-bounded hierarchies and probabilistic computations
W.L. Ruzzo
,
J. Simon
,
M. Tompa
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 216-230
Data structures for distributed counting
M. Fürer
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 231-243
The complexity of facets (and some facets of complexity)
C.H. Papadimitriou
,
M. Yannakakis
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 244-259
Communication complexity
C.H. Papadimitriou
,
M. Sipser
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 260-269
Probabilistic encryption
S. Goldwasser
,
S. Micali
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 270-299
A framework for solving VLSI graph layout problems
S.N. Bhatt
,
F.T. Leighton
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 300-343
On the complexity of iterated shuffle
M.K. Warmuth
,
D. Haussler
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 345-358
Minimizing access pointers into trees and arrays
M.C. Loui
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 359-378
New trie data structures which support very fast search operations
D.E. Willard
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 379-394
The complexity of monadic recursion schemes: exponential time bounds
H.B. Hunt III
,
D.J. Rosenkrantz
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 395-419
One-layer routing without component constraints
E.L. Lloyd
,
S.S. Ravi
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 420-438
A complete inference system for a class of regular behaviours
R. Milner
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 439-466