Name
Affiliation
Papers
ALESSANDRO FACCHINI
Univ Lausanne, Fac Business & Econ ISI, CH-1015 Lausanne, Switzerland
24
Collaborators
Citations 
PageRank 
19
35
9.47
Referers 
Referees 
References 
38
135
184
Search Limit
100135
Title
Citations
PageRank
Year
Tractable inference in credal sentential decision diagrams00.342020
The Power of the Weak00.342020
Computational Complexity and the Nature of Quantum Mechanics.00.342019
Sum-of-squares for bounded rationality.00.342019
Computational Complexity and the Nature of Quantum Mechanics (Extended version).00.342019
Model theory of monadic predicate logic with the infinity quantifier00.342018
A Credal Extension of Independent Choice Logic.00.342018
SOS for Bounded Rationality.10.372017
A Polarity Theory for Sets of Desirable Gambles.10.372017
Quantum Rational Preferences and Desirability.00.342016
Index problems for game automata00.342015
On the Weak Index Problem for Game Automata10.352015
Weak MSO: automata and expressiveness modulo bisimilarity40.432014
Deciding the Borel complexity of regular tree languages.10.352014
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata80.692013
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus40.462013
Definable Operations On Weakly Recognizable Sets of Trees.50.592011
Characterizing EF over infinite trees and modal logic on transitive graphs30.442011
On Modal µ -Calculus and Gödel-Löb Logic30.452009
The modal µ-calculus hierarchy over restricted classes of transition systems30.522009
The Wadge Hierarchy of Max-Regular Languages00.342009
Linear game automata: decidable hierarchy problems for stripped-down alternating tree automata10.382009
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I)00.342008
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata00.342007