Expressibility and parallel complexity
SIAM Journal on Computing
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Feasible computation through model theory
Feasible computation through model theory
Reachability and the power of local ordering
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Tree canonization and transitive closure
Information and Computation
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic (TOCL)
Complete Problems for Dynamic Complexity Classes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An n! lower bound on formula size
ACM Transactions on Computational Logic (TOCL)
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Succinctness of First-Order Logic on Linear Orders
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Elements of Finite Model Theory
Elements of Finite Model Theory
| Hi-index | 0.00 |
Warmest thanks to Neil Immerman for this issue's column, which is on Progress in Descriptive Complexity. (As you can see in this column, Neil is the rare writer whose italic lines truly deserve the italics.) This issue should reach your hands shortly before winter intersession, and I'd highly recommend that, if you don't already own Neil's wonderful book Descriptive Complexity ([I] in this column's bibliography), you consider visiting your school's library and bringing it home for holidays.