I'm OK if you're OK: On the notion of trusting communicationRonald FaginJoseph Y. Halpern1988Journal of Philosophical Logic
Reachability is harder for directed than for undirected finite graphsMiklos AjtaiRonald Fagin1987FOCS 1987
Correction to “An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic”Y. SagivC. Delobelet al.1987Journal of the ACM
I'M OK IF YOU'RE OK: ON THE NOTION OF TRUSTING COMMUNICATION.Ronald FaginJoseph Y. Halpern1986LICS 1986
What Can Machines Know? On the Epistemic Properties of MachinesRonald FaginJoseph Y. Halpernet al.1986AAAI 1986
A simple characterization of database dependency implicationYoshito HanataniRonald Fagin1986Information Processing Letters
A formal model of knowledge, action, and communication in distributed systems: Preliminary reportJoseph Y. HalpernRonald Fagin1985PODC 1985
Bounded-depth, polynomial-size circuits for symmetric functionsRonald FaginMaria M. Klaweet al.1985Theoretical Computer Science