- Operating R.S. Gaines Systems Editor
- Uncertainty, belief, and probability' RONALDFAGINAND JOSEPHY.HALPERN
- Multi-Structural Databases Ronald Fagin R. Guha Ravi Kumar
- COMPARING TOP k LISTS RONALD FAGIN, RAVI KUMAR, AND D. SIVAKUMAR
- Algorithmica (1996) 16: 215-232 Algorithmica-
- Journal of Computer and System Sciences 58, 83 99 (1999) Combining Fuzzy Information from Multiple Systems*
- Clio: Schema Mapping Creation and Data Ronald Fagin1
- Management/ H. Morgan Database Systems Editor
- Information Processing Letters 22 (1986) 281-283 North-Holland
- Inverting Schema Mappings RONALD FAGIN
- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 3, pp. 628648
- of researchanddevelopment Volume 27, Number 2, March 1983
- Simple Conditions for Guaranteeing Higher Normal Forms in Relational Databases
- Zeilaehr. 1. mdh. XWik und Crundlagen d. Minth. Bd. 21, S.123-134 (1975)
- blathematics of Information Processing ?l. Aiishel and W. G e w i r t z , Editors
- Zeilschr. 1. math. h g i k und Grundlweia d. Math. Bd. 21, S. 121-122 (1976)
- Probabilistic Data Exchange RONALD FAGIN
- Proc. 1977 Very Large Data Bases i Conference (Tokyo) I
- On an Authorization Mechanism RONALD FAGIN
- CORRIGENDUM Reasoning about Knowledge and Probability
- Knowledge and implicit knowledge in a distributed environment: Preliminary Report
- Common Knowledge: Now You Have it, Now You Don't* Ronald Fagint Joseph Y. Halpernt
- Composing Schema Mappings: Second-Order Dependencies to the Rescue
- Reverse Data Exchange: Coping with Nulls RONALD FAGIN, IBM Research -Almaden
- An Internal Semantics for Modal Logic: Preliminary Report Ronald Fagin
- A COMPLETE AXIOMATIZATION FOR FUNCTIONAL AND MULTIVALUJZD DEPENDENCIES IN DATABASE RELATIONS
- The Structure of Inverses in Schema Mappings RONALD FAGIN AND ALAN NASH
- Appeared in: Proc. National Conference on Artificial Intelligence (AAAI-94), 1994,pp. 1142-1147.
- Discrete Mathematics 19 (1977) 17-21. @ North-H&and Publishing Company
- Theoretical Computer Science 116 (1993) 3-31 Finite-model theory -a personal
- Appeared in ACM SIGMOD Record 30, 1 (March 2001), pp. 78-83. The Clio Project: Managing Heterogeneity
- Epistemic Privacy Alexandre Evfimievski Ronald Fagin David Woodruff
- A Normal Form for Relational Databases That Is Based on Domains and Keys
- THEJOURNAL OF SYMBOLIC LOGIC Volume 55, Number I, March 1990
- Allowing users to weight search terms Ronald Fagin1
- Journal of Computer and System Sciences 60,660-716 (2000) doi:l0.1006/jcss.1999.1691,available online at http://www.idealibrary.comon IDf hi@
- Horn Clauses and Database Dependencies RONALD FAGIN
- ELSEVIER Theoretical Computer Science 174 (1997) 97-121 Theoretical
- A Model-Theoretic Analysis of Knowledge RONALD FAGIN , JOSEPH Y. HALPERN , AND MOSHE Y. VARDI
- Artificial Intelligence 54 (1992) 275-317 275 Two views of belief
- Theoretical Computer Science 336 (2005) 89124 www.elsevier.com/locate/tcs
- Reasoning About Knowledge and Probability RONALD FAGIN AND JOSEPH Y. HALPERN
- Distributed Computing (1989) 3: 159-177 0Springer-Verlag 1989
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- From "Complexity of Computation" (ed. R. Karp)
- Comparing and Aggregating Rankings with Ties Ronald Fagin
- JOLXNAL Ot` XlATIIEMATICAL ANALYSIS AND APPLICATIONS 23, 500-530(1968) Representation Theory for a Class of
- Vaught Tribute Given at Memorial for Robert L. Vaught, Berkeley, California, June 2, 2002
- THE JOURNAL OF SYMBOLIC LOGIC Volume 59, Number 1. March 1994
- Combining Fuzzy Information: an Overview Ronald Fagin
- Information Processing Letters 16 (1983) 13-19 North-Holland Publishing Company
- SIAM J. COMPUT. Vol. 7. No.3,August 1978
- Math. Log. Quart. 43 (1997) 431 -455 Mathematical Logic
- Zeilschr. f. m&. Logik und Cnrndlagen d. M&. Bd. 21, S.89-96 (1975)
- Compactly Encoding Unstructured Inputs with Differential Compression
- Theoretical Computer Science 16 (1981) 231-235 North-Holland Publishing Company
- INFORMATION AND COMPUTATION 87, 78-128 ( 1990) A Logic for Reasoning about Probabilities*
- Eroc. Second ACM SIGACT-SIGMOD Symp. on P r i n c i p l e s of Database
- Reprinted from Vol. 21 1 No. 6 1 November 1977
- Efficient Implementation of Large-Scale Multi-Structural R. Fagin Ph. Kolaitis R. Kumar J. Novak D. Sivakumar A. Tomkins
- Composition with Target Constraints Marcelo Arenas
- The Structure of Inverses in Schema Mappings Ronald Fagin and Alan Nash
- Probabilistic Data Exchange Ronald Fagin
- Efficient similarity search and classification via rank aggregation
- Spectra with Only Unary Function Symbols Arnaud Durand Ronald Fagin
- Proc, 1979 ACM-SIGMOD (ed. P. A. Bernstein), 153-160.
- Static Index Pruning for Information Retrieval Systems David Carmel
- Data Exchange: Getting to the Core RONALD FAGIN, PHOKION G. KOLAITIS, and LUCIAN POPA
- On the Structure of Armstrong Relations for Functional Dependencies
- Rewrite Rules for Search Database Systems Ronald Fagin
- Schema Mapping Evolution through Composition and Inversion
- Understanding Queries in a Search Database System Ronald Fagin Benny Kimelfeld Yunyao Li Sriram Raghavan Shivakumar Vaithyanathan
- Composition with Target Constraints Marcelo Arenas
- Quasi-Inverses of Schema Mappings RONALD FAGIN, PHOKION G. KOLAITIS, and LUCIAN POPA
- Towards a Theory of Schema-Mapping Optimization Ronald Fagin
- Locally Consistent Transformations and Query Answering in Data Exchange
- Corrigendum to "Efficient Similarity Search and Classification via Rank Aggregation" by Ronald Fagin,
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 66 (2003) 614656
- Proc. 2002 Very Large Databases Conference (VLDB'02), pp. 598-609 Translating Web Data
- Theoretical Computer Science 239 (2000) 309338 www.elsevier.com/locate/tcs
- Ephemeral Document Clustering for Web Applications Yoelle S. Maarek, Ronald Fagin
- Int J Game Theory (1999)28:331-365 International 0SpringerVerlag 1999
- ELSEVIER Annals of Pure and Applied Logic 96 (1999) 89-105 APPLIED LOGIC
- InternationJournal of ComputerVision, 28(3),219-231 (1998) #@ 1998Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Distrib. Comput. (1997) 10: 199-225 0Springer-Verlag 1997
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Ronald Fagin, Moni Naor, and Peter Winkler
- Reprinted from Intelligence
- Rep"n1cd from IhTClRMATION A N D ~ O M P 1 T A l l 0 N All Rjghts Reserved hy Academic Presr. N m York and I.ondon
- Appeared in Proc. RIDE-DOM `95(5th Int'lWorkshop on Research Issues in Data1 1 Engineering: Distributed Object Management), 1995,pp. 124-131.
- Appeared in SIGMOD RECORD, March 1993,pp. 57-58. Response to "Remarks on two new theorems of
- THEJOURXALOF SYMBOLIC LOGIC Volume 57. Number 3. Sept. 1992
- What Can Machines Know? On the Properties of Knowledge in Distributed Systems
- Uncertainty in Artificial Intelligence 6 P.P. Bonissone. M. Henrion, LN. Kanal and J.F. h e r (Editors)
- RONALD F A G I N A N D JOSEPH Y . HALPERN I'M OK I F YOU'RE OK
- ARTIFICIAL INTELLIGENCE 39 Belief, Awareness, and Limited
- UPDATING LOGICAL Ronald Fagin, Gabriel M. Kuper,
- J . Symbolic Computation (1985) 1, 169-188 Decreasing the Nesting Depth of Expressions
- JOURNAL OF COMPUTER AND SYSTEMSCIENCES 28, 29-59 (1984) Inclusion Dependencies and Their Interaction
- On the Desirability of Acyclic Database Schemes CATRIEL BEERI
- Degrees of Acyclicity for Hypergraphs and Relational Database Schemes
- Proc. CAAP83 8th Colloquium on Trees in Algebra and Programming, Springer-Verlag Lecture Notes in Computer Science 159 (1983), ed. G.
- SIAM J. COMPUT. Vol.12, No. 1, February 1983
- A Simplified Universal Relation Assumption and Its Properties
- Correction to "An Equivalence between Relational Database Dependencies and a Fragment
- Extendible Hashing-A Fast Access Method for Dynamic Files
- Multivalued Dependencies and a New Normal Form for Relatknal Databases
- Reprinted from JOURNAL OF COMPUTERAND SYSTEM SCIENCES All Rights Reserved by Arademic Press, New York and London
- THEJ O ~ N A LOF SYMBOLIC LOGIC Volume 41. Number I, March 1976
- Appeared in Amer. Math. SOC.Notices 21,2, 1974,p. A-322 74T-E34. RONALD FAGIN, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598.
- Abstract of Ph.D. thesis, University of California, Berkeley, June 1973 CONTRIBUTIONS TO THE MODEL THEORY OF FINITE STRUCTURES
- SIGMOD Edgar F. Codd Innovations Award June 16, 2004
- 0022-0000/02 $35.00 2002 Elsevier Science (USA)
- Theoretical Computer Science 36 (1985) 239-250 North-Holland
- Fuzzy Queries in Multimedia Database Systems Ronald Fagin
- Epistemic Privacy ALEXANDRE EVFIMIEVSKI, RONALD FAGIN, AND DAVID WOODRUFF
- The Independence of Miss Ratio on Page Size RONALD FAGIN AND MALCOLM C. EASTON
- RJ3440 (40926)4/5/82 Computer Science
- , Appeared in Proc. IFIP 2.6 3rd Working Conference on Visual Database Systems (VDB-3), 1995.
- Searching the Workplace Web Ronald Fagin Ravi Kumar Kevin S. McCurley
- Probabilistic Data Exchange RONALD FAGIN and BENNY KIMELFELD, IBM Research Almaden
- A Normal Form for Preventing Redundant Tuples in Relational Databases
- Logical Methods in Computer Science Vol. 7 (3:13) 2011, pp. 138
