Number of the records: 1
Winning concurrent reachability games requires doubly-exponential patience
SYS 0336087 LBL 01844^^^^^2200313^^^450 005 20240103192758.9 100 $a 20100310d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a Winning concurrent reachability games requires doubly-exponential patience 215 $a 10 s. 463 -1
$1 001 cav_un_epca*0336086 $1 010 $a 978-0-7695-3746-7 $1 011 $a 1043-6871 $1 200 1 $a Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009 $v S. 332-341 $1 210 $a Los Angeles $c IEEE Computer Society $d 2009 610 0-
$a concurrent reachability game 610 0-
$a patience 610 0-
$a winning strategies 700 -1
$3 cav_un_auth*0258451 $a Hansen $b K.A. $y DK $4 070 701 -1
$3 cav_un_auth*0215097 $a Koucký $b Michal $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0258452 $a Miltersen $b P.B. $y DK $4 070
Number of the records: 1