Journal of the ACM Bibliography

Selected papers that cite this one

• James Aspnes and Orli Waarts. Modular competitiveness for distributed algorithms. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 237-246, Philadelphia, Pennsylvania, 22-24 May 1996.

• R. A. Bazzi and G. Neiger. The complexity of almost-optimal simultaneous coordination. Algorithmica, 17(3):308-321, March 1997.

• Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, and Yoav Shoham. Applications of a logic of knowledge to motion planning under uncertainty. Journal of the ACM, 44(5):633-668, September 1997.

• Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.

• Benny Chor, Mihály Geréb-Graus, and Eyal Kushilevitz. Private computations over the integers. SIAM Journal on Computing, 24(2):376-386, April 1995.

• Ronald Fagin. A quantitative analysis of modal logic. The Journal of Symbolic Logic, 59(1):209-252, March 1994.

• Ronald Fagin and Joseph Y. Halpern. Reasoning about knowledge and probability. Journal of the ACM, 41(2):340-367, March 1994.

• Ronald Fagin, Joseph Y. Halpern, and Moshe Y. Vardi. A model-theoretic analysis of knowledge. Journal of the ACM, 38(2):382-428, April 1991.

• Ronald Fagin, Joseph Y. Halpern, and Moshe Y. Vardi. What can machines know? on the properties of knowledge in distributed systems. Journal of the ACM, 39(2):328-376, April 1992.

• Uriel Feige and Joe Kilian. Impossibility results for recycling random bits in two-prover proof systems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 457-468, Las Vegas, Nevada, 29 May-1 June 1995.

• Alan D. Fekete. Asynchronous approximate agreement. Information and Computation, 115(1):95-124, 15 November 1994.

• Michael J. Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The wakeup problem. SIAM Journal on Computing, 25(6):1332-1357, December 1996.

• Erich Grädel, Phokion G. Kolaitis, and Moshe Y. Vardi. On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic, 3(1):53-69, March 1997.

• Adam J. Grove and Joseph Y. Halpern. Naming and identity in epistemic logics part I: The propositional case. Journal of Logic and Computation, 3(4):345-378, August 1993.

• Joseph Y. Halpern and Mark R. Tuttle. Knowledge, probability, and adversaries. Journal of the ACM, 40(4):917-962, September 1993.

• Joseph Y. Halpern and Lenore D. Zuck. A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols. Journal of the ACM, 39(3):449-478, July 1992.

• Ron van der Meyden. Axioms for knowledge and time in distributed systems with perfect recall. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 448-457, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

• Ron van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1 February 1998.

• Gil Neiger. Simplifying the design of knowledge-based algorithms using knowledge consistency. Information and Computation, 119(2):283-293, June 1995.

• Gil Neiger and Sam Toueg. Simulating synchronized clocks and common knowledge in distributed systems. Journal of the ACM, 40(2):334-367, April 1993.

• Anand S. Rao and Michael P. Georgeff. Decision procedures for BDI logics. Journal of Logic and Computation, 8(3):293-343, June 1998.

• Gadi Taubenfeld, Shmuel Katz, and Shlomo Moran. Impossibility results in the presence of multiple faulty processes. Information and Computation, 113(2):173-198, September 1994.

Shortcuts: