Journal of the ACM Bibliography

Selected papers that cite this one

• Shipei Zhang, Oleg Sokolsky, and Scott A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 154-163, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

Selected references

• Haim Gaifman, Harry Mairson, Yehoshua Sagiv, and Moshe Y. Vardi. Undecidable optimization problems for database logic programs. In Proceedings, Symposium on Logic in Computer Science, pages 106-115, Ithaca, New York, 22-25 June 1987. The Computer Society of the IEEE.

• Neil Immerman. Relational queries computable in polynomial time. Information and Control, 68(1-3):86-104, January/February/March 1986.

• Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 137-146, San Francisco, California, 5-7 May 1982.

Shortcuts: