Number of the records: 1
Winning concurrent reachability games requires doubly-exponential patience
- 1.
SYSNO 0336087 Title Winning concurrent reachability games requires doubly-exponential patience Author(s) Hansen, K.A. (DK)
Koucký, Michal (MU-W) RID, SAI, ORCID
Miltersen, P.B. (DK)Source Title Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009. S. 332-341. - Los Angeles : IEEE Computer Society, 2009 Conference 24th Annual IEEE Symposium on Logic in Computer Science, Los Angeles, 11.08.2009-14.08.2009 Document Type Konferenční příspěvek (zahraniční konf.) Grant GP201/07/P276 GA ČR - Czech Science Foundation (CSF) IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic CEZ AV0Z10190503 - MU-W (2005-2011) Language eng Country US Keywords concurrent reachability game * patience * winning strategies Permanent Link http://hdl.handle.net/11104/0180404 File Download Size Commentary Version Access Koucky1.pdf 1 284 KB Publisher’s postprint require
Number of the records: 1