6 papers:
LICS-2015-ChatterjeeHL #algorithm- Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
CSL-2011-CaiZ #bound- Tight Upper Bounds for Streett and Parity Complementation (YC, TZ), pp. 112–128.
- LICS-2006-Piterman #automaton #nondeterminism
- From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.
- LICS-2006-PitermanP #game studies #performance
- Faster Solutions of Rabin and Streett Games (NP, AP), pp. 275–284.
ICALP-2005-ChatterjeeAH #complexity #game studies #probability- The Complexity of Stochastic Rabin and Streett Games (KC, LdA, TAH), pp. 878–890.
TACAS-1996-BuhrkeLV #infinity- Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions (NB, HL, JV), pp. 207–224.
