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, Paris"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Object identity as a query language primitive
Serge Abiteboul
,
Paris C. Kanellakis
Journal of the ACM
45
(5), 1998, pp. 798-842
Parallel algorithms with processor failures and delays
Jonathan F. Buss
,
Paris C. Kanellakis
,
Prabhakar L. Ragde
,
Alex Allister Shvartsman
Journal of Algorithms
20
(1), 1996, pp. 45-86
Database query languages embedded in the typed lambda calculus
Gerd G. Hillebrand
,
Paris C. Kanellakis
,
Harry G. Mairson
Information and Computation
127
(2), 1996, pp. 117-144
Indexing for data models with constraints and classes
Paris Kanellakis
,
Sridhar Ramaswamy
,
Darren E. Vengroff
,
Jeffrey Scott Vitter
Journal of Computer and System Sciences
52
(3), 1996, pp. 589-612
Method schemas
Serge Abiteboul
,
Paris Kanellakis
,
Sridhar Ramaswamy
,
Emmanuel Waller
Journal of Computer and System Sciences
51
(3), 1995, pp. 433-455
On similarity queries for time-series data: Constraint specification and implementation
Dina Q. Goldin
,
Paris C. Kanellakis
Lecture Notes in Computer Science
976
, 1995, pp. 137-153
Constraint query languages
Paris C. Kanellakis
,
Gabriel M. Kuper
,
Peter Z. Revesz
Journal of Computer and System Sciences
51
(1), 1995, pp. 26-52
An analysis of the Core-ML language: Expressive power and type reconstruction
Paris C. Kanellakis
,
Gerd G. Hillebrand
,
Harry G. Mairson
Lecture Notes in Computer Science
820
, 1994, pp. 83-105
Efficient parallelism vs reliable distribution: A trade-off for concurrent computations
Paris C. Kanellakis
,
Dimitrios Michailidis
,
Alex A. Shvartsman
Lecture Notes in Computer Science
836
, 1994, pp. 242-266
On the representation and querying of sets of possible worlds
Serge Abiteboul
,
Paris Kanellakis
,
Gösta Grahne
Theoretical Computer Science
78
, 1991, pp. 159-187
Bounds on the propagation of selection into logic programs
Catriel Beeri
,
Paris Kanellakis
,
François Bancilhon
,
Raghu Ramakrishnan
Journal of Computer and System Sciences
41
, 1990, pp. 157-180
A data structure for arc insertion and regular path finding
Adam L. Buchsbaum
,
Paris C. Kanellakis
,
Jeffrey S. Vitter
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 22-31
Polynomial-time implication problems for unary inclusion dependencies
Stavros S. Cosmadakis
,
Paris C. Kanellakis
,
Moshe Y. Vardi
Journal of the ACM
37
(1), 1990, January, pp. 15-46
CCS expressions, finite state processes, and three problems of equivalence
Paris C. Kanellakis
,
Scott A. Smolka
Information and Computation
86
(1), 1990, pp. 43-68
On the relationship of congruence closure and unification
Paris C. Kanellakis
,
Peter Z. Revesz
Journal Symbolic Computation
7
(3-4), 1989, pp. 427-444
Efficient parallelism for structured data: Directed reachability in s-p dags
Foto N. Afrati
,
Dina Q. Goldin
,
Paris C. Kanellakis
misc, 1988, January
Decidable optimization problems for database logic programs
Stavros Cosmadakis
,
Haim Gaifman
,
Paris Kanellakis
,
Moshe Vardi
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 477-490
Parallel algorithms for term matching
Cynthia Dwork
,
Paris C. Kanellakis
,
Larry Stockmeyer
SIAM Journal on Computing
17
, 1988, pp. 711-731
On the analysis of cooperation and antagonism in networks of communicating processes
Paris C. Kanellakis
,
Scott A. Smolka
Algorithmica
3
, 1988, pp. 421-450
Parallel algorithms for term matching
Cynthia Dwork
,
Paris Kanellakis
,
Larry Stockmeyer
Technical Report (RJ 5328), 1986, October