The Equivalence Problem of Simple Programs
Journal of the ACM (JACM)
Assignment Commands with Array References
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Note on probabilistic algorithms in integer and polynomial arithmetic
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
The complexity of equivalence for commutative rings
Journal of Symbolic Computation
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |