In memoriam Paris C. Kanellakis
暂无分享,去创建一个
[1] Dina Q. Goldin,et al. Constraint Programming and Database Query Languages , 1994, TACS.
[2] Catriel Beeri,et al. On the power of languages for manipulation of complex objects , 1987, VLDB 1987.
[3] Harry G. Mairson,et al. Database Query Languages Embedded in the Typed Lambda Calculus , 1996, Inf. Comput..
[4] Alexander A. Shvartsman,et al. Fault-Tolerance and Efficiency in Massively Parallel Algorithms , 1994 .
[5] Prabhakar Ragde,et al. Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.
[6] John C. Mitchell,et al. On the Sequential Nature of Unification , 1984, J. Log. Program..
[7] Harry G. Mairson,et al. An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction , 1994, ICALP.
[8] Gabriel M. Kuper,et al. Constraint Query Languages , 1995, J. Comput. Syst. Sci..
[9] Alexander A. Shvartsman,et al. Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms , 1995, Nord. J. Comput..
[10] François Bancilhon,et al. Building an Object-Oriented Database System, The Story of O2 , 1992 .
[11] Paris C. Kanellakis,et al. Logic Programming and Parallel Complexity , 1986, Foundations of Deductive Databases and Logic Programming..
[12] Sridhar Ramaswamy,et al. Functional Programming Formalisms for OODBMS Methods , 1993, NATO ASI OODBS.
[13] Alexander A. Shvartsman,et al. Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations , 1994, CONCUR.
[14] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[15] John G. Hughes,et al. Object-oriented databases , 1991, Prentice Hall International series in computer science.
[16] Sridhar Ramaswamy,et al. Indexing for Data Models with Constraints and Classes , 1996, J. Comput. Syst. Sci..
[17] Paris C. Kanellakis,et al. On the expressive power of simply typed and let-polymorphic lambda calculi , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[18] Alexander A. Shvartsman,et al. Efficient parallel algorithms can be made robust , 1989, PODC '89.
[19] Serge Abiteboul,et al. Database theory column , 1989, SIGA.
[20] Harry G. Mairson,et al. Tools for Datalog boundedness , 1991, PODS '91.
[21] Harry G. Mairson,et al. Undecidable Boundedness Problems for Datalog Programs , 1995, J. Log. Program..
[22] Richard Statman,et al. The typed λ-calculus is not elementary recursive , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[23] Stavros S. Cosmadakis,et al. Parallel evaluation of recursive rule queries , 1985, PODS '86.
[24] Limsoon Wong,et al. Relational expressive power of constraint query languages , 1996, PODS.
[25] Paris C. Kanellakis,et al. Functional database query languages as typed lambda calculi of fixed order (extended abstract) , 1994, PODS '94.
[26] Serge Abiteboul,et al. Database theory column , 1989, SIGA.
[27] M. Stojev. Fault-tolerant parallel computation , 1998 .
[28] P. Kanellakis,et al. Functional Programming Formalisms for Oodb Methods Functional Programming Formalisms for Oodb Methods , 1994 .
[29] Harry G. Mairson,et al. Unification and ML-Type Reconstruction , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[30] Alexander A. Shvartsman,et al. Efficient parallel algorithms on restartable fail-stop processors , 1991, PODC '91.
[31] Haim Gaifman,et al. Decidable optimization problems for database logic programs , 1988, STOC '88.
[32] John C. Mitchell,et al. Polymorphic unification and ML typing , 1989, POPL '89.
[33] Richard Statman,et al. The Typed lambda-Calculus is not Elementary Recursive , 1979, Theor. Comput. Sci..
[34] Harry G. Mairson. A Simple Proof of a Theorem of Statman , 1992, Theor. Comput. Sci..
[35] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[36] Sridhar Ramaswamy,et al. OODB indexing by class-division , 1995, SIGMOD '95.
[37] David Harel,et al. Horn Clauses Queries and Generalizations , 1985, J. Log. Program..
[38] Sridhar Ramaswamy,et al. Indexing for data models with constraints and classes (extended abstract) , 1993, PODS '93.
[39] Sridhar Ramaswamy,et al. Method schemas , 1990, PODS '90.
[40] Serge Abiteboul,et al. Method schemas , 1990, PODS.
[41] Paris C. Kanellakis,et al. Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[42] Albert R. Meyer. The inherent computational complexity of theories of ordered sets , 1974 .