Yannet Interian Center for Applied Math 657 Rhodes Hall Cornell University Ithaca, NY 14853 tel. (607) 255-3399 interian@cam.cornell.edu interian@berkeley.edu

I just joined Google as an Ads Quality Engineering Analyst.

In the fall 2007 I was a fellow at the Institute for Pure and Applied Mathematics (IPAM) at UCLA. I participated in a semester on Mathematics of Knowledge and Search Engines. Last year I was a postdoc at UC Berkeley. Before that I was a Ph.D student at the Center for Applied Mathematics at Cornell University.

My Ph.D research focused in the analysis of algorithms and random structures and their applications. I am particularly interested in formulating new abstract ideas that generalize situations from real world problems, and in analyzing their properties. In my research I combine intuition from theoretical formalisms to create practical tools. I worked on problems related to Random Satisfiability, Quantify Boolean Satisfiability and the Genomic Midpoint problem. My work ranged from analyzing algorithms and properties of random problem distributions, to the development of algorithms and programs for practical solutions. My Ph.D thesis advisers are Bart Selman and Rick Durrett.

At IPAM I gave a tutorial on "An Introduction to the Structure of Information Networks"pdf.

In the summer of 2006 I taught a course on Networks and Algorithms at the Summer Math Institute at Cornell.

Publications:

Median Genomic Problem

• Richard Durrett and Yannet Interian. Genomic Midpoints: Computation and Evolutionary Implications Submitted.


• Yannet Interian and Richard Durrett. Computing Genomic Midpoints. Submitted.

Satisfiability, QBF's and Random Models

• Yannet Interian and Gabriel Corvera. Local Search Algorithms for MiN-SAT. Submitted.


• Yannet Interian, Gabriel Corvera, Bart Selman and Ryan Williams. Unsatisfying Walks: Proving QBFs False with Local Search. Submitted . A previous version of this paper appeared In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics 2006, Fort Lauderdale, Florida . [abstract code, pdf]


• Hubie Chen and Yannet Interian. A Model for Generating Random Quantified Boolean Formulas [pdf , abstract]. In Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), 2005, Edinburgh, Scotland. [formula generator]


• Yacine Boufkhad, Olivier Dubois, Yannet Interian, and Bart Selman. Regular random k-SAT: properties of balanced formulas. [pdf abstract]. To appear in Journal of Automated Reasoning 2005. [formula generator]


• Yannet Interian. Approximation algorithm for random MAX-k-SAT pdf , abstract] In International Conference on Theory and Applications of Satisfiability Testing SAT 2004. Full version to appear in Springer-Verlag Lecture Notes in Computer Science.


• Yannet Interian. Backdoor Sets for random 3-SAT [pdf] In International Conference on Theory and Applications of Satisfiability Testing SAT 2003

Other Publications