Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local best-rep...