The following pages link to Abdallah Saffidine (Q307769):
Displaying 18 items.
- On the complexity of connection games (Q307770) (← links)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Constrained swap dynamics over a social network in distributed resource reallocation (Q1617667) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- Condorcet winning sets (Q2341123) (← links)
- Positional games and QBF: the corrective encoding (Q2661369) (← links)
- Minimal Proof Search for Modal Logic K Model Checking (Q2915084) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- Material Symmetry to Partition Endgame Tables (Q2947925) (← links)
- Score Bounded Monte-Carlo Tree Search (Q3073742) (← links)
- (Q3455603) (← links)
- The Parameterized Complexity of Positional Games (Q5111422) (← links)
- (Q5144355) (← links)
- (Q5282973) (← links)
- Safe Multi-Agent Pathfinding with Time Uncertainty (Q5856485) (← links)
- QBF programming with the modeling language bule (Q6572050) (← links)
- HSVI can solve zero-sum partially observable stochastic games (Q6624522) (← links)
- Constructions, bounds, and algorithms for peaceable queens (Q6732132) (← links)
