### 8 papers:

- CSL-2015-Klein0 #game studies #lookahead #what
- What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead (FK, MZ), pp. 519–533.
- LATA-2014-FormentiHKP #complexity
- ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (EF, MH, MK, JP), pp. 372–383.
- LICS-2008-HjorthKMN #automation
- From Automatic Structures to Borel Structures (GH, BK, AM, AN), pp. 431–441.
- CSL-2007-FinkelL #rank
- There Exist Some ω-Powers of Any Borel Rank (OF, DL), pp. 115–129.
- ICALP-2004-Serre #complexity #game studies
- Games with Winning Conditions of High Borel Complexity (OS), pp. 1150–1162.
- ICALP-1997-Weihrauch #metric #probability #set
- Computability on the Probability Measures on the Borel Sets of the Unit Interval (KW), pp. 166–176.
- DLT-1993-Calude #algorithm
- Borel Normality and Algorithmic Randomness (CC), pp. 113–129.
- STOC-1983-Sipser #complexity #set
- Borel Sets and Circuit Complexity (MS), pp. 61–69.