No. Title Author Year
1 Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP Pasarkar, Amol et al. 2023
2 Reducing Tarski to Unique Tarski (In the Black-Box Model) Chen, Xi et al. 2023
3 Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets Vazirani, Vijay V. et al. 2021
4 Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria Etessami, Kousha et al. 2020
5 Fixed Point Computation Problems and Facets of Complexity (Invited Talk) Yannakakis, Mihalis 2019
6 Reachability for Branching Concurrent Stochastic Games Etessami, Kousha et al. 2019
7 The Complexity of Finding S-Factors in Regular Graphs Kolisetty, Sanjana et al. 2019
8 Temporal Synthesis for Bounded Systems and Environments Kupferman, Orna et al. 2011
9 Equilibria, Fixed Points, and Complexity Classes Yannakakis, Mihalis 2008
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI