Serge Abiteboul
Moshe Y. Vardi
- S. Abiteboul and P. C. Kanellakis. Deciding Bounded Recursion in Database Logic Programs. SIGACT News 20:4, Fall 1989. Google Scholar
Digital Library
- . L. Buchsbaum, P. C. Kanellakis, and J. S. Vitter, A Data Structure for Arc Insertion and Regular Path Finding, Invited paper in special issue on deductive databases, Annals of Mathematics and Artificial Intelligence 3:187--210, March, 1991. (A preliminary version appeared in Proceedings of the 1st Annual SIAM/ACM Symposium on Discrete Algorithms (SODA'90) January 1990, pp. 22--31.) Google ScholarDigital Library
- S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable Optimization Problems for Database Logic Programs. 1988 ACM Symposium on Theory of Computing pp. 477--490. Google ScholarDigital Library
- S. S. Cosmadakis and P. C. Kanellakis. Parallel Evaluation of Recursive Rule Queries. 1986 ACM Symposium on Principles of Database Systems pp. 280--293. Google ScholarDigital Library
- G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi. Undecidable Boundedness Problems for Datalog Programs. J. Logic Programming 25 (1995), pp. 163--190. (A preliminary version of this paper, Tools for Datalog Boundedness, appeared in the 1991 ACM Symposium on the Principles of Database Systems pp. 1--13.) Google ScholarDigital Library
- P. C. Kanellakis. Logic Programming and Parallel Complexity. In Foundations of Deductive Databases and Logic Programming (ed. J. Minker), Morgan Kaufmann, 1988, pp. 547--585. Google ScholarDigital Library
- P. C. Kanellakis. Elements of Relational Database Theory. In Handbook of Theoretical Computer Science (ed. A. R. Meyer, M. Nivat, M. S. Paterson, D. Perrin and J. van Leeuwen), vol. B, Chapter 17. North Holland, 1990, pp. 1075--1144. Google ScholarDigital Library
- S. Abiteboul and P. C. Kanellakis. Object Identity as a Query Language Primitive. J. of the ACM 45(5), pp. 798--842, 1998. (An extended abstract appeared in 1989 SIGMOD Conference pp. 159--173.) Google ScholarDigital Library
- S. Abiteboul and P. C. Kanellakis. The Two Facets of Object-Oriented Data Models. IEEE Data Engineering Bulletin 15:2 (1991), pp. 3--8. Google ScholarDigital Library
- S. Abiteboul, P. C. Kanellakis, S. Ramaswamy, and E. Waller. Method Schemas. J. of Computer and System Sciences 51(3), pp. 433--455, 1995. Google ScholarDigital Library
- F. Bancilhon, C. Delobel, and P. C. Kanellakis. Building an Object-Oriented Database System: The Story of O2. Morgan Kaufmann, 1992. Google ScholarDigital Library
- A. K. Chandra and D. Harel. Horn Clause Queries and Generalizations. J. Logic Programming 2 (1985), pp. 1--15.Google ScholarCross Ref
- G. G. Hillebrand, P. C. Kanellakis, and S. Ramaswamy. Functional Programming Formalisms for OODB Methods. In Advances in Object-Oriented Databases (ed. A. Dogac, M. Tamer Özsu, A. Biliris, and T. Sellis). Springer-Verlag, Series F (Comp. and Systems Sciences), vol. 130, Ch. 2.3, pp. 73--98, 1994.Google Scholar
- M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational Expressive Power of Constraint Query Languages. J. of the ACM 45:1, 1998, pp. 1--34. (Preliminary version appears in Proc. 15th ACM Symp. on Principles of Database Systems PODS (1996), pp. 5--16.) Google ScholarDigital Library
- D. Q. Goldin and P. C. Kanellakis. Constraint Query Algebras. In Constraints 1, pp. 1--41, 1996.Google Scholar
- P. C. Kanellakis and D. Q. Goldin. Constraint Programming and Database Query Languages. Invited paper, Symposium on Theoretical Aspects of Computer Software Springer LNCS 789, pp. 96--120, Sendai Japan, April 1994. Google ScholarDigital Library
- P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint Query Languages. J. Computer and System Sciences (special issue, ed. Y. Sagiv) 51:1 (1995), pp. 26--52. (An extended abstract appeared in 1990 ACM Symposium on the Principles of Database Systems pp. 299--314.) Google ScholarDigital Library
- P. C. Kanellakis, S. Ramaswamy, D. E. Vengro, and J. S. Vitter. Indexing for Data Models with Constraints and Classes. J. Computer and System Sciences special issue ed. C. Beeri, 52:3, pp. 589--612, 1996. (An extended abstract appeared in 1993 ACM Symposium on the Principles of Database Systems pp. 233--243.) Google ScholarDigital Library
- G. Kuper, L. Libkin, and J. Paredaens, Constraint Databases Springer-Verlag, 2000. Google ScholarDigital Library
- S. Ramaswamy and P. C. Kanellakis. OODB Indexing by Class-Division. in 1995 ACM Symposium on the Management of Data pp. 139--150. Google ScholarDigital Library
- P. Revesz, Introduction to Constraint Databases Springer-Verlag, New York, 2002. Fault-Tolerant Parallel Computation. Google ScholarDigital Library
- J. Buss, P. C. Kanellakis, P. Ragde, and A. A. Shvartsman, Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20:1, pp. 45--86, 1996. Google ScholarDigital Library
- P. C. Kanellakis, D. Michailidis, and A. A. Shvartsman. Concurrency = Fault-Tolerance in Parallel Computation. Invited paper, 1994 International Conference on Concurrency Theory Springer LNCS vol. 836, pp. 242--266. Google ScholarDigital Library
- P. C. Kanellakis, D. Michailidis, and A. A. Shvartsman. Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Nordic Journal of Computing 2 (1995), pp. 146--180. (A preliminary version appeared in 1993 International Workshop on Distributed Algorithms pp. 99--114.) Google ScholarDigital Library
- P. C. Kanellakis and A. A. Shvartsman. Efficient Parallel Algorithms Can Be Made Robust. Distributed Computing 5:4 (1992), pp. 201--217. (A preliminary version appeared in 1989 ACM Symposium on Principles of Distributed Computing pp. 211--222.) Google ScholarDigital Library
- P. C. Kanellakis and A. A. Shvartsman. Efficient Parallel Algorithms On Restartable Fail-Stop Processors. 1991 ACM Symposium on Principles of Distributed Computing pp. 23--37. Google ScholarDigital Library
- P. C. Kanellakis and A. A. Shvartsman. Fault-Tolerance and Efficiency in Massively Parallel Algorithms. In Foundations of Dependable Computing - Paradigms for Dependable Applications (ed. G. M. Koob and C. G. Lau). Kluwer, 1994, pp. 125--154.Google Scholar
- P. C. Kanellakis and A. A. Shvartsman, Fault-Tolerant Parallel Computation Kluwer Academic, May 1997, ISBN 0-7923-9922-6. Google ScholarDigital Library
- S. Abiteboul and C. Beeri. The Power of Languages for the Manipulation of Complex Val ues. VLDB Journal 4(4): 727--794 (1995) First version published as INRIA Research Report 846, 1988. Google ScholarDigital Library
- C. Dwork, P. Kanellakis, and J. C. Mitchell. On the Sequential Nature of Unification. Journal of Logic Programming 1:35--50, 1984. Google ScholarDigital Library
- G. G. Hillebrand and P. C. Kanellakis. Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. 1994 ACM Symposium on Principles of Database Systems pp. 222--231. Google ScholarDigital Library
- G. G. Hillebrand and P. C. Kanellakis. On the Expressive Power of Simply-Typed and Let-Polymorphic Lambda Calculi. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science pages 253--263, New Brunswick, New Jersey, 27--30 July 1996. Google ScholarDigital Library
- G. G. Hillebrand, P. C. Kanellakis, and H. G. Mairson. Database Query Languages Embedded in the Typed Lambda Calculus. Information and Computation 127:2, 1996, pp. 117--144. (A preliminary version appeared in the 1993 IEEE Symposium on Logic in Computer Science pp. 332--343.)Google ScholarCross Ref
- G. G. Hillebrand, P. C. Kanellakis, and H. G. Mairson. An Analysis of Core-ML: Expressive Power and Type Inference. 1994 International Colloquium on Automata, Languages and Programming Springer LNCS 820, pp. 83--105. Google ScholarDigital Library
- N. Immerman. Relational Queries Computable in Polynomial Time. Information and Computation 68 (1986), pp. 86--104. Google ScholarDigital Library
- P. C. Kanellakis, H. G. Mairson, and J. C. Mitchell. Unification and ML Type Reconstruction. In Computational Logic: Essays in Honor of Alan Robinson ed. J.-L. Lassezand G. D. Plotkin. MIT Press, 1991, pp. 444--478.Google Scholar
- P. C. Kanellakis and J. C. Mitchell. Polymorphic Unification and ML Typing. 1989 ACM Symposium on the Principles of Programming Languages pp. 105--115. Google ScholarDigital Library
- H. G. Mairson. A Simple Proof of a Theorem of Statman. Theoretical Computer Science 103:2 ( September 1992), pp. 387--395. Google ScholarDigital Library
- A. R. Meyer. The Inherent Computational Complexity of Theories of Ordered Sets. Proceedings of the International Congress of Mathematicians pp. 477--482, 1975.Google Scholar
- R. Statman. The Typed - Calculusisnot Elementary Recursive. Theoretical Computer Science 9 (1979), pp. 73--81.Google ScholarCross Ref
- M. Y. Vardi. The Complexity of Relational Query Languages. 1982 ACM Symposium on Theory of Computing pp. 137--146. Google ScholarDigital Library
Index Terms
- In Memoriam: Paris C. Kanellakis
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, ...
In Memoriam: Raymond Pickholtz 1932-2022
In June, 2022, Professor Raymond Pickholtz passed away in Virginia. Ray was known as a brilliant engineer, a world-class researcher, an excellent instructor and mentor to his students, and a terrific husband and father to his family. He is survived by his ...
Comments