The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic tree isomorphism via first-order updates to a relational database
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computational properties of metaquerying problems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Relational queries over interpreted structures
Journal of the ACM (JACM)
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logics with aggregate operators
Journal of the ACM (JACM)
Theoretical Computer Science
A study of homogeneity in relational databases
Annals of Mathematics and Artificial Intelligence
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
Multi-head finite automata: data-independent versus data-dependent computations
Theoretical Computer Science
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Counting and Locality over Finite Structures: A Survey
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Logics Capturing Local Properties
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science - Database theory
The dynamic complexity of transitive closure is in DynTC0
Theoretical Computer Science - Database theory
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Counting Modulo Quantifiers on Finite Linearly Ordered Trees
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Role of Decidability in First Order Separations over Classes of Finite Structures
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Circuits And Expressions With Non-Associative Gates
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Completeness results for graph isomorphism
Journal of Computer and System Sciences
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
On the complexity of inducing categorical and quantitative association rules
Theoretical Computer Science
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic (TOCL)
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Artificial Intelligence
Randomness-Efficient Sampling within NC1
Computational Complexity
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On Second-Order Monadic Groupoidal Quantifiers
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
Theoretical Computer Science
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Reductions to graph isomorphism
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database theory: query languages
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Other complexity classes and measures
Algorithms and theory of computation handbook
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Extensions of MSO and the monadic counting hierarchy
Information and Computation
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
Characterizing definability of second-order generalized quantifiers
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Expressive Completeness for LTL With Modulo Counting and Group Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Model-checking hierarchical structures
Journal of Computer and System Sciences
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Inexpressibility results for regular languages in nonregular settings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Characterizing TC0 in terms of infinite groups
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Closure properties of weak systems of bounded arithmetic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The computational complexity of one-dimensional sandpiles
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Proceedings of the 15th International Conference on Database Theory
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Linear circuits, two-variable logic and weakly blocked monoids
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Relativizing small complexity classes and their theories
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Root finding with threshold circuits
Theoretical Computer Science
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Sublinear-Space p systems with active membranes
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Linear circuits, two-variable logic and weakly blocked monoids
Theoretical Computer Science
Random graphs and the parity quantifier
Journal of the ACM (JACM)
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.01 |