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: Author="Kanellakis, P.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partition semantics for relations
S.S. Cosmadakis
,
P.C. Kanellakis
,
N. Spyratos
Journal of Computer and System Sciences
33
(2), 1986, October, pp. 203-233
2 Applications of Equational Theories to Database Theory
S.S. Cosmadakis
,
P.C. Kanellakis
Rewriting Techniques and Applications. Lecture Notes in Computer Science
202
, 1986, pp. 107-123
Logic programming and parallel complexity
P.C. Kanellakis
Technical Report (CS-86-23), 1986, October
Equational theories and database constraints
S.S. Cosmadakis
,
P.C. Kanellakis
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 273-284
The complexity of distributed concurrency control
P.C. Kanellakis
,
C.H. Papadimitriou
SIAM Journal on Computing
14
(1), 1985, February, pp. 52-74
Unary inclusion dependencies have polynomial time inference problems
P.C. Kanellakis
,
S.S. Cosmadakis
,
M.Y. Vardi
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 264-277
The complexity of distributed concurrency control
P.C. Kanellakis
,
C.H. Papadimitriou
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 185-197
On the computational complexity of cardinality constraints in relational databases
P.C. Kanellakis
Information Processing Letters
11
(2), 1980, October, pp. 98-101
Flowshop scheduling with limited temporary storage
C.H. Papadimitriou
,
P.C. Kanellakis
Journal of the ACM
27
(3), 1980, pp. 533-549