Ronald Fagin | Academic Influence

Ronald Fagin's AcademicInfluence.com Rankings

Ronald Fagin

Computer Science

#427

World Rank

#444

Historical Rank

#243

USA Rank

Information Technology

#6

World Rank

#6

Historical Rank

#2

USA Rank

Database

#49

World Rank

#51

Historical Rank

#26

USA Rank

computer-science Degrees

Download Badge

Computer Science

Ronald Fagin's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Why Is Ronald Fagin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ronald Fagin is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge.

(See a Problem?)

Ronald Fagin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Reasoning about knowledge (1995) (4590)
Optimal aggregation algorithms for middleware (2001) (2075)
Data exchange: semantics and query answering (2003) (1446)
Comparing top k lists (2003) (1007)
Belief, Awareness, and Limited Reasoning. (1987) (886)
Combining Fuzzy Information from Multiple Systems (1999) (827)
On the Desirability of Acyclic Database Schemes (1983) (810)
Generalized first-order spectra, and polynomial. time recognizable sets (1974) (744)
Extendible hashing—a fast access method for dynamic files (1979) (735)
Multivalued dependencies and a new normal form for relational databases (1977) (697)
A logic for reasoning about probabilities (1988) (555)
Translating Web Data (2002) (511)
Reasoning about knowledge and probability (1988) (501)
Towards heterogeneous multimedia information systems: the Garlic approach (1995) (484)
Degrees of acyclicity for hypergraphs and relational database schemes (1983) (444)
Probabilities on finite models (1976) (430)
Efficient similarity search and classification via rank aggregation (2003) (422)
On the semantics of updates in databases (1983) (408)
The Clio project: managing heterogeneity (2001) (390)
A complete axiomatization for functional and multivalued dependencies in database relations (1977) (375)
Horn clauses and database dependencies (1982) (372)
Inclusion dependencies and their interaction with functional dependencies (1982) (338)
Data exchange: getting to the core (2003) (317)
Updating Logical Databases (1986) (313)
Two Views of Belief: Belief as Generalized Probability and Belief as Evidence (1990) (313)
Fuzzy queries in multimedia database systems (1998) (312)
A new approach to updating beliefs (1990) (307)
Composing schema mappings: second-order dependencies to the rescue (2004) (294)
A simplied universal relation assumption and its properties (1982) (275)
Data-driven understanding and refinement of schema mappings (2001) (249)
Comparing and aggregating rankings with ties (2004) (241)
Combining fuzzy information from multiple systems (extended abstract) (1996) (238)
Static index pruning for information retrieval systems (2001) (237)
Clio: Schema Mapping Creation and Data Exchange (2009) (236)
Monadic generalized spectra (1975) (230)
Comparing information without leaking it (1996) (227)
A normal form for relational databases that is based on domains and keys (1981) (223)
On the Structure of Armstrong Relations for Functional Dependencies (1984) (219)
Combining fuzzy information: an overview (2002) (195)
On monadic NP vs. monadic co-NP (1993) (179)
Normal forms and relational database operators (1979) (169)
Comparing Partial Rankings (2006) (166)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic (1981) (161)
Functional Dependencies in a Relational Data Base and Propositional Logic (1977) (154)
Searching the workplace web (2003) (153)
Reachability is harder for directed than for undirected finite graphs (1988) (150)
Finite-Model Theory - A Personal Perspective (1990) (149)
Inverting schema mappings (2006) (143)
Knowledge-based programs (1995) (142)
A model-theoretic analysis of knowledge (1991) (141)
Properties of acyclic database schemes (1981) (138)
Uncertainty, belief, and probability 1 (1991) (137)
What can machines know?: On the properties of knowledge in distributed systems (1992) (121)
Data exchange: getting to the core (2003) (118)
The Garlic project (1996) (118)
Uncertainty, belief, and probability (1989) (117)
A Nonstandard Approach to the Logical Omniscience Problem (1990) (111)
A formal model of knowledge, action, and communication in distributed systems: preliminary report (1985) (111)
On an authorization mechanism (1978) (111)
Belief, Awareness, and Limited Reasoning: Preliminary Report (1985) (108)
Quasi-inverses of schema mappings (2007) (104)
Asymptotic Miss Ratios over Independent References (1977) (104)
Locally consistent transformations and query answering in data exchange (2004) (101)
Modelling knowledge and action in distributed systems (1988) (99)
Incorporating User Preferences in Multimedia Queries (1997) (96)
A formula for incorporating weights into scoring rules (2000) (96)
Compactly encoding unstructured inputs with differential compression (2002) (96)
Querying Multimedia Data from Multiple Repositories by Content: the Garlic Project (1997) (94)
Towards a theory of schema-mapping optimization (2008) (85)
Ephemeral Document Clustering for Web Applications (2001) (85)
The theory of data dependencies - a survey (1984) (80)
A Fair Carpool Scheduling Algorithm (1983) (76)
Relaxing the Triangle Inequality in Pattern Matching (1998) (76)
Query Strategies for Priced Information (2002) (75)
The hierarchical approach to modeling knowledge and common knowledge (1999) (75)
Temporal Structure (2009) (71)
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions (1985) (66)
Reverse data exchange: Coping with nulls (2009) (66)
Schema Mapping Evolution Through Composition and Inversion (2011) (64)
The Theory of Data Dependencies - An Overview (1984) (63)
Composing schema mappings: Second-order dependencies to the rescue (2005) (62)
Random walks with `back buttons' (2001) (62)
The Decomposition Versus Synthetic Approach to Relational Database Design (1977) (60)
Armstrong Databases for Functional and Inclusion Dependencies (1983) (59)
Document Spanners (2015) (57)
Horn clauses and database dependencies (Extended Abstract) (1980) (56)
The Closure of Monadic NP (2000) (56)
Common Knowledge Revisited (1996) (55)
Cold-start vs. warm-start miss ratios (1978) (50)
Simple conditions for guaranteeing higher normal forms in relational databases (1992) (48)
Logical Neural Networks (2020) (47)
A Model-Theoretic Analysis of Knowledge: Preliminary Report (1984) (46)
Multi-structural databases (2005) (45)
Acyclic Database Schemes (of Various Degrees): A Painless Introduction (1983) (42)
A Declarative Framework for Linking Entities (2016) (41)
What is an inference rule? (1990) (40)
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model (1978) (39)
A spectrum hierarchy (1975) (39)
An internal semantics for modal logic (1985) (39)
On Winning Strategies in Ehrenfeucht-Fraïssé Games (1997) (37)
Decreasing the Nesting Depth of Expressions Involving Square Roots (1985) (35)
Composition with target constraints (2010) (35)
Knowledge and implicit knowledge in a distributed environment (1986) (34)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005) (33)
The number of finite relational structures (1977) (33)
A quantitative analysis of modal logic (1994) (32)
Dichotomies in the Complexity of Preferred Repairs (2015) (32)
Declarative Cleaning of Inconsistencies in Information Extraction (2016) (29)
Fagin Functional Dependencies in a Relational Database and Propositional Logic (1977) (28)
Cleaning inconsistencies in information extraction via prioritized repairs (2014) (28)
Recursive Programs for Document Spanners (2017) (28)
Optimal Aggregation Algorithms for Middleware , PODS , 2001 , ACM , 1 — 15 (27)
Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983) (27)
Probabilistic data exchange (2010) (26)
Understanding queries in a search database system (2010) (26)
Spanners: a formal framework for information extraction (2013) (25)
Easier Ways to Win Logical Games (1996) (25)
Tools for Template Dependencies (1983) (24)
Random walks with “back buttons” (extended abstract) (2000) (23)
What Can Machines Know? On the Epistemic Properties of Machines (1986) (23)
Spectra with Only Unary Function Symbols (1997) (21)
Correction to “An equivalence between relational database dependencies and a fragment of propositional logic” (1987) (21)
Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report (1988) (21)
The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge (1992) (20)
Query strategies for priced information (extended abstract) (2000) (20)
Epistemic privacy (2008) (19)
I'm OK if you're OK: On the notion of trusting communication (1988) (19)
The structure of inverses in schema mappings (2010) (19)
Probabilistic data exchange (2011) (18)
Efficient Implementation of Large-Scale Multi-Structural Databases (2005) (16)
A normal form for preventing redundant tuples in relational databases (2012) (16)
An Internal Semantics for Modal Logic: Preliminary Report (1985) (15)
Local transformations and conjunctive-query equivalence (2012) (15)
Allowing users to weight search terms (2000) (14)
Efficiently extendible mappings for balanced data distribution (1996) (14)
Comparing the Power of Games on Graphs (1997) (12)
The closure of Monadic NP (extended abstract) (1998) (12)
The independence of miss ratio on page size (1976) (11)
A Relational Framework for Information Extraction (2016) (11)
Rewrite rules for search database systems (2011) (10)
Fuzzy Queries in Multimedia Database Systems Invited Paper: Proc. 1998 Acm Sigact-sigmod-sigart Symposium on Principles of Database Systems (1998) (10)
A Model for Knowledge (2004) (9)
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 (2005) (9)
Expressive Power of Entity-Linking Frameworks (2019) (8)
REASONING ABOUT KNOWLEDGE AND PROBABILITY: Preliminary Report (2004) (8)
Schema Management (2002) (8)
Epistemic privacy (2010) (8)
Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03) (2008) (7)
Proceedings of the 12th International Conference on Database Theory (2009) (6)
Comparing the Power of Monadic NP Games (1994) (6)
Equality-Generating Dependencies (2009) (6)
On Monadic NP vs. Monadic co-NP (Extended Abstract) (1993) (6)
Event Stream Processing (2009) (5)
A two-cardinal characterization of double spectra (1975) (5)
Tuple-Generating Dependencies (2009) (5)
Foundations of Reasoning with Uncertainty via Real-valued Logics (2020) (5)
An Operational Semantics for Knowledge Bases (1994) (5)
An equivalence between relational database dependencies and a subclass of proportional logic, RJ 2500(32750) (1980) (4)
A counterintuitive example of computer paging (1976) (4)
A Simple Characterization of Database Dependency Implication (1986) (4)
Text Retrieval (2009) (4)
Reasoning about Knowledge: A Response by the Authors (1997) (3)
Ontology-Enriched Query Answering on Relational Databases (2021) (3)
An Algorithmic View of Voting (2016) (3)
Relating Database Updates to Nonmonotonic Reasoning (1994) (3)
Solutions and query rewriting in data exchange (2013) (3)
Response to “Remarks on two new theorems of Date and Fagin” (1993) (3)
Multi-Structural Games and Number of Quantifiers (2021) (3)
Modelling knowledge and action in distributing systems: preliminary report (1988) (3)
Allowing Users to Weight Search Terms in Information Retrieval (1998) (3)
Proceedings of the 5th Conference on Theoretical Aspects of Reasoning about Knowledge, Pacific Grove, CA, USA, March 1994 (1994) (2)
Corrigendum: “Reasoning about knowledge and probability” (1998) (2)
Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings (2009) (2)
Theoretical aspects of reasoning about knowledge : proceedings of the fifth conference (TARK 1994), March 13-16, 1994, Pacific Grove, California (1994) (2)
Representation theory for a class of denumerable Markov chains (1968) (2)
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983) (2)
Applying theory to practice (2013) (2)
Protocols and Programs (2004) (2)
Two-Sorted First-Order Logic (2009) (1)
Temporal Association Mining (2009) (1)
Completeness and Complexity (2004) (1)
On the Number of Quantifiers as a Complexity Measure (2022) (1)
Readers' Responses to Forum (1969) (1)
Optimal Score Aggregation Algorithms (2016) (1)
A Note on the Existence of Continuous Functionals (1981) (0)
Guest Editor's Foreword (2002) (0)
Enterprise and Desktop Search Lecture 2: Searching the Enterprise Web Searching the Enterprise Web Searching the Workplace Web (2009) (0)
Proc. 1977 Very Large Data Bases (1977) (0)
Knowledge-Based Programming (2004) (0)
Panel on "Past and Future of Computer Science Theory" (Discussion Paper) (2021) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
Common knowledge revisited 5 (2003) (0)
Finite Model Theory and its Origins (2009) (0)
Combining Abstract Fuzzy Information from Multiple Systems (1997) (0)
Foreword (2010) (0)
Explorer Solutions and query rewriting in data exchange (2016) (0)
Allowing Users to Weight S E a R C H Terms (2001) (0)
ETL Process (2009) (0)
New foundations of reasoning via real-valued first-order logics (2022) (0)
Score Aggregation (2018) (0)
Translation Lookaside Buffer (TLB) (2009) (0)
What is an inferen e rule ? (1992) (0)
Event Connection (2009) (0)
A Finer Analysis of Multi-Structural Games and Beyond (2023) (0)
Limited Distribution Notice (2001) (0)
Eroc. Second Acm Sigact-sigmod Preliminary Report (2001) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
Compression d'indice avec perte (2001) (0)
Inverting schema mappings (2006) (0)
Random Walks with \ Ba k Buttons " (2000) (0)
Special Issue Dedicated to the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005) (2008) (0)
ER Model (2009) (0)
Knowledge in Multi-Agent Systems (2004) (0)
Knowledge and Computation (2004) (0)
A wledge: Freli~~na~ (1984) (0)
The ICDT 2014 Test of Time Award (2014) (0)
Common Knowledge and Agreement (2004) (0)
PODS 30th Anniversary Colloquium (2011) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
The Clio Project : Managing HeterogeneityRen (2001) (0)
Logic, complexity, and games (2000) (0)
Tug-of-War Sketch (2009) (0)
A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases (2023) (0)

This paper list is powered by the following services:

Other Resources About Ronald Fagin

en.wikipedia.org

What Schools Are Affiliated With Ronald Fagin?

Ronald Fagin is affiliated with the following schools:

Image Attributions

Image Source for Ronald Fagin