SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC

The Complexity of the Equivalence Problem for Simple Programs

Journal of the ACM (JACM)

Reference machines require non-linear time to maintain disjoint sets

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

On time-space classes and their relation to the theory of real addition

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Presburger arithmetic with bounded quantifier alternation

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report

ACM SIGSAM Bulletin

Optimal metric planning with state sets in automata representation

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2

Discrete causal model view of biological networks

Proceedings of the 8th International Conference on Computational Methods in Systems Biology