The first order definability of graphs: upper bounds for quantifier depth
Discrete Applied Mathematics
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
From Hilbert's program to a logic tool box
Annals of Mathematics and Artificial Intelligence
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On Models of a Nondeterministic Computation
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
A logical approach to data-aware automated sequence generation
Transactions on Computational Science XV
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |