Relational queries computable in polynomial time
Information and Control
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proceedings of the 30th IEEE symposium on Foundations of computer science
Evolving algebras 1993: Lipari guide
Specification and validation methods
On the completeness of object-creating database transformation languages
Journal of the ACM (JACM)
Information and Computation - Special issue: logic and computational complexity
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract state machines and computationally complete query languages
Information and Computation
The inference problem for template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The implication and finite implication problems for typed template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Languages for Polynomial-Time Queries - An Ongoing Quest
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Abstract State Machines and Computationally Complete Query Languages
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computable queries for relational data bases (Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Quest for a Logic Capturing PTIME
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Structure and complexity of relational queries
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the Descriptive Complexity of Linear Algebra
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Database Query Processing Using Finite Cursor Machines
Theory of Computing Systems
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Constraint Databases
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.01 |
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoidable that Gurevich made some great contributions to database theory. We discuss some of these contributions, and, along the way, present some personal anecdotes connected to Yuri and the author. We also describe the honorary doctorate awarded to Gurevich by Hasselt University (then called Limburgs Universitair Centrum) in 1998.