Trees over Infinite Structures and Path Logics with Synchronization - Alex Spelten; Wolfgang Thomas; Sarah Winter (INFINITY, 2011)

Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. - Christof Löding; Sarah Winter (GandALF, 2014)

On Equivalence and Uniformisation Problems for Finite Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (ICALP, 2016)

Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. - Christof Löding; Sarah Winter (MFCS, 2016)

Uniformization Problems for Synchronizations of Automatic Relations on Words. - Sarah Winter (ICALP, 2018)

Synthesis of transducers from relations on finite words and trees. - Sarah Winter (2018)

Synthesis from Weighted Specifications with Partial Domains over Finite Words. - Emmanuel Filiot; Christof Löding; Sarah Winter (FSTTCS, 2020)

Finite-state strategies in delay games. - Sarah Winter; Martin Zimmermann 002 (Inf. Comput., 2020)

Decision Problems for Origin-Close Top-Down Tree Transducers. - Sarah Winter (MFCS, 2021)

Decision problems for origin-close top-down tree transducers (full version). - Sarah Winter (CoRR, 2021)

Weak Muller Conditions Make Delay Games Hard. - Sarah Winter; Martin Zimmermann 002 (CoRR, 2022)

Deterministic Regular Functions of Infinite Words. - Olivier Carton; Gaëtan Douéneau-Tabot; Emmanuel Filiot; Sarah Winter (ICALP, 2023)

A Regular and Complete Notion of Delay for Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (STACS, 2023)

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. - Martin Fränzle; Sarah Winter; Martin Zimmermann 002 (GandALF, 2023)

Regular Transformations (Dagstuhl Seminar 23202). - Rajeev Alur; Mikolaj Bojanczyk; Emmanuel Filiot; Anca Muscholl; Sarah Winter (Dagstuhl Reports, 2023)

Resynchronized Uniformization and Definability Problems for Rational Relations. - Christof Löding; Sarah Winter (Discret. Math. Theor. Comput. Sci., 2023)

Synthesizing Computable Functions from Rational Specifications Over Infinite Words. - Emmanuel Filiot; Sarah Winter (Int. J. Found. Comput. Sci., 2024)

Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃. - Sarah Winter; Martin Zimmermann 002 (CONCUR, 2025)

On the Existence of Reactive Strategies Resilient to Delay. - Martin Fränzle; Paul Kröger; Sarah Winter; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2025)

Finite-valued Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Gabriele Puppis; Christof Löding; Anca Muscholl; Sarah Winter (TheoretiCS, 2025)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond ∀*&#8707*. - Sarah Winter; Martin Zimmermann 002 (CoRR, 2025)

Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking. - Sarah Winter; Martin Zimmermann 002 (Acta Informatica, 2025)