Feder and Vardi

Feder and Vardi are a duo of computer scientists known for influential work in theoretical computer science, especially in constraint satisfaction problems, finite model theory, and database theory. Their collaborations produced foundational results linking logic, combinatorics, and computational complexity, impacting researchers across institutions such as Princeton University, Massachusetts Institute of Technology, Stanford University, and Hebrew University of Jerusalem. They engaged with contemporaries from University of California, Berkeley, University of Oxford, University of Cambridge, and École Normale Supérieure, contributing to conferences like FOCS, STOC, LICS, and ICALP.

Biography

The pair pursued distinct academic paths before their collaborations. One studied at institutions including Tel Aviv University, Weizmann Institute of Science, and later held positions at Columbia University and Rutgers University, while the other obtained degrees from Hebrew University of Jerusalem and worked at research centers associated with IBM Research, Microsoft Research, and Bell Labs. Their careers intersected through visiting appointments at University of Pennsylvania, Cornell University, and participation in programs at Institute for Advanced Study and Simons Institute for the Theory of Computing. They supervised students who later joined faculties at Carnegie Mellon University, University of Texas at Austin, University of Toronto, and École Polytechnique Fédérale de Lausanne, and collaborated with scholars from École Polytechnique, University of Illinois Urbana-Champaign, and Princeton Plasma Physics Laboratory.

Collaborative Work

Their joint research often bridged topics appearing in proceedings of SIAM Symposium on Discrete Algorithms, ACM Symposium on Principles of Database Systems, and International Congress of Mathematicians symposia, and connected to results by researchers at Bell Laboratories, Max Planck Institute for Informatics, and Institut National de Recherche en Informatique et en Automatique. They formulated conjectures and theorems that intertwined methods from logicians associated with Kurt Gödel and Alfred Tarski, combinatorialists linked to Paul Erdős and László Lovász, and complexity theorists influenced by Stephen Cook, Richard Karp, and Leonid Levin. Their collaborations included joint seminars with teams from Princeton Plasma Physics Laboratory and workshops at Banff International Research Station and Mathematical Sciences Research Institute.

Major Contributions

They are best known for a characterization connecting constraint satisfaction problems to dichotomy conjectures and to preservation theorems in finite model theory, spawning results that influenced researchers at University of California, San Diego, University of Maryland, New York University, and Duke University. Their work established links between variants of the constraint satisfaction problem and logical definability involving fragments studied by scholars at University of Edinburgh, University of Amsterdam, and Australian National University. They also contributed to the study of homomorphism problems that built on earlier work by academics from University of British Columbia, McGill University, and University of Helsinki. Their results informed algorithmic approaches used by practitioners at Google Research, Amazon Science, and Facebook AI Research.

They introduced methods that connected algebraic approaches associated with A. A. Bulatov and John Jeavons to combinatorial techniques related to Haim Kaplan and Noga Alon, and they clarified complexity boundaries that influenced classifications akin to those by Michael Garey and David Johnson. Their insights shaped subsequent proofs of dichotomy theorems that engaged researchers from University of Sydney, University of Warsaw, and Seoul National University.

Selected Publications

Their joint papers appeared in venues such as Journal of the ACM, SIAM Journal on Computing, Annals of Mathematics and Artificial Intelligence, and conference proceedings for STOC and FOCS. Notable works include influential articles that were discussed alongside results by Moshe Vardi, Sanjeev Arora, Avi Wigderson, and Ravi Kannan. Their publications were cited by authors at Princeton University Press and in surveys prepared by scholars at MIT Press and Cambridge University Press, and formed part of curricula at departments such as Columbia University School of Engineering and Applied Science and Yale University.

Influence and Legacy

Their joint contributions influenced a generation of researchers affiliated with University of Chicago, Brown University, Johns Hopkins University, and Ohio State University, and affected the development of courses at Imperial College London and King's College London. The ideas they introduced reverberated through research programs at National Science Foundation, European Research Council, Simons Foundation, and academic labs at Bell Labs and IBM Research. Subsequent work by scholars from Tel Aviv University, Weizmann Institute of Science, University of Waterloo, and Technion – Israel Institute of Technology extended and applied their theories to problems in database theory, artificial intelligence, and combinatorics, influencing presentations at NeurIPS, PODS, and KDD.

Category:Theoretical computer scientists