Conference and Journal Publications:
  1. Pricing Guidance in Ad Sales Negotiations: The Print Ads Example (with Adam Juda and Muthu Muthukrishnan), in The Third Annual International Workshop on Data Mining and Audience Intelligence for Advertising, Paris, 2009.

  2. General Algorithms for Testing the Ambiguity of Finite Automata (with Cyril Allauzen and Mehryar Mohri). To appear in Proceedings of Twelfth International Conference Developments in Language Theory (DLT 2008). Volume to appear in Lecture Notes in Computer Science, Kyoto, Japan, September 2008. Springer, Heidelberg, Germany.

  3. Stable Transductive Regression Algorithms (with Corinna Cortes, Mehryar Mohri and Dmitry Pechyony). In International Conference on Machine Learning (ICML 2008).

  4. Magnitude-Preserving Ranking Algorithms (with Corinna Cortes and Mehryar Mohri). In International Conference on Machine Learning (ICML 2007). Feb, 2007.

  5. An Alternative Ranking Problem for Search Engines (with Corinna Cortes and Mehryar Mohri). In Workshop on Experimental Algorithms (WEA 2007). Volume 4525 of Lecture Notes in Computer Science, pages 1-22, Rome, Italy.

  6. On the Computation of the Relative Entropy of Probabilistic Automata (with Corinna Cortes, Mehryar Mohri and Michael Riley). To appear in the International Journal on the Foundations of Computer Science (IJFCS). March, 2007.

  7. Lp distance and the Equivalence of Probabilistic Automata (with Corinna Cortes and Mehryar Mohri). In the International Journal of Foundations of Computer Science (IJFCS), Volume 18, No.4, pages 761-779, August 2007.

  8. Efficient Computation of the Relative Entropy of Probabilistic Automata (with Corinna Cortes, Mehryar Mohri and Michael Riley). In Proceedings of the 7th Latin American Symposium (LATIN 2006). Volume 3887 of Lecture Notes in Computer Science, pages 323-336, Valdivia, Chile, March 2006. Springer-Verlag, Heidelberg, Germany. [slides]

  9. On the Computation of Some Standard Distances between Probabilistic Automata (with Corinna Cortes and Mehryar Mohri). In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA 2006). Volume 4094 of Lecture Notes in Computer Science, pages 137-149, Taipei, Taiwan, August 2006. Springer-Verlag, Heidelberg, Germany. [slides]

  10. Indivisible Markets with Good Approximate Equilibrium Prices (with Richard Cole).



Technical Reports:

  1. Indivisible Markets with Good Approximate Equilibrium Prices (with Richard Cole). ECCC Technical report TR-07-017, Jan 2007.

  2. Magnitude Preserving Ranking Algorithms (with Corinna Cortes and Mehryar Mohri). Technical report TR2007-887, March 2007. Courant Institute of Mathematical Sciences, New York University.

  3. Efficient Computation of the Relative Entropy of Probabilistic Automata (with Corinna Cortes, Mehryar Mohri and Michael Riley). Technical report TR2007-886, March 2007. Courant Institute of Mathematical Sciences, New York University.

Manuscripts:
  1. The Complexity of Selfish Routing (with S.N. Maheshwari). April, 2003.

  2. Computing on WANs: Models and Algorithms (with Keshav Kunal, Nidhi Agarwal and Sandeep Sen). Jan, 2003.