In memoriam Paris C. Kanellakis
References
[1]
ABITEBOUL, S., AND KANELLAKIS, P.C. 1989. Deciding bounded recursion in database logic programs. SIGACT News 20, 4, Fall.
[2]
COSMADAKIS, S. S., GAIFMAN, H., KANELLAKIS, P. C., AND VARDI, M.Y. 1988. Decidable optimization problems for database logic programs. ACM Symposium on Theory of Computing (Chicago, IL), 477-490.
[3]
COSMADAKIS, S. S., AND KANELLAKIS, r. C. 1986. Parallel evaluation of recursive rule queries. ACM Symposium on Principles of Database Systems (Cambridge, MA), 280-293.
[4]
HILLEBRAND, G. G., KANELLAKIS, P. C., MAIRSON, H. G., AND VARDI, M.Y. 1995. Undecidable boundedness problems for datalog programs. J. Logic Program. 25 163-190. A preliminary version of this paper, "Tools for Datalog boundedness," appeared in the 1991 ACM Symposium on the Principles of Database Systems 1-13.
[5]
KANELLAKIS, P. C. 1988. Logic programming and parallel complexity. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, 547-585.
[6]
KANELLAKIS, P C. 1990. Elements of relational database theory. In Handbook of Theoretical Computer Science (A. R. Meyer, M. Nivat, M. S. Paterson, D. Perrin, and J. van Leeuwen, Eds.), vol. B, Ch. 17, North Holland, Amsterdam, 1075-1144.
[7]
ABITEBOUL, S., AND KANELLAKIS, P.C. 1989. Object identity as a query language primitive. J. ACM, to appear. Full version available as Brown Univ. Tech. Rep. CS-89-26.
[8]
ABITEBOUL, S., AND KANELLAKIS, r.C. 1991. The two facets of object-oriented data models. IEEE Data Eng. Bull. 15, 2 3-8.
[9]
ABITEBOUL, S., KANELLAKIS, r. C., RAMASWAMY, S., AND WALLER, E. 1995. Method schemas. J. Comput. Syst. Sci. 51, 3, 433-455.
[10]
BANCmHON, F., DELOBEL, C., AND KANELLAKIS, r. C. 1992. Building an Object-Oriented Database System: The Story of 02. Morgan Kaufmann.
[11]
CHANDRA, A. K., AND HAREL, n. 1985. Horn clause queries and generalizations. J. Logic Program. 2 1-15.
[12]
HILLEBRAND, G. G., KANELLAKIS, P. C., AND RAMASWAMY, S. 1994. Functional programming formalisms for OODB methods. InAdvances in Object-Oriented Databases, A. Dogac, M. Tamer 0zsu, A. Biliris, and T. Sellis, Eds., Springer-Verlag, Series F (Computer and Systems Sciences), vol. 130, Ch. 2.3, 73-98.
[13]
BENEDIKT, M., DONG, G., LIBKIN, L., AND WONG, L. 1995. Relational expressive power of constraint query languages. Manuscript.
[14]
GOLDIN, D. Q., AND KANELLAKIS, r.C. 1996. Constraint query algebras. Manuscript.
[15]
KANELLAKIS, r. C., AND GOLDIN, D.Q. 1994. Constraint programming and database query languages. Invited paper, Symposium on Theoretical Aspects of Computer Software Springer LNCS 789, 96-120. (Sendal Japan, Apr.) (Note: Full version invited to the first issue of the new journal Constraints.)
[16]
KANELLAKIS, r. C., KUPER, G. M., AND REVESZ, r.Z. 1995. Constraint query languages. J. Comput. Syst. Sci. special issue, Y. Sagiv, Ed. 51, I 26-52. An extended abstract appeared in the 1990 ACM Symposium on the Principles of Database Systems, 299-314.
[17]
KANELLAKIS, r. C., RAMASWAMY, S., VENGROFF, n. E., AND VITTER, J.S. Indexing for data models with constraints and classes. J. Comput. Syst. Sci. To appear (special issue C. Beeri, Ed.) An extended abstract appeared in 1993 ACM Symposium on the Principles of Database Systems, 233-243.
[18]
RAMASWAMY, S., AND KANELLAK~S, P. C. 1995. OODB indexing by class-division. In ACM Symposium on the Management of Data, 139-150.
[19]
Buss, J., KANELLAKIS, P. C., RAGDE, P., AND SHVARTSMAN, A. A. 1996. Parallel algorithms with processor failures and delays. J. Algorithms 20, 1, 45-86.
[20]
KANELLAKIS, P. C., MICHAILIDIS, D., AND SHVARTSMAN, A.A. 1994. Concurrency = fault-tolerance in parallel computation. In International Conference on Concurrency Theory (Uppsala). Springer LNCS vol. 836, 242-266.
[21]
KANELLAKIS, P. C., MICHAILIDIS, D., AND SHVARTSMAN, A.A. 1995. Controlling memory access concurrency in efficient fault-tolerant parallel algorithms. Nordic J. Comput. 2, 2, 146-180. A preliminary version appeared in 1993 International Workshop on Distributed Algorithms, 99-114.
[22]
KANELLAKIS, r. C., AND SHVARTSMAN, A.A. 1992. Efficient parallel algorithms can be made robust. Distrib. Comput. 5, 4 201-217. A preliminary version appeared in the 1989 ACM Symposium on Principles of Distributed Computing, 211-222.
[23]
KANELLAKIS, r. C., AND SHVARTSMAN, A.A. 1991. Efficient parallel algorithms on restartable fail-stop processors. ACM Symposium on Principles of Distributed Computing (Montreal, Que.), 23-37.
[24]
KANELLAKIS, r. C., AND SHVARTSMAN, A.A. 1994. Fault-tolerance and efficiency in massively parallel algorithms. In Foundations of Dependable Computing--Paradigms for Dependable Applications, G. M. Koob and C. G. Lau, Eds. Kluwer, 125-154.
[25]
ABITEBOUL, S. AND BEERI, C. 1988. On the power of languages for the manipulation of complex objects. INRIA Res. Rep. 846.
[26]
DWORK, C., KANELLAKIS, P., AND MITCHELL, J. C. 1984. On the sequential nature of unification. J. Logic Program 1, 1, 35-50.
[27]
HILLEBRAND, G. G., AND KANELLAKIS, P. C. 1994. Functional database query languages as typed lambda calculi of fixed order. In ACM Symposium on Principles of Database Systems, 222-231.
[28]
HILLEBRAND, G. G., AND KANELLAKIS, P. C. 1995. On the expressive power of simply-typed and let-polymorphic }ambda calculi. Manuscript.
[29]
HILLEBRAND, G. G., KANELLAKIS, P. C., AND MAIRSON, H.G. 1993. Database query languages embedded in the typed }ambda calculus. Inf. Comput. (A preliminary version appeared in the 1993 IEEE Symposium on Logic in Computer Science, 332-343.
[30]
HILLEBRAND, G. G., KANELLAKIS, P. C., MAIRSON, H. G. 1994. An analysis of core-ML: expressive power and type inference. In the International Colloquium on Automata, Languages and Programming (Jerusalem), Springer LNCS 820, 83-105.
[31]
IMMERMAN, N. 1986. Relational queries computable in polynomial time. Inf. Comput. 68, 86-104.
[32]
KANELLAKIS, r. C., MAIRSON, H. G., AND MITCHELL, J.C. 1991. Unification and ML type reconstruction. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. D. Plotkin, Eds. MIT Press, 444-478.
[33]
KANELLAKIS, r. C., AND MITCHELL, J. C. 1989. Polymorphic unification and ML typing. In ACM Symposium on the Principles of Programming Languages, 105-115.
[34]
MAIRSON, H.G. 1992. A simple proof of a theorem of Statman. Theor. Comput. Sci. 103, 2 (Sept.), 387-395.
[35]
MEYER, A. R. 1975. The inherent computational complexity of theories of ordered sets. In Proceedings of the International Congress of Mathematicians, 477- 482.
[36]
STATMAN, a. 1979. The typed A-calculus is not elementary recursive. Theor. Comput. Sci. 9 73-81.
[37]
VARDI, M.Y. 1982. The complexity of relational query languages. In ACM Symposium on Theory of Computing (San Francisco, CA), 137-146.
Recommendations
In Memoriam: Daniel G. Bobrow
Daniel G. Bobrow (1935–2017) was a research fellow at Xerox's Palo Alto Research Center and an early AI pioneer. Bobrow served as AAAI president from 1989–1991 and was a Fellow of AAAI and the Association of Computing Machinery (ACM). Prior to joining ...
In memoriam: Dr. Thomas (Tom) S. Tullis
Dr. Thomas S. Tullis was born on April 16, 1952, in Memphis, Tennessee and died from complications of COVID-19 on April 29, 2020. He leaves behind his wife, Susan (Richardson) Tullis, and two adult children, Cheryl Tullis Sirois (along with her husband, ...
Comments
Information & Contributors
Information
Published In
Copyright © 1996 ACM.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1996
Published in CSUR Volume 28, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 636Total Downloads
- Downloads (Last 12 months)45
- Downloads (Last 6 weeks)10
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in