loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
Faster Solutions of Rabin and Streett Games
Seattle, Washington
August 12-August 15
ISBN: 0-7695-2631-4
ASCII Text
x 
 
Nir Piterman, Amir Pnueli, "Faster Solutions of Rabin and Streett Games," Logic in Computer Science, Symposium on, pp. 275-284, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2006.23,
author = {Nir Piterman and Amir Pnueli},
title = {Faster Solutions of Rabin and Streett Games},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2006},
issn = {1043-6871},
pages = {275-284},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2006.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Faster Solutions of Rabin and Streett Games
SN - 1043-6871
SP275
EP284
A1 - Nir Piterman,
A1 - Amir Pnueli,
PY - 2006
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Nir Piterman, EPFL, Switzerland
Amir Pnueli, Weizmann Institute of Science, Israel
In this paper we improve the complexity of solving Rabin and Streett games to approximately the square root of previous bounds. We introduce direct Rabin and Streett ranking that are a sound and complete way to characterize the winning sets in the respective games.
Citation:
Nir Piterman, Amir Pnueli, "Faster Solutions of Rabin and Streett Games," lics, pp.275-284, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.