2020 - Member of the National Academy of Sciences
2014 - Fellow of the American Academy of Arts and Sciences
2014 - Member of the National Academy of Engineering For contributions to theory and practice of data management.
2012 - W. Wallace McDowell Award, IEEE Computer Society For fundamental and lasting contributions to the theory of databases.
2011 - Edward J. McCluskey Technical Achievement Award, IEEE Computer Society For pioneering contributions to novel data mining and distributed query processing techniques
2006 - Fellow of the American Association for the Advancement of Science (AAAS)
2000 - ACM Fellow For creating the field of finite model theory, and for fundamental research in relational database theory and in reasoning about knowledge.
1997 - IEEE Fellow For contributions to finite-model theory, and to relational database theory.
His scientific interests lie mostly in Theoretical computer science, Discrete mathematics, Set, Database and Combinatorics. His Theoretical computer science research integrates issues from Source data, Schema, Data exchange, Conjunctive query and A priori probability. His Discrete mathematics study incorporates themes from Zeroth-order logic, Autoepistemic logic, Probabilistic logic and Table.
His Set research is multidisciplinary, relying on both World Wide Web, Class, Dependency theory and Data management. The Unary operation, Finite model theory and Time complexity research Ronald Fagin does as part of his general Combinatorics study is frequently linked to other disciplines of science, such as Finite set and First order, therefore creating a link between diverse domains of science. Ronald Fagin focuses mostly in the field of Multivalued dependency, narrowing it down to topics relating to Algebra and, in certain cases, Algorithm.
His primary areas of study are Theoretical computer science, Discrete mathematics, Algorithm, Combinatorics and Data mining. His biological study spans a wide range of topics, including Schema, Probabilistic logic, Artificial intelligence, Data exchange and Data integration. Ronald Fagin studies Artificial intelligence, focusing on Knowledge representation and reasoning in particular.
His Discrete mathematics research focuses on Functional dependency and how it connects with Set. In his study, which falls under the umbrella issue of Algorithm, First normal form is strongly linked to Boyce–Codd normal form. His work on Degree as part of general Combinatorics study is frequently linked to Monadic predicate calculus, bridging the gap between disciplines.
Ronald Fagin mainly investigates Theoretical computer science, Data exchange, Data integration, Discrete mathematics and Schema. His research in Theoretical computer science intersects with topics in Data mining, Probabilistic logic, Artificial intelligence, Entity linking and Database schema. His work carried out in the field of Data exchange brings together such families of science as Web query classification, Boolean conjunctive query, Query language, Query expansion and Query optimization.
His study focuses on the intersection of Data integration and fields such as Information integration with connections in the field of Data mapping and XML. Ronald Fagin has included themes like Ranking, Boyce–Codd normal form, Conjunctive query and Combinatorics in his Discrete mathematics study. While the research belongs to areas of Schema, Ronald Fagin spends his time largely on the problem of Star schema, intersecting his research to questions surrounding Schema mapping and Algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Reasoning About Knowledge
Ronald Fagin;Joseph Y. Halpern;Moshe Y. Vardi;Yoram Moses.
Optimal aggregation algorithms for middleware
Ronald Fagin;Amnon Lotem;Moni Naor.
Journal of Computer and System Sciences (2003)
Data exchange: semantics and query answering
Ronald Fagin;Phokion G. Kolaitis;Renée J. Miller;Lucian Popa.
Theoretical Computer Science (2005)
Comparing top k lists
Ronald Fagin;Ravi Kumar;D. Sivakumar.
symposium on discrete algorithms (2003)
Belief, awareness, and limited reasoning
R. Fagin;J. Y. Halpern.
Artificial Intelligence (1987)
Combining Fuzzy Information from Multiple Systems
Journal of Computer and System Sciences (1999)
Extendible hashing—a fast access method for dynamic files
Ronald Fagin;Jurg Nievergelt;Nicholas Pippenger;H. Raymond Strong.
ACM Transactions on Database Systems (1979)
On the Desirability of Acyclic Database Schemes
Catriel Beeri;Ronald Fagin;David Maier;Mihalis Yannakakis.
Journal of the ACM (1983)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (1977)
A logic for reasoning about probabilities
R. Fagin;J.Y. Halpern;N. Megiddo.
logic in computer science (1988)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: