Publications
On the Synthesis of Finite-State Machines from Samples of Their Behavior.
IEEE Transactions on Computers. C-21(6), 592-596.
(1972).
(1989). Embodied Meaning in a Neural Theory of Language.
Brain and Language. 89(2),
(2004).
(1989). Total Complexity and the Inference of Best Programs.
10, 181-191.
(1977).
(1984).
(2012). Hardness Results for Multicast Cost Sharing.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002). 133-144.
(2002). Incentives and Internet Computation.
33(4), 37-54.
(2002). Quasiperiodicity in Dissipative Systems: A Renormalization Group Analysis.
Physica D: Nonlinear Phenomena. 5(2-3), 370-386.
(1982).
(2012). Distributed Algorithmic Mechanism Design: Recent Results and Future Directions.
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'02). 1-13.
(2002). Sharing the Cost of Multicast Transmissions.
Journal of Computer and System Sciences. 63(1), 21-41.
(2001). Mechanism Design for Policy Routing.
Distributed Computing. 18, 11-20.
(2006). Incentive-Compatible Interdomain Routing.
Proceedings of the 7th ACM Conference on Electronic Commerce (EC'06). 130-139.
(2006). Sharing the Cost of Multicast Transmissions.
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). 218-227.
(2000). Mechanism Design for Policy Routing.
Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 11-20.
(2004). Distributed Algorithmic Mechanism Design.
363-384.
(2007). Approximation and Collusion in Multicast Cost Sharing.
Proceedings of the Third ACM Conference on Electronic Commerce (ACM-EE 2001). 253-255.
(2001). A BGP-Based Mechanism for Lowest-Cost Routing.
Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
(2002).
(2003). Hardness Results for Multicast Cost Sharing.
Theoretical Computer Science. 304(1-3), 215-236.
(2003). A BGP-Based Mechanism for Lowest-Cost Routing.
Distributed Computing. 18(1), 61-72.
(2005). Approximation and Collusion in Multicast Cost Sharing.
Games and Economic Behavior. 47(1), 36-71.
(2004).
(2002).