The following pages link to Ronald Fagin (Q388219):
Displaying 50 items.
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Data exchange: semantics and query answering (Q555772) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Query strategies for priced information (Q696973) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Decreasing the nesting depth of expressions involving square roots (Q1063633) (← links)
- Inclusion dependencies and their interaction with functional dependencies (Q1071523) (← links)
- A simple characterization of database dependency implication (Q1077946) (← links)
- Belief, awareness, and limited reasoning (Q1096610) (← links)
- I'm OK if you're OK: On the notion of trusting commmunication (Q1114430) (← links)
- A note on the existence of continuous functionals (Q1162153) (← links)
- Armstrong databases for functional and inclusion dependencies (Q1172403) (← links)
- Two views of belief: Belief as generalized probability and belief as evidence (Q1193475) (← links)
- Asymptotic miss ratios over independent references (Q1237304) (← links)
- The number of finite relational structures (Q1250814) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Common knowledge revisited (Q1295439) (← links)
- Combining fuzzy information from multiple systems (Q1305924) (← links)
- Optimal aggregation algorithms for middleware. (Q1401963) (← links)
- (Q1575141) (redirect page) (← links)
- A formula for incorporating weights into scoring rules (Q1575143) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Expressive power of entity-linking frameworks (Q1740667) (← links)
- The hierarchical approach to modeling knowledge and common knowledge (Q1806329) (← links)
- A logic for reasoning about probabilities (Q1813497) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- On monadic NP vs monadic co-NP (Q1898480) (← links)
- Efficiently extendible mappings for balanced data distribution (Q1920430) (← links)
- Representation theory for a class of denumerable Markov chains (Q2553209) (← links)
- Document Spanners (Q2796400) (← links)
- An Algorithmic View of Voting (Q2827491) (← links)
- The structure of inverses in schema mappings (Q2999780) (← links)
- Epistemic privacy (Q2999783) (← links)
- On the Desirability of Acyclic Database Schemes (Q3026382) (← links)
- Degrees of acyclicity for hypergraphs and relational database schemes (Q3026383) (← links)
- Expressive Power of Entity-Linking Frameworks (Q3174899) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
- Query strategies for priced information (extended abstract) (Q3192028) (← links)
- Composition with Target Constraints (Q3224679) (← links)
- (Q3309102) (← links)
- Compactly encoding unstructured inputs with differential compression (Q3455534) (← links)
- (Q3476790) (← links)
- Reachability is harder for directed than for undirected finite graphs (Q3489984) (← links)
- Data exchange: getting to the core (Q3549128) (← links)
- Inverting schema mappings (Q3549131) (← links)
- (Q3677203) (← links)
- Correction to “An equivalence between relational database dependencies and a fragment of propositional logic” (Q3765274) (← links)
- On the Structure of Armstrong Relations for Functional Dependencies (Q3766891) (← links)
- (Q3814797) (← links)
